11547 search results - page 43 / 2310 » Quantum computing and communication |
123
Voted
CORR
2010
Springer
15 years 3 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...
121
click to vote
CORR
2006
Springer
15 years 3 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...
135
Voted
STOC
2007
ACM
16 years 4 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...
COCO
2009
Springer
15 years 10 months ago
2009
Springer
