Quantum pseudo-telepathy
From MaRDI portal
Abstract: Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with that we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required. Pseudo-telepathy is a surprising application of quantum information processing to communication complexity. Thanks to entanglement, perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and no-so-recent work on the subject. In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors.
Recommendations
Cites work
- Algorithms and Data Structures
- Bayesian analysis of Bell inequalities.
- Bell inequality and the locality loophole: Active versus passive switches
- Bell’s theorem without inequalities
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Exponential separation of quantum and classical one-way communication complexity
- Extreme quantum entanglement in a superposition of macroscopically distinct states
- scientific article; zbMATH DE number 5320338 (Why is no real title available?)
- scientific article; zbMATH DE number 1775389 (Why is no real title available?)
- Impossible colorings and Bell's theorem.
- On bell non-locality without probabilities: More curious geometry
- On the Problem of Hidden Variables in Quantum Mechanics
- Quantum communication complexity
- Quantum mechanics, local realistic theories, and Lorentz-invariant realistic theories
- Quantum mysteries revisited again
- Rapid solution of problems by quantum computation
- Simple unified form for the major no-hidden-variables theorems
Cited in
(49)- 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
- The Morita theory of quantum graph isomorphisms
- Random constructions in Bell inequalities: a survey
- Quantum speed-up for unsupervised learning
- Quantum advantage through the magic pentagram problem
- Device independent quantum key distribution using three-party pseudo-telepathy
- Nonlocal games and quantum permutation groups
- Models of quantum computation and quantum programming languages
- Communication complexity as a principle of quantum mechanics
- On the power of non-local boxes
- Maximally Entangled State in Pseudo-Telepathy Games
- PSEUDO-TELEPATHY: INPUT CARDINALITY AND BELL-TYPE INEQUALITIES
- Minimum entangled state dimension required for pseudo-telepathy
- NOISE EFFECTS IN QUANTUM MAGIC SQUARES GAME
- SEPARATION BETWEEN CLASSICAL AND QUANTUM WINNING STRATEGIES FOR THE MATCHING GAME
- Strict hierarchy among Bell theorems
- Deterministic quantum non-locality and graph colorings
- Towards characterizing the non-locality of entangled quantum states
- Classical, quantum and nonsignalling resources in bipartite games
- A competitive game whose maximal Nash-equilibrium payoff requires quantum resources for its achievement
- Noise and the magic square game
- Extended nonlocal games from quantum-classical games
- A compositional approach to quantum functions
- Quantum broadcast channels with cooperating decoders: an information-theoretic perspective on quantum repeaters
- Algorithms, bounds, and strategies for entangled XOR games
- Quantum sets
- Unitary noise and the Mermin-GHZ game
- Noise and the Mermin-GHZ game
- Classical vs quantum satisfiability in linear constraint systems modulo an integer
- Brief announcement: What can be computed without communication?
- Algorithms and Data Structures
- 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
- Analysis of Boolean functions related to binary input binary output two-party nonlocal games
- Unbounded violations of bipartite Bell inequalities via operator space theory
- Entanglement swapping, light cones and elements of reality
- Distinguishing quantum channels via magic squares game
- Quantum horse racing game
- Quantum no-signalling correlations and non-local games
- Exploiting finite geometries for better quantum advantages in mermin-like games
- ``The six blind men and the elephant: an interdisciplinary selection of measurement features
- Quantum advantage and CSP complexity
- Four-qubit CHSH game
- Large violation of Bell inequalities with low entanglement
- On coordination games with quantum correlations
- Multiplayer quantum games and its application as access controller in architecture of quantum computers
- Exponential quantum enhancement for distributed addition with local nonlinearity
This page was built for publication: Quantum pseudo-telepathy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2505724)
