The set of separable states has no finite semidefinite representation except in dimension $3\times 2$
Author:
Preprint
Abstract
Given integers n $\geq$ m, let 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 of n and m the set Sep(n,m) has no semidefinite programming description of finite size. As 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 10 references indexed in Scilit:
- Spectrahedral ShadowsSIAM Journal on Applied Algebra and Geometry, 2018
- There is no direct generalization of positive partial transpose criterion to the three-by-three caseJournal of Mathematical Physics, 2016
- Construction of exposed indecomposable positive linear maps between matrix algebrasLinear and Multilinear Algebra, 2016
- Lifts of Convex Sets and Cone FactorizationsMathematics of Operations Research, 2013
- 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
- Complete family of separability criteriaPhysical Review A, 2004
- Separability Criterion for Density MatricesPhysical Review Letters, 1996
- Some geometric results in semidefinite programmingJournal of Global Optimization, 1995
- Positive semidefinite biquadratic formsLinear Algebra and its Applications, 1975