Sciweavers

3328 search results - page 61 / 666
» Topological Quantum Computation
Sort
View
115
Voted
TAMC
2007
Springer
15 years 9 months ago
Quantum Multiparty Communication Complexity and Circuit Lower Bounds
Iordanis Kerenidis
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
16 years 3 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
91
Voted
SPAA
2005
ACM
15 years 9 months ago
Is partial quantum search of a database any easier?
Lov K. Grover, Jaikumar Radhakrishnan