Improved algorithm for quantum separability and entanglement detection

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard, suggesting that an efficient, general solution does not exist. There is a highly inefficient ``basic algorithm'' for solving the quantum separability problem which follows from the definition of a separable state. By exploiting specific properties of the set of separable states, we introduce a classical algorithm that solves the problem significantly faster than the ``basic algorithm,'' allowing a feasible separability test where none previously existed, e.g., in $3\ifmmode\times\else\texttimes\fi{}3$-dimensional systems. Our algorithm also provides a unique tool in the experimental detection of entanglement.

[1]  M. Lewenstein,et al.  Detection of entanglement with few local measurements , 2002, quant-ph/0205089.

[2]  B. Terhal.  Bell inequalities and the separability criterion , 1999, quant-ph/9911057.

[3]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[4]  Pablo A. Parrilo,et al.  Complete family of separability criteria (20 pages) , 2004 .

[5]  Norbert Lütkenhaus,et al.  Entanglement as a precondition for secure quantum key distribution. , 2004, Physical review letters.

[6]  J. Bell.  On the Einstein-Podolsky-Rosen paradox , 1964 .

[7]  M. Lewenstein,et al.  Volume of the set of separable states , 1998, quant-ph/9804024.

[8]  M. Nielsen,et al.  Separable states are more disordered globally than locally. , 2000, Physical review letters.

[9]  R. Jozsa,et al.  SEPARABILITY OF VERY NOISY MIXED STATES AND IMPLICATIONS FOR NMR QUANTUM COMPUTING , 1998, quant-ph/9811018.

[10]  A. Shimony,et al.  Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .

[11]  Eldon Hansen.  AN OVERVIEW OF GLOBAL OPTIMIZATION USING INTERVAL ANALYSIS , 1988 .

[12]  R. Freund.  Review of A mathematical view of interior-point methods in convex optimization, by James Renegar, SIAM, Philadelphia, PA , 2004 .

[13]  L. Gurvits,et al.  Largest separable balls around the maximally mixed bipartite quantum state , 2002, quant-ph/0204159.

[14]  M. Nielsen,et al.  Interdisciplinary Physics: Biological Physics, Quantum Information, etc. , 2001 .

[15]  P. Parrilo,et al.  Complete family of separability criteria , 2003, quant-ph/0308032.

[16]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[17]  James Renegar,et al.  A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.

[18]  Pravin M. Vaidya,et al.  A cutting plane algorithm for convex programming that uses analytic centers , 1995, Math. Program..

[19]  P. Horodecki,et al.  Method for direct detection of quantum entanglement. , 2001, Physical review letters.

[20]  M. Barbieri,et al.  Detection of entanglement with polarized photons: experimental realization of an entanglement witness. , 2003, Physical review letters.

[21]  M. Horodecki,et al.  Reduction criterion of separability and limits for a class of distillation protocols , 1999 .

[22]  Pérès.  Separability Criterion for Density Matrices. , 1996, Physical review letters.

[23]  P. Parrilo,et al.  Distinguishing separable and entangled states. , 2001, Physical review letters.