2009/01/31 by Nicolas Brunner, Paul Skrzypczyk · 6 citations
Computer Science · Mathematics · Physics and Astronomy · #Class (philosophy) #Computer science #Distillation #Limit (mathematics) #Mathematical analysis #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Quantum nonlocality #Set (abstract data type) #Statistical physics #Theoretical physics #quant-ph
paper · pdf · doi:10.1103/physrevlett.102.160403
published as Phys. Rev. Lett. 102, 160403 (2009) · 4 pages, 4 figures. To Appear in PRL
arxiv created 2009/03/31 · openalex publication_date 2009/04/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We first present a protocol for deterministically distilling nonlocality, building upon a recent result of Forster et al. [Phys. Rev. Lett. 102, 120401 (2009)10.1103/PhysRevLett.102.120401]. Our protocol, which is optimal for two-copy distillation, works efficiently for a specific class of postquantum nonlocal boxes, which we term correlated nonlocal boxes. In the asymptotic limit, all correlated nonlocal boxes are distilled to the maximally nonlocal box of Popescu and Rohrlich. Then, taking advantage of a result of Brassard et al. [Phys. Rev. Lett. 96, 250401 (2006)10.1103/PhysRevLett.96.250401] we show that all correlated nonlocal boxes make communication complexity trivial, and therefore appear very unlikely to exist in nature. Astonishingly, some of these nonlocal boxes are arbitrarily close to the set of classical correlations. This result therefore gives new insight to the problem of why quantum nonlocality is limited.