In the {\em distributed Deutsch-Jozsa promise problem}, two parties are to
determine whether their respective strings x,y∈{0,1}n are at the {\em
Hamming distance} H(x,y)=0 or H(x,y)=2n. Buhrman et al. (STOC' 98)
proved that the exact {\em quantum communication complexity} of this problem is
O(logn) while the {\em deterministic communication complexity} is
Ω(n). This was the first impressive (exponential) gap between
quantum and classical communication complexity.
In this paper, we generalize the above distributed Deutsch-Jozsa promise
problem to determine, for any fixed 2n≤k≤n, whether
H(x,y)=0 or H(x,y)=k, and show that an exponential gap between exact
quantum and deterministic communication complexity still holds if k is an
even such that 21n≤k<(1−λ)n, where 0<λ<21 is given. We also deal with a promise version of the
well-known {\em disjointness} problem and show also that for this promise
problem there exists an exponential gap between quantum (and also
probabilistic) communication complexity and deterministic communication
complexity of the promise version of such a disjointness problem. Finally, some
applications to quantum, probabilistic and deterministic finite automata of the
results obtained are demonstrated.Comment: we correct some errors of and improve the presentation the previous
version. arXiv admin note: substantial text overlap with arXiv:1309.773