A lower bound on the value of entangled binary games

zbMATH Open1237.81031arXiv0909.5518MaRDI QIDQ3172454FDOQ3172454

Authors: Salman Beigi 

Publication date: 5 October 2011

Full work available at URL: https://arxiv.org/abs/0909.5518

Recommendations

• Unique games with entangled provers are easy
• Quantum XOR games
• Entangled games are hard to approximate
• Explicit lower and upper bounds on the entangled value of multiplayer XOR games
• Rank-one quantum games

zbMATH Keywords

nonlocal correlationsSDP relaxationnonlocal games

Mathematics Subject Classification ID

2-person games (91A05) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cited In (9)

• Quantum homomorphisms
• Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
• Entangled games are hard to approximate
• Graph-theoretical bounds on the entangled value of non-local games
• Hardness amplification for entangled games via anchoring
• Characterization of binary constraint system games
• Nonlocal Games with Noisy Maximally Entangled States are Decidable
• Linear conic formulations for two-party correlations and values of nonlocal games
• Information causality, Szemerédi-Trotter and algebraic variants of \textsf{CHSH} (extended abtract)

This page was built for publication: A lower bound on the value of entangled binary games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172454)