Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
From MaRDI portal
Publication:5855038
DOI10.1088/1367-2630/18/4/045020zbMath1456.81019arXiv1511.05415OpenAlexW2274023572WikidataQ62561083 ScholiaQ62561083MaRDI QIDQ5855038
Karol Horodecki, Monika Rosicka, Piotr Gnaciński, Simone Severini, Ravishankar Ramanathan, Michał Horodecki, Paweł Horodecki
Publication date: 12 March 2021
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05415
2-person games (91A05) Quantum measurement theory, state operations, state preparations (81P15) Contextuality in quantum theory (81P13)
Related Items
Generalized XOR non-locality games with graph description on a square lattice ⋮ Contextuality in multipartite pseudo-telepathy graph games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization, approximation, and complexity classes
- Quantum analogues of the Bell inequalities. The case of two spatially separated domains
- A combinatorial approach to nonlocality and contextuality
- On the notion of balance of a signed graph
- Bell Inequalities for Arbitrarily High-Dimensional Systems
- Detecting nonlocality in many-body quantum states
- Simple Test for Hidden Variables in Spin-1 Systems
- Proof verification and the hardness of approximation problems
- Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices
- Probabilistic checking of proofs
- On the Shannon capacity of a graph
- A Parallel Repetition Theorem
- Extreme quantum entanglement in a superposition of macroscopically distinct states
- Quantum cryptography based on Bell’s theorem
- Proposed Experiment to Test Local Hidden-Variable Theories
- Unique Games with Entangled Provers Are Easy
- Some optimal inapproximability results
- An explicit classical strategy for winning a ${\mathrm{CHSH}}_{q}$ game
