Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Entanglement and Communication Complexity
SIAM Journal on Computing
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Quantum Search of Spatial Regions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Minimum entangled state dimension required for pseudo-telepathy
Quantum Information & Computation
On the power of non-local boxes
Theoretical Computer Science
Exponential quantum enhancement for distributed addition with local nonlinearity
Quantum Information Processing
Minimum entangled state dimension required for pseudo-telepathy
Quantum Information & Computation
Noise and the magic square game
Quantum Information Processing
Pseudo-telepathy games and genuine ns k-way nonlocality using graph states
Quantum Information & Computation
| Hi-index | 0.00 |
Entanglement is perhaps the most non-classical manifestation of quantum mechanics. Among its many interesting applications to information processing, it can be harnessed to reduce the amount of communication required to process a variety of distributed computational tasks. Can it be used to eliminate communication altogether? Even though it cannot serve to signal information between remote parties, there are distributed tasks that can be performed without any need for communication, provided the parties share prior entanglement: this is the realm of pseudo-telepathy. One of the earliest uses of multi-party entanglement was presented by Mermin in 1990. Here we recast his idea in terms of pseudo-telepathy: we provide a new computer-scientist-friendly analysis of this game. We prove an upper bound on the best possible classical strategy for attempting to play this game, as well as a novel, matching lower bound. This leads us to considerations on how well imperfect quantum-mechanical apparatus must perform in order to exhibit a behaviour that would be classically impossible to explain. Our results include improved bounds that could help vanquish the infamous detection loophole.