Computational complexity of the quantum separability problem

Quantum Information and Computation

Volumn 7, Issue 4, 2007, Pages 335-370

  Ioannou, Lawrence M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

The contents of the keywords

Indexed keywords

GLOBAL OPTIMIZATION; HARDNESS; NP-HARD; POLYNOMIALS;

ASYMPTOTICALLY OPTIMAL; CRYPTOGRAPHIC RESOURCES; ENTANGLEMENT WITNESS; INTERIOR POINT ALGORITHM; NP-HARDNESS RESULTS; QUANTUM SEPARABILITY; SEMI-DEFINITE PROGRAMMING; THE CONTENTS OF THE KEYWORDS;

QUANTUM ENTANGLEMENT;

EID: 34247230238     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (82)

1. A. C. Doherty, P. A. Parrilo. and F. M. Spedalieri. Distinguishing separable and entangled states. Phys. Rev. Lett.. 88:187904, 2002.
2. A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri. Complete family of separability criteria. Phys. Rev. A, 69:022308, 2004.
3. M. Christandl, R. König, G. Mitchison, and R. Ronner. One-arid-a-half quantum do finetti theorems, 2006. quant-ph/0602130.
4. L. M. Ioannou, B. C. Travaglione, D. C. Cheung, and A. K. Ekert. Improved algorithm for quantum separability and entanglement detection. Phys. Rev. .4. 70:060303 R, 2004.
5. L. M. Ioannou and B. C. Travaglione. Quantum separability and entanglement detection via entanglement-witness search and global optimization. Phys. Rev. A. 73:052314, 2006.
6. P. Horodecki. Separability criterion and inseparable mixed states with positive partial transposition. Phys. Lett. A, 232:333, 1997.
7. Dagmar Bruß. Characterizing entanglement, J. Math. Phys., 43:4237, 2002.
8. B. M. Terhal. Detecting quantum entanglement. Journal Theoretical Computer Science., 287(1):313- 335, 2002.
9. A. Sen De, U. Sen, M. Lewenstein, and A. Sanpera. The separability versus entanglement problem, 2005. quant-ph/0508032.
10. A. Peres. Separability criterion for density matrices. Phys. Rev. Lett., 77:1413-1415. 1996.
11. M. Horodecki and P. Horodecki. Reduction criterion of separability and limits for a class of distillation protocols. Phys. Rev. A, 59:4206, 1999.
12. R. Horodecki, P. Horodecki, and M. Horodecki. Quantum α-entropy inequalities: independent condition for local realism? Phys. Lett. A, 210:377-381, 1996.
13. M. Nielsen and J. Kempe. Separable states are more disordered globally than locally. Phys. Rev. Lett., 86:5184-7, 2001.
14. O. Rudolph. Further results on the cross norm criterion for separability, 2002. quant-ph/0202121.
15. K. Chen and L.-A. Wu. A matrix realignment method for recognizing entanglement. Quant. Inf. Camp., 3:193, 2003.
16. Michal Horodecki, Pawel Horodecki, and Ryszard Horodecki. Separability of mixed quantum states: linear contractions approach. 2002. quant-ph/0206008.
17. S. L. Braunstein, C. M. Caves, H. Jozsa, N. Linden, S. Poposni, and R. Schack, Separability of very noisy mixed states and implications for NMR. quantum computing. Phys. Rev. Lett., 83:1054, 1999.
18. L. Gurvits and H. Barnum. Largest separable balls around the maximally mixed bipartite quantum state. Phys. Rev. A, 66:062311, 2002.
19. K. Zyczkowski, P. Horodecki, A. Sanpera, and M. Lewenstein. Volume of the set of separable states. Phys.Rev. A, 58:883, 1998.
20. G. Vidal and R. Tarrach. Robustness of entanglement. Phys. Rev. A, 59:141, 1999.
21. B. Kraus, J. I. Cirac, S. Karnas, and M. Lewenstein. Separability in 2 × n composite quantum systems. Phys. Rev. A, 61:062302, 2000.
22. M. Horodecki, P. Horodecki, and R. Horodecki. Separability of mixed states: necessary and sufficient conditions. Phys. Lett. A, 223:1-8, 1996.
23. P. Horodecki, M. Lewenstein, G. Vidal, and I. Cirac. Operational criterion and constructive checks for the separabilty of low-rank density matrices. Phys. Rev. A, 62:032310, 2000.
24. S. Albeverio, Shao-Ming Fei, and Debashish Goswami. Separability of rank two quantum states. Phys. Lett. A, 286:91-96, 2001.
25. J. H. Wilkinson and C. Reinsch. Linear Algebra, Handbook for Automatic Computation Vol. II. Springer-Verlag, Berlin, 1971.
26. Gene H. Golub and Charles F. van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 1996.
27. J. Stoer and R. Bulirsch. Introduction to numerical analysis. Springer-Verlag, New York, 2002.
28. J. H. Wilkinson. Global convergence of tridiagonal QR algorithm with origin shifts. Lin. Alg. Appl., 1:409-420, 1968.
29. M. Lewenstein and A. Sanpera. Separability and entanglement of composite quantum systems. Phys. Rev. Lett., 80:2261, 1998.
30. R. T. Thew, K. Nemoto, A. G. White, and W. J. Munro. Qudit quantum-state tomography. Phys. Rev. A, 66:012303, 2002.
31. Lieven Vandenberghe and Stephen Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, 1996.
32. M. Fannes, J. T. Lewis, and A. Verbeure. Symmetric states of composite systems. Lett. Math. Phys., 15:255, 1988.
33. C. M. Caves, C. A. Fuchs, and R. Schack. Unknown quantum states: The quantum de finetti representation. J. Math. Phys., 43:4537, 2002.
34. Jens Eisert, Philipp Hyllus, Otfried Gühne, and Marcos Curty. Complete hierarchies of efficient approximations to problems in entanglement theory. Phys. Rev. A, 70:062317, 2004.
35. Jean B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. Optim.. 11(3):796-817, 2001.
36. Didier Henrion and Jean-Bernard Lasserre. GloptiPoly: Global optimization over polynomials with Matlab arid SeDuMi. ACM Transactions on Mathematical Software. 29(2): 165-194, 2003.
37. V. Vedral, M. Plenio, M. A. Rippin, and P. L. Knight. Quantifying entanglement. Phys. Rev. Lett.. 78:2275-2279, 1997.
38. Matthias Christandl. Bipartite Entanglement: A Cryptographic point of view. PhD thesis. University of Cambridge. 2005.
39. C. H. Beunett, D. P. DiVinceuzo, J. A. Smolin, and W. K. Wootters. Mixed state entanglement and quantum error correction. Phys. Rev. A, 54(5):3824-3851, 1996.
40. Armin Uhlrnann. Optimizing entropy relative to a channel or a subalgebra. OPEN SYS.AND INF.DYN., 5:209, 1998. URL http://arxiv.org/abs/quant-ph/ 9701014.
41. Fernando G. S. L. Brandão and Reirialdo O. Vianna. Robust semidefinite programming approach to the separability problem. Phys. Rev. A, 70:062309 R, 2004.
42. Fernando G. S. L. Brandão and Reinaldo O. Vianna. Separable multipartite mixed states: Operational asymptotically necessary and sufficient conditions. Phys. Rev. Lett., 93:220503, 2004.
43. Hugo J. Woerdeman. Checking 2 × m quantum separability via semidefinite programming. Phys. Rev. A, 67:010303 R, 2003.
44. P. Horodecki and A. Ekert. Method for direct detection of quantum entanglement. Phys. Rev. Lett., 89:127902, 2002.
45. W. C. Myrvold. The decision problem for entanglement. In R. S. Cohen, M. Horne, and J. Stachel, editors, Potentiality, entanglement and passion-at-a-distance, pages 177-190. Kluwer Academic Publishers, 1997.
46. K. Weihrauch. Computability. Springer-Verlag, Berlin, 1987.
47. A. Seidenberg. A new decision method for elementary algebra. Annals of Mathematics, 60(2):365-374, 1954.
48. Alfred Tarski. A decision method for elementary algebra and geometry. Technical report, University of California, Berkeley, 1951.
49. Saugata Basu, Richard Pollack, and Marie-Françoise Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the. ACM. 43(6):1002-1045, 1996.
50. M. Grotschel, J., Lova̧sz, and A. Schrijer, Geometric algorithms and combinatorial, optimization. Springer-Verlag, Berlin. 1988, ISBN 038713624x.
51. L. Gurvits. Classical deterministic complexity of Edmonds' problem and quantum entanglement. In Proceedings of the thirty-fifth ACM symposium on Theory of computing, pages 10-19, New York, 2003. ACM Press.
52. Kristopher Luttmer. The complexity of separability testing. Master's thesis, University of Calgary, 2005.
53. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W.H. Freeman and Company, New York, 1979.
54. C. H. Papadimitriou, editor. Computational complexity. Addison Wesley Longman, Reading, Massachusetts, 1994.
55. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 2000.
56. R. Ladner, N. Lynch, and A. Selman. Comparison of polynomial-time reducibilities. Theoretical Computer Science, 1:103-123, 1975.
57. Florian Hulpke and Dagmar Bruß. A two-way algorithm for the entanglement problem. J. Phys. A: Math. Gen., 38:5573, 2005,
58. Otfried Gühne and Norbert Lütkenhaus. Nonlinear entanglement witnesses. Phys. Rev. Lett, 96:170502, 2006.
59. S. Aaronson. Private communication. 2005.
60. A. Ben-Tal and A. Nemirovskii. Robust convex optimization. Mathematics of Operational Research, 23(4):769-805, 1998.
61. L. Gurvits. Private communication. 2006.
62. L. Gurvits and H. Barnum. Better bound on the exponent of the radius of the multipartite separable ball. Phys. Rev. A, 72:032322, 2005.
63. T. S. Motzkin and E. G. Straus. Maxima for graphs and a new proof of a theorem of turán. Canadian J. Math., 17:533-540, 1965.
64. David S. Atkinson and Pravin M. Vaidya. A cutting plane algorithm for convex programming that uses analytic centers. Mathematical Programming, 69:1-43, 1995.
65. A. Pavan and Alan L. Selman. Separation of NP-completeness notions. SIAM J. Comput., 31(3):906-918, 2001.
66. A. Pavan. Comparison of reductions and completeness notions. SIGACT News, 40, 2003.
67. Ingemar Bengtsson and Karol Zyczkowski. Geometry of separable states. Cambridge University Press, Cambridge, 2006.
68. L. M. Ioannou. Computing finite-dimensional bipartite quantum separability, 2005. PhD thesis, available at http://arXiv.org/abs/cs/0504110.
69. G. Pisier, editor. The volume of convex bodies and Banach space geometry. Cambridge University Press, Cambridge, 1989.
70. Robert König and Renato Renner. A de Finetti representation for finite symmetric quantum states. J. Math. Phys., 46:122102, 2005.
71. D. Pérez-Garcia and I. Cirac:. Private communication. 2006.
72. Roger A. Horn and Charles R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985.
73. Oliver Rudolph. A separability criterion for density operators. J. Phys. A, 33:3951-3955, 2000.
74. David Péren-Garcia, Deciding sepability with a fixed error. Phys. Lett. A, 330:149-154, 2004.
75. Y. Ye. Interior Point Algorithms: Theory and Analysis. John Wiley and Sons, Inc., New York, 1997.
76. Roman R. Zapatrin. An asymptotical separability criterion for bipartite density operators, 2005. quant-ph/0504169.
77. Roman R. Zapatrin. A note on continuous ensemble expansions of quantum states. 2004. quant-ph/0403105.
78. Roman R. Zapatrin. Continuous optimal ensembles i: A geometrical characterisation of robustly separable quantum states, 2005. quarit-ph/0503173.
79. Roman R. Zapatrin. Continuous optimal ensembles ii: Reducing the separability condition to numerical equations, 2005. quant-ph/0504034.
80. R. H. Hardin, N. J. A. Sloane, and W. D. Smith. Spherical Codes. In preparation, see http://www.research.att.corn/~njas/coverings/index.htnil.
81. R. Horst and P. Pardalos. editors. Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht, 1995.
82. E. Hansen. Global Optimization Using Interval Analysis. Marcel Dekker Incorporated, Boston. 1992. ISBN 0824786963.