Elsevier

Theoretical Computer Science

Volume 287, Issue 1, 25 September 2002, Pages 337-353
Theoretical Computer Science

Quantum communication and complexity

https://doi.org/10.1016/S0304-3975(02)00377-8Get rights and content
Under an Elsevier user license
open archive

Abstract

In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as possible. The required communication can sometimes be significantly lowered if we allow the parties the use of quantum communication. We survey the main results of the young area of quantum communication complexity: its relation to teleportation and dense coding, the main examples of fast quantum communication protocols, lower bounds, and some applications.

Keywords

Quantum computing
Communication complexity

Cited by (0)

1

Supported by Talent grant S 62-565 from the Netherlands Organization for Scientific Research (NWO). Most of this paper was written when the author was a Ph.D. student at CWI and the University of Amsterdam, partially supported by the EU Fifth Framework project QAIP, IST-1999-11234.