Quantum pseudo-telepathy
From MaRDI portal
Publication:2505724
DOI10.1007/s10701-005-7353-4zbMath1102.81302arXivquant-ph/0407221OpenAlexW3101691044MaRDI QIDQ2505724
Gilles Brassard, Alain Tapp, Anne Broadbent
Publication date: 28 September 2006
Published in: Foundations of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0407221
Bell's theoremnonlocalityentanglementquantum information processingpseudo-telepathyquantum communication complexity
Related Items
Quantum games on evolving random networks ⋮ Clauser-Horne-Shimony-Holt versus three-party pseudo-telepathy: on the optimal number of samples in device-independent quantum private query ⋮ Device independent quantum key distribution using three-party pseudo-telepathy ⋮ Unbounded violations of bipartite Bell inequalities via operator space theory ⋮ Strict hierarchy among Bell theorems ⋮ Towards characterizing the non-locality of entangled quantum states ⋮ Classical, quantum and nonsignalling resources in bipartite games ⋮ Maximally Entangled State in Pseudo-Telepathy Games ⋮ Nonlocal games and quantum permutation groups ⋮ A compositional approach to quantum functions ⋮ 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Advantage of Quantum Theory over Nonclassical Models of Communication ⋮ Entanglement swapping, light cones and elements of reality ⋮ Analysis of Boolean functions related to binary input binary output two-party nonlocal games ⋮ PSEUDO-TELEPATHY: INPUT CARDINALITY AND BELL-TYPE INEQUALITIES ⋮ A competitive game whose maximal Nash-equilibrium payoff requires quantum resources for its achievement ⋮ Noise and the magic square game ⋮ Quantum speed-up for unsupervised learning ⋮ Distinguishing quantum channels via magic squares game ⋮ Communication complexity as a principle of quantum mechanics ⋮ NOISE EFFECTS IN QUANTUM MAGIC SQUARES GAME ⋮ The Morita theory of quantum graph isomorphisms ⋮ Quantum sets ⋮ On coordination games with quantum correlations ⋮ Random constructions in Bell inequalities: a survey ⋮ Multiplayer quantum games and its application as access controller in architecture of quantum computers ⋮ Models of quantum computation and quantum programming languages ⋮ Noise and the Mermin-GHZ Game ⋮ Exponential quantum enhancement for distributed addition with local nonlinearity ⋮ Large violation of Bell inequalities with low entanglement ⋮ Unnamed Item ⋮ On the power of non-local boxes ⋮ SEPARATION BETWEEN CLASSICAL AND QUANTUM WINNING STRATEGIES FOR THE MATCHING GAME ⋮ Unnamed Item ⋮ Quantum broadcast channels with cooperating decoders: An information-theoretic perspective on quantum repeaters ⋮ Quantum advantage through the magic pentagram problem ⋮ Classical vs quantum satisfiability in linear constraint systems modulo an integer
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum communication complexity
- Bell inequality and the locality loophole: Active versus passive switches
- Impossible colorings and Bell's theorem.
- Quantum mysteries revisited again
- Exponential separation of quantum and classical one-way communication complexity
- Rapid solution of problems by quantum computation
- Simple unified form for the major no-hidden-variables theorems
- Extreme quantum entanglement in a superposition of macroscopically distinct states
- Quantum mechanics, local realistic theories, and Lorentz-invariant realistic theories
- Bell’s theorem without inequalities
- On bell non-locality without probabilities: More curious geometry
- On the Problem of Hidden Variables in Quantum Mechanics
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Algorithms and Data Structures
