Computational complexity of the quantum separability problem

Details Computational complexity of the quantum separability problem Computational complexity of the quantum separability problem

2006-03-22

arxiv.org/abs/quant-ph/0603199v7

Quantum Information and Computation, Vol. 7, No. 4 (2007) 335-370

Physics

Quantum Physics

Scientific paper

Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first systematic and comprehensive treatment of this (bipartite) quantum separability problem, focusing on its deterministic (as opposed to randomized) computational complexity. First, I review the one-sided tests for separability, paying particular attention to the semidefinite programming methods. Then, I discuss various ways of formulating the quantum separability problem, from exact to approximate formulations, the latter of which are the paper's main focus. I then give a thorough treatment of the problem's relationship with the complexity classes NP, NP-complete, and co-NP. I also discuss extensions of Gurvits' NP-hardness result to strong NP-hardness of certain related problems. A major open question is whether the NP-contained formulation (QSEP) of the quantum separability problem is Karp-NP-complete; QSEP may be the first natural example of a problem that is Turing-NP-complete but not Karp-NP-complete. Finally, I survey all the proposed (deterministic) algorithms for the quantum separability problem, including the bounded search for symmetric extensions (via semidefinite programming), based on the recent quantum de Finetti theorem; and the entanglement-witness search (via interior-point algorithms and global optimization). These two algorithms have the lowest complexity, with the latter being the best under advice of asymptotically optimal point-coverings of the sphere.

Affiliated with

Also associated with

No associations

Rating

Computational complexity of the quantum separability problem 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 Computational complexity of the quantum separability problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational complexity of the quantum separability problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548905