Phys. Rev. A 65, 012318 (2001) [4 pages]

Feasible quantum communication complexity protocol

Download: PDF (53 kB) or Buy this Article (Use Article Pack) Export: BibTeX or EndNote (RIS)

Ernesto F. Galvão
Centre for Quantum Computation, Clarendon Laboratory, University of Oxford, Oxford OX1 3PU, United Kingdom

Received 6 September 2001; published 13 December 2001

I show that a simple multiparty communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency η. The task is a communication complexity problem in which distant parties need to compute a function of the distributed inputs, while minimizing the amount of communication between them. A realistic quantum optical setup is suggested that can demonstrate a five-party quantum protocol with higher-than-classical performance, provided η>0.33.


©2001 The American Physical Society

URL: http://link.aps.org/doi/10.1103/PhysRevA.65.012318
DOI: 10.1103/PhysRevA.65.012318
PACS: 03.67.Hk, 03.67.Lx

[ Abstract  |  Previous article  |  Next article  |  Issue 1 ]