2008/07/31 by Soojoon Lee, Jinhyoung Lee, Jaewan Kim
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physreva.79.032309
published as Phys. Rev. A 79, 032309 (2009). · 4 pages, 2 figures
arxiv created 2009/02/07 · openalex publication_date 2009/03/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the explicit relation between violation of Bell inequalities and bipartite distillability of multiqubit states. It has been shown that even though for N\ensuremath≥8 there exist N-qubit bound entangled states which violates a Bell inequality [W. D"ur, Rev. Lett. 87, 230402 (2001)], for all the states violating the inequality there exists at least one splitting of the parties into two groups such that pure-state entanglement can be distilled [A. Ac'\in, Rev. Lett. 88, 027901 (2002)]. We here prove that for all N-qubit states violating the inequality the number of distillable bipartite splits increases exponentially with N, and hence the probability that a randomly chosen bipartite split is distillable approaches 1 exponentially with N, as N tends to infinity. We also show that there exists at least one N-qubit bound entangled state violating the inequality if and only if N\ensuremath≥6.