The Communication Complexity of the Hamming Distance Problem
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
Abstract
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 d) bits in the restricted Simultaneous Message Passing model, improving previous protocols of O(d2) bits (A. C.-C. Yao, Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 77-81, 2003), and O(d n) bits (D. Gavinsky, J. Kempe, and R. de Wolf, quant-ph/0411051, 2004).
Create a lesson
Related papers
Gaussian entanglement and quantum communication: geodesic optimization and multimode bounds
Hemant K. Mishra, Mark M. Wilde
On the coincidence of discrete and continuous definitions of Entanglement of Formation
Haobo Ma, Maksim E. Shirokov, Wenlin Zhang
EFI1PRS
Rishabh Batra
Relative-Entropy Geometry and Convergence in Nonconvex Wiretap Optimization
Farzin Salek, Masahito Hayashi
Deterministic and programmable generation of mechanical multipartite entangled states
Isabelle Franzen, Max-Emanuel Kern, Q. Rumman Rahman et al.
Quantum-enhanced mechanical sensing with machine-learning estimation
Finn Müßigbrodt, Andraž Omahen, Q. Rumman Rahman et al.