APS » PROLA » Phys. Rev. A » Volume 64 » Issue 3
< Previous article | Next article >

Phys. Rev. A 64, 032304 (2001) [4 pages]

Reducing the communication complexity with quantum entanglement

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

Peng Xue, Yun-Feng Huang, Yong-Sheng Zhang, Chuan-Feng Li *, and Guang-Can Guo †
Laboratory of Quantum Communication and Quantum Computation and Department of Physics, University of Science and Technology of China, Hefei 230026, People’s Republic of China

Received 14 February 2001; published 13 August 2001

We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than is required with only classical random correlations. A simple all-optical implementation of this protocol is presented and demonstrates our conclusion.


©2001 The American Physical Society

URL: http://link.aps.org/doi/10.1103/PhysRevA.64.032304
DOI: 10.1103/PhysRevA.64.032304
PACS: 03.67.Hk, 03.65.Ud, 42.50.Dv

* Email address: cfli@ustc.edu.cn
† Email address: gcguo@ustc.edu.cn

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