The Set of Separable States has no Finite Semidefinite Representation Except in Dimension $3\times 2$
Author:
Open Access
- 31 July 2021
- journal article
- research article
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 386 (3) , 1319-1335
Abstract
Given integers $$n \ge m$$ , let $$\text {Sep}(n,m)$$ be the set of separable states on the Hilbert space $$\mathbb {C}^n \otimes \mathbb {C}^m$$ . It is well-known that for $$(n,m)=(3,2)$$ the set of separable states has a simple description using semidefinite programming: it is given by the set of states that have a positive partial transpose. In this paper we show that for larger values ofnandmthe set $$\text {Sep}(n,m)$$ has no semidefinite programming description of finite size. As $$\text {Sep}(n,m)$$ is a semialgebraic set this provides a new counterexample to the Helton–Nie conjecture, which was recently disproved by Scheiderer in a breakthrough result. Compared to Scheiderer’s approach, our proof is elementary and relies only on basic results about semialgebraic sets and functions.
Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Exposed Faces of Semidefinitely Representable SetsSIAM Journal on Optimization, 2010
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and SetsSIAM Journal on Optimization, 2009
- Advances in convex optimization: conic programming2007
- Complete family of separability criteriaPhysical Review A, 2004
- Separability of mixed states: necessary and sufficient conditionsPhysics Letters A, 1996
- Separability Criterion for Density MatricesPhysical Review Letters, 1996
- Some geometric results in semidefinite programmingJournal of Global Optimization, 1995
- Positive maps of low dimensional matrix algebrasReports on Mathematical Physics, 1976
- Positive semidefinite biquadratic formsLinear Algebra and its Applications, 1975
- A note on biquadratic formsLinear Algebra and its Applications, 1973