Deciding the existence of perfect entangled strategies for nonlocal games

DOI10.4086/cjtcs.2016.005zbMath1341.91021arXiv1506.07429OpenAlexW4237461333MaRDI QIDQ2808532

Laura Mančinska, David E. Roberson, Antonios Varvisotis

Publication date: 24 May 2016

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

nonlocal gameentangled valueperfect entangled strategiesquantum independence number

Mathematics Subject Classification ID

Noncooperative games (91A10) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Decision theory for games (91A35) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (6)

Quantum and non-signalling graph isomorphisms ⋮ Discrete quantum structures. I: Quantum predicate logic ⋮ Linear conic formulations for two-party correlations and values of nonlocal games ⋮ Spectral upper bound on the quantum k-independence number of a graph ⋮ A category of quantum posets ⋮ Unnamed Item

Cites Work

• Interactive proofs and the hardness of approximating cliques
• Quantum cryptography based on Bell’s theorem
• Characterization of Binary Constraint System Games
• Infinite randomness expansion with a constant number of devices
• Unnamed Item

This page was built for publication: Deciding the existence of perfect entangled strategies for nonlocal games