2002/10/15 by Barbara M. Terhal, Andrew C. Doherty, David Schwab · 2 citations
Computer Science · Physics and Astronomy · #Bell state #Bell's theorem #Bipartite graph #CHSH inequality #Computer science #Hidden variable theory #Local hidden variable theory #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum discord #Quantum entanglement #Quantum mechanics #Quantum network #Quantum nonlocality #Quantum state #Quantum teleportation #Simple (philosophy) #Theoretical computer science #Theoretical physics #quant-ph
paper · pdf · doi:10.1103/physrevlett.90.157903
published as Phys. Rev. Lett {\bf 90}, 157903 (2003) · 8 pages Revtex; v2 contains substantial changes, a strengthened main theorem and more references
arxiv created 2002/10/15 · openalex publication_date 2003/04/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
While all bipartite pure entangled states violate some Bell inequality, the relationship between entanglement and nonlocality for mixed quantum states is not well understood. We introduce a simple and efficient algorithmic approach for the problem of constructing local hidden variable theories for quantum states. The method is based on constructing a so-called symmetric quasiextension of the quantum state that gives rise to a local hidden variable model with a certain number of settings for the observers Alice and Bob.