Exponential separation of quantum and classical one-way communication complexity

We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Problem HMn: Alice gets as input a string x ∈ (0, 1)n and Bob gets a perfect matching M on the n coordinates. Bob's goal is to output a tuple [i,j,b] such that the edge (i,j) belongs to the matching M and b = xi ⊕ xj. We prove that the quantum one-way communication complexity of HMn is O(log n), yet any randomized one-way protocol with bounded error must use Ω(√n) bits of communication. No asymptotic gap for one-way communication was previously known. Our bounds also hold in the model of Simultaneous Messages (SM) and hence we provide the first exponential separation between quantum SM and randomized SM with public coins.For a Boolean decision version of HMn, we show that the quantum one-way communication complexity remains O(log n) and that the 0-error randomized one-way communication complexity is Ω(n). We prove that any randomized linear one-way protocol with bounded error for this problem requires Ω(√[3] n log n) bits of communication.

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

[2]  Peter Frankl,et al.  Intersection theorems with geometric consequences , 1981, Comb..

[3]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

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

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

[8]  Ilan Newman,et al.  Public vs. private coin flips in one round communication games (extended abstract) , 1996, STOC '96.

[9]  Farid M. Ablayev,et al.  Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity , 1996, Theor. Comput. Sci..

[10]  László Babai,et al.  Randomized simultaneous messages: solution of a problem of Yao in communication complexity , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

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

[12]  Noam Nisan,et al.  On Randomized One-round Communication Complexity , 1995, STOC '95.

[13]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

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

[15]  Hartmut Klauck,et al.  On quantum and probabilistic communication: Las Vegas and one-way protocols , 2000, STOC '00.

[16]  Srinivasan Venkatesh,et al.  Lower Bounds in the Quantum Cell Probe Model , 2001, ICALP.

[17]  R. Cleve,et al.  Quantum fingerprinting. , 2001, Physical review letters.

[18]  Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, J. Comput. Syst. Sci..

[19]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[20]  Andris Ambainis,et al.  The Quantum Communication Complexity of Sampling , 2003, SIAM J. Comput..

[21]  Ronald de Wolf,et al.  Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, STOC '03.

[22]  Scott Aaronson,et al.  Limitations of quantum advice and one-way communication , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[23]  Ronald de Wolf,et al.  Bounded-error quantum state identification and exponential separations in communication complexity , 2005, STOC '06.