arXiv:quant-ph/0301058 · Physical Review A
Checking 2×M quantum separability via semidefinite programming
Hugo J. Woerdeman
Abstract
In this paper, we propose a sequence of tests which give a definitive test for checking $2\ifmmode\times\else\texttimes\fi{}M$ separability. The test is definitive in the sense that each test corresponds to checking membership in a cone, and that the closure of the union of all these cones consists exactly of all $2\ifmmode\times\else\texttimes\fi{}M$ separable states. Membership in each single cone may be checked via semidefinite programming, and is thus a tractable problem. This sequential test comes about by considering the dual problem, the characterization of all positive maps acting ${C}^{2\ifmmode\times\else\texttimes\fi{}2}\ensuremath{\rightarrow}{C}^{M\ifmmode\times\else\texttimes\fi{}M}.$ The latter in turn is solved by characterizing all positive quadratic matrix polynomials in a complex variable.