The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\)
From MaRDI portal
Publication:2050062
DOI10.1007/s00220-021-04163-2zbMath1472.14066arXiv1905.02575OpenAlexW3187545495MaRDI QIDQ2050062
Publication date: 30 August 2021
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.02575
Semidefinite programming (90C22) Convex programming (90C25) General theory of (C^*)-algebras (46L05) Semialgebraic sets and related spaces (14P10) Quantum coherence, entanglement, quantum correlations (81P40)
Related Items
Lifting for Simplicity: Concise Descriptions of Convex Sets, Bounding the separable rank via polynomial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive semidefinite biquadratic forms
- Positive maps of low dimensional matrix algebras
- Some geometric results in semidefinite programming
- Separability of mixed states: necessary and sufficient conditions.
- A note on biquadratic forms
- There is no direct generalization of positive partial transpose criterion to the three-by-three case
- Construction of exposed indecomposable positive linear maps between matrix algebras
- Genericity in Polynomial Optimization
- Exposed Faces of Semidefinitely Representable Sets
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
- Separability Criterion for Density Matrices
- Spectrahedral Shadows
- Dvoretzky's theorem and the complexity of entanglement detection
- Lifts of Convex Sets and Cone Factorizations
- Alice and Bob Meet Banach
- Algorithms in real algebraic geometry
