Classical versus quantum communication complexity

Classical communication complexity has been intensively studied since its conception two decades ago. Recently, its quantum analogue, the quantum communication complexity model, was defined and studied. In this paper we present some of the main results in the area.

[1]  Eyal Kushilevitz,et al.  Communication Complexity: Index of Notation , 1996 .

[2]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[3]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[4]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[5]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[6]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[8]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 2001, JACM.

[9]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[10]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[11]  Umesh V. Vazirani.  Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources , 1985, STOC '85.

[12]  Andrew Chi-Chih Yao,et al.  Lower Bounds by Probabilistic Arguments (Extended Abstract) , 1983, FOCS 1983.

[13]  Ran Raz,et al.  Exponential separation of quantum and classical communication complexity , 1999, STOC '99.

[14]  Ran Raz,et al.  On the "log rank"-conjecture in communication complexity , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[15]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[16]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

[17]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[18]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[19]  A. Holevo.  Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .