Improved algorithm for quantum separability and entanglement detection

Journal article

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. 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 new 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-by-3-dimensional systems. Our algorithm also provides a novel tool in the experimental detection of entanglement.

Authors: Ioannou, L; Travaglione, B; Cheung, D; Ekert, A

• Publication status: Published
• Journal: Phys. Rev. A
• Volume: 70
• Issue: 6
• Pages: 060303
• Publication date: 2004-03-04
• DOI: 10.1103/PhysRevA.70.060303
• EISSN: 1094-1622
• ISSN: 1050-2947
• Keywords: quant-ph