2014/06/17 by Ravishankar Ramanathan, Alastair Kay, Gláucia Murta +1
Computer Science · Mathematics · Physics and Astronomy · #Artificial intelligence #Class (philosophy) #Computer science #Discrete mathematics #Graph #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Set (abstract data type) #Theoretical computer science #cs.IT #math.CO #math.IT #quant-ph
paper · pdf · doi:10.1103/physrevlett.113.240401
published as Phys. Rev. Lett. 113, 240401 (2014) · 5 pages. Clarified proof of theorem 1, typos corrected
arxiv created 2014/06/17 · openalex publication_date 2014/12/08 · arxiv updated 2014/12/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party XOR game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrization of new families of games that have no quantum advantage for arbitrary input probability distributions, up to certain symmetries. In the future, these might be used in information-theoretic studies on reproducing the set of quantum nonlocal correlations.