TOC
2008
13 years 11 months ago
2008
Abstract: Consider the following version of the Hamming distance problem for
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...