Sciweavers

Share
IPL
2006

The communication complexity of the Hamming distance problem

8 years 12 months ago
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 logd) 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
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IPL
Authors Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
Comments (0)
books