Checking $2 \times M$ separability via semidefinite programming

Details Checking $2 \times M$ separability via semidefinite programming Checking $2 \times M$ separability via semidefinite programming

2003-01-14

arxiv.org/abs/quant-ph/0301058v1

Physics

Quantum Physics

4 pages. Phys. Rev. A., to appear

Scientific paper

10.1103/PhysRevA.67.010303

In this paper we propose a sequence of tests which gives a definitive test for checking $2\times 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 {\it all} $2 \times 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 ${\mathbb C}^{2 \times 2} \to {\mathbb C}^{M\times M}$. The latter in turn is solved by characterizing all positive quadratic matrix polynomials in a complex variable.

Affiliated with

Also associated with

No associations

Rating

Checking $2 \times M$ separability via semidefinite programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Checking $2 \times M$ separability via semidefinite programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Checking $2 \times M$ separability via semidefinite programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-220395