130 search results - page 6 / 26 » The Quantum Communication Complexity of Sampling |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
CORR
2006
Springer
14 years 9 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...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
TAMC
2007
Springer
15 years 3 months ago
2007
Springer