Contextuality in multipartite pseudo-telepathy graph games

DOI10.1007/978-3-662-55751-8_5zbMath1442.81006arXiv1609.09689OpenAlexW2528118313WikidataQ62039230 ScholiaQ62039230MaRDI QIDQ5915755

Peter Høyer, Anurag Anshu, Simon Perdrix, Mehdi Mhalla

Publication date: 22 November 2017

Published in: Journal of Computer and System Sciences, Fundamentals of Computation Theory (Search for Journal in Brave)

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

zbMATH Keywords

quantum informationgraph statescontextualitymultipartite entanglementmultipartiteness width

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Contextuality in quantum theory (81P13) Algorithmic game theory and complexity (91A68)

Related Items (1)

Noisy three-player dilemma game: robustness of the quantum advantage

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determinism and computational power of real measurement-based quantum computation
• A combinatorial approach to nonlocality and contextuality
• On the power of non-local boxes
• Contextuality and the Weak Axiom in the Theory of Choice
• Contextuality from Quantum Physics to Psychology
• Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
• Extreme quantum entanglement in a superposition of macroscopically distinct states
• Nonlocality for two particles without inequalities for almost all entangled states
• Bell’s theorem without inequalities
• A complete characterization of all-versus-nothing arguments for stabilizer states
• Graph states for quantum secret sharing
• The Cohomology of Non-Locality and Contextuality
• The sheaf-theoretic structure of non-locality and contextuality
• Universal Blind Quantum Computation
• On the Minimum Degree Up to Local Complementation: Bounds and Complexity
• Resources Required for Preparing Graph States
• Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
• Algorithms and Data Structures

This page was built for publication: Contextuality in multipartite pseudo-telepathy graph games