Sciweavers

508 search results - page 56 / 102
» Quantum Computers
Sort
View
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
15 years 10 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
FCT
2001
Springer
15 years 2 months ago
Quantum Algorithms
Umesh V. Vazirani