Physics – Quantum Physics
Scientific paper
2005-09-26
Physics
Quantum Physics
8 pages, v3, updated reference. to appear in Information Processing Letters, 2006
Scientific paper
10.1016/j.ipl.2006.01.014
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 \Omega(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, improving previous protocols of O(d^2) bits (A. C.-C. Yao, Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 77-81, 2003), and O(d\log n) bits (D. Gavinsky, J. Kempe, and R. de Wolf, quant-ph/0411051, 2004).
Huang Wei
Shi Yaoyun
Zhang Shengyu
Zhu Yufan
No associations
LandOfFree
The Communication Complexity of the Hamming Distance Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Communication Complexity of the Hamming Distance Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Communication Complexity of the Hamming Distance Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-504074