The communication complexity of the Hamming distance problem

We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no less than a threshold d. We prove a quantum lower bound of Ω(d) qubits in the general interactive model with shared prior entanglement. We also construct a classical protocol of O(d log d) bits in the restricted Simultaneous Message Passing model with public random coins, improving previous protocols of O(d2) bits [A.C.-C. Yao, On the power of quantum fingerprinting, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 77-81], and O(d log n) bits [D. Gavinsky, J. Kempe, R. de Wolf, Quantum communication cannot simulate a public coin, quant-ph/0411051, 2004].

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

[2]  Ronald de Wolf,et al.  Quantum Communication Cannot Simulate a Public Coin , 2004, ArXiv.

[3]  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.

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

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

[6]  Alexander A. Razborov,et al.  Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..

[7]  A. Razborov.  Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.

[8]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.

[9]  Joan Feigenbaum,et al.  Secure Multiparty Computation of Approximations , 2001, ICALP.

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

[11]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

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

[13]  Andrew Chi-Chih Yao,et al.  On the power of quantum fingerprinting , 2003, STOC '03.

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

[15]  Andris Ambainis,et al.  Quantum search of spatial regions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[16]  Andris Ambainis,et al.  Communication complexity in a 3-computer model , 1996, Algorithmica.

[17]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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