Classical, quantum and nonsignalling resources in bipartite games
From MaRDI portal
Publication:387029
DOI10.1016/j.tcs.2012.12.017zbMath1343.05100OpenAlexW2138079171MaRDI QIDQ387029
Anne Broadbent, Stefan Wolf, André Allan Méthot, Gilles Brassard, Esther Hänggi
Publication date: 11 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.017
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Quantum measurement theory, state operations, state preparations (81P15) Graph algorithms (graph-theoretic aspects) (05C85) Information theory (general) (94A15) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the quantum chromatic number of a graph
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Orthogonal representations and connectivity of graphs
- A local hidden variable model of quantum correlation exploiting the detection loophole
- Impossible colorings and Bell's theorem.
- On the power of non-local boxes
- Quantum pseudo-telepathy
- Quantum Entanglement and Communication Complexity
- Entangled Games Are Hard to Approximate
- Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
- PSEUDO-TELEPATHY: INPUT CARDINALITY AND BELL-TYPE INEQUALITIES
- Monogamy of non-local quantum correlations
- Simulating Quantum Correlations with Finite Communication
- Coloring an Orthogonality Graph
- On the Shannon capacity of a graph
- The knowledge complexity of interactive proof-systems
- A Parallel Repetition Theorem
- Quantum mechanics, local realistic theories, and Lorentz-invariant realistic theories
- Bell’s theorem without inequalities
- Proposed Experiment to Test Local Hidden-Variable Theories
- On the Problem of Hidden Variables in Quantum Mechanics
- Quantum theory: concepts and methods
