Sciweavers

7486 search results - page 70 / 1498
» The Limits of Quantum Computers
Sort
View
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
16 years 6 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
114
Voted
SPAA
2005
ACM
15 years 11 months ago
Is partial quantum search of a database any easier?
Lov K. Grover, Jaikumar Radhakrishnan