Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research advances quantum system certification by establishing rigorous criteria for determining when mixed states are uniquely defined by their local marginals. By leveraging range-based analysis and semidefinite programming, the study provides exact tests for three-qubit systems and extends high-rank obstructions to broader multipartite architectures. These findings offer a practical framework for verifying genuine multipartite entanglement without requiring full state tomography.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Rank and Range Criteria for Mixed-State Determination from Local Marginals

arXiv2 min read

arXiv:2608.24061v1 Announce Type: new Abstract: Determining whether a mixed quantum state is uniquely determined among all states by its k-body marginals (k-UDA) is a fundamental problem in quantum system certification. We develop a range-based approach to this problem by analyzing the structure of the range of the global state. For three-qubit states, we show that states with GHZ-SLOCC-free ranges are 2-UDA at ranks one, three, and four. We derive a necessary and sufficient range criterion for rank-two 2-UDA states and reduce it to a finite quadratic-form test. To cover the remaining range configurations, we formulate an exact range-restricted semidefinite programming criterion and extend it to arbitrary finite-dimensional tripartite states. We also show that every three-qubit state of rank at least five is not 2-UDA, and further extend high-rank obstructions to multipartite systems. For a channel-based multipartite family, we characterize exactly when a state is $(n-1)$-UDA and show that lower-order marginals never suffice. Finally, we apply these results to the certification of genuine multipartite entanglement.

Abstract:Determining whether a mixed quantum state is uniquely determined among all states by its k-body marginals (k-UDA) is a fundamental problem in quantum system certification. We develop a range-based approach to this problem by analyzing the structure of the range of the global state. For three-qubit states, we show that states with GHZ-SLOCC-free ranges are 2-UDA at ranks one, three, and four. We derive a necessary and sufficient range criterion for rank-two 2-UDA states and reduce it to a finite quadratic-form test. To cover the remaining range configurations, we formulate an exact range-restricted semidefinite programming criterion and extend it to arbitrary finite-dimensional tripartite states. We also show that every three-qubit state of rank at least five is not 2-UDA, and further extend high-rank obstructions to multipartite systems. For a channel-based multipartite family, we characterize exactly when a state is $(n-1)$-UDA and show that lower-order marginals never suffice. Finally, we apply these results to the certification of genuine multipartite entanglement.

arXiv:2608.24061 [quant-ph]

(or arXiv:2608.24061v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.24061 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 250 words

Related coverage