Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance

Andris Ambainis, William Gasarch, Aravind Srinavasan +1

Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on \textit{at most} a bits? Let 0\leq a\leq n-1. We show that any deterministic prot…