A cone approach to the quantum separability problem
D. Salgado, J.L. Sanchez-Gomez, and M. Ferrero

TL;DR
This paper introduces a cone-based method for detecting quantum state separability that is independent of subsystem dimensions, providing new criteria and extending to multipartite entanglement detection.
Contribution
It proposes a novel cone decomposition approach for quantum states, offering necessary and sufficient conditions for separability and genuine multipartite entanglement detection.
Findings
Decomposition of quantum states into separable and lower-rank components.
Necessary and sufficient conditions for separability based on the decomposition.
Extension of the method to multipartite entanglement detection.
Abstract
Exploiting the cone structure of the set of unnormalized mixed quantum states, we offer an approach to detect separability independently of the dimensions of the subsystems. We show that any mixed quantum state can be decomposed as , where is a separable matrix whose rank equals that of and the rank of is strictly lower than that of . With the simple choice we have a necessary condition of separability in terms of , which is also sufficient if the rank of equals 1. We give a first extension of this result to detect genuine entanglement in multipartite states and show a natural connection between the multipartite separability problem and the classification of pure states under stochastic local operations and classical communication (SLOCC). We argue that this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
