Computability
A cutting plane algorithm for convex programming that uses analytic centers
Mathematical Programming: Series A and B
SIAM Review
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Interior point algorithms: theory and analysis
Interior point algorithms: theory and analysis
Mathematics of Operations Research
Quantum computation and quantum information
Quantum computation and quantum information
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Separation of NP-Completeness Notions
SIAM Journal on Computing
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization
Detecting quantum entanglement
Theoretical Computer Science - Natural computing
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi
ACM Transactions on Mathematical Software (TOMS)
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A matrix realignment method for recognizing entanglement
Quantum Information & Computation
A quasipolynomial-time algorithm for the quantum separability problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
Strong NP-hardness of the quantum separability problem
Quantum Information & Computation
Separability criteria based on the bloch representation of density matrices
Quantum Information & Computation
Epsilon-net method for optimizations over separable states
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
Journal of the ACM (JACM)
| Hi-index | 0.00 |
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 [1-3]; and the entanglement-witness search (via interiorpoint algorithms and global optimization) [4, 5]. These two algorithms have the lowest complexity, with the latter being the best under advice of asymptotically optimal pointcoverings of the sphere.