0306042v1

related topics
{algorithm, log, probability}
{error, code, errors}
{key, protocol, security}
{alice, bob, state}
{particle, mechanics, theory}
{bell, inequality, local}
{let, theorem, proof}
{entanglement, phys, rev}
{state, phys, rev}
{observables, space, algebra}

Multi-Party Pseudo-Telepathy

Gilles Brassard, Anne Broadbent, Alain Tapp

abstract: Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a variety of distributed computational tasks. We speak of pseudo-telepathy when quantum entanglement serves to eliminate the classical need to communicate. In earlier examples of pseudo-telepathy, classical protocols could succeed with high probability unless the inputs were very large. Here we present a simple multi-party distributed problem for which the inputs and outputs consist of a single bit per player, and we present a perfect quantum protocol for it. We prove that no classical protocol can succeed with a probability that differs from 1/2 by more than a fraction that is exponentially small in the number of players. This could be used to circumvent the detection loophole in experimental tests of nonlocality.

oai_identifier:
oai:arXiv.org:quant-ph/0306042
categories:
quant-ph
comments:
11 pages. To be appear in WADS 2003 proceedings
arxiv_id:
quant-ph/0306042
journal_ref:
Proceedings of the 8th International Workshop on Algorithms and Data Structures, Volume 2748 of Lecture Notes in Computer Science, pages 1-11, 2003.
created:
2003-06-05

Full article ▸

related documents
0008095v3
0010057v1
9901068v1
0609220v1
0210141v2
0011052v2
0609166v1
0609160v1
0508156v3
0403071v1
0109038v1
0308016v1
0612052v2
9706003v4
0608156v1
0606077v1
0406104v1
0401067v2
0311184v1
0308034v1
0312008v1
0311133v2
0503094v2
0405063v2
0402099v1