Quantum communication complexity of symmetric predicates

We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of every predicate ) depending only on . More precisely, given a predicate on , we put Then the bounded-error quantum communication complexity of is equal to (up to a logarithmic factor). In particular, the complexity of the set disjointness predicate is equal to . This result holds both in the model with prior entanglement and in the model without it.

[1]  P. Delsarte.  Hahn Polynomials, Discrete Harmonics, and t-Designs , 1978 .

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

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

[4]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

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

[6]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[7]  Umesh V. Vazirani,et al.  Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources , 1987, Comb..

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

[9]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

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

[11]  Ramamohan Paturi,et al.  On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) , 1992, STOC '92.

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

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

[14]  R. Cleve,et al.  SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.

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

[16]  Andris Ambainis,et al.  The quantum communication complexity of sampling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[17]  Alain Tapp,et al.  Quantum Entanglement and the Communication Complexity of the Inner Product Function , 1998, QCQC.

[18]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[19]  Hartmut Klauck,et al.  Interaction in quantum communication and the complexity of set disjointness , 2001, STOC '01.

[20]  Ronald de Wolf,et al.  Communication complexity lower bounds by polynomials , 1999, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[21]  Ashwin Nayak,et al.  On communication over an entanglement-assisted quantum channel , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[22]  Ronald de Wolf,et al.  Improved Quantum Communication Complexity Bounds for Disjointness and Equality , 2001, STACS.

[23]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..