ResearchPod Summary
Determining whether a global quantum state is uniquely determined among all possible states by its local marginals (the UDA problem) is a fundamental challenge in quantum certification. While pure states have been studied extensively, mixed states remain less understood. This paper investigates the 2-UDA problem for three-qubit mixed states by analyzing the geometric structure of the state's range and extends these findings to multipartite systems and genuine multipartite entanglement (GME) certification.
The authors employ a range-based approach, using the rank of the density matrix and the geometric structure of its range as primary invariants. They utilize projective geometry and the Cayley hyperdeterminant to classify GHZ-SLOCC-free subspaces. For rank-two states, they derive a necessary and sufficient criterion reduced to a finite quadratic-form test. For higher-rank states, they formulate an exact range-restricted semidefinite programming (SDP) criterion. Finally, they use characteristic classes and spin-flip refinements to establish universal high-rank obstructions for multipartite systems.
AI-generated third-party summary by ResearchPod. Not official content or an endorsement by the paper authors or affiliated organizations.