Scalable Ellipsoidal Classification for Bipartite Quantum States

Abstract

The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^2-1$, whose components are the projections of the matrix onto some selected basis. We suggest a method to test separability, based on successive optimization programs. First, we find the Minimum Volume Covering Ellipsoid that encloses a particular set of properly vectorized bipartite separable states, and then we compute the Euclidean distance of an arbitrary vectorized bipartite Density Operator to this ellipsoid. If the vectorized Density Operator falls inside the ellipsoid, it is regarded as separable, otherwise it will be taken as entangled. Our method is scalable and can be implemented straightforwardly in any desired dimension. Moreover, we show that it allows for detection of Bound Entangled States

arXiv comment8 pages, 5 figures, 3 tables. Revised version, to appear in Physical Review A

References in corpus (18)

• Separability Criterion for Density Matrices
• Separability of Mixed States: Necessary and Sufficient Conditions
• Separability criterion and inseparable mixed states with positive partial transposition
• Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
• Optimization of entanglement witnesses
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• A complete family of separability criteria
• Distinguishing separable and entangled states
• Entanglement enhanced information transmission over a quantum channel with correlated noise
• Quantifying Entanglement with Witness Operators
• Schmidt number witnesses and bound entanglement
• Quantitative entanglement witnesses
• A Geometric Picture of Entanglement and Bell Inequalities
• On entanglement-assisted classical capacity
• Optimal Entanglement Witnesses for Qubits and Qutrits
• Separable Multipartite Mixed States - Operational Asymptotically Necessary and Sufficient Conditions
• Geometric entanglement witnesses and bound entanglement
• A Robust Semidefinite Programming Approach to the Separability Problem