Sciweavers

121 search results - page 13 / 25
» The complexity of the Quantum Adiabatic Algorithm
Sort
View
85
Voted
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
15 years 10 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
15 years 3 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
65
Voted
ISAAC
2007
Springer
105views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Unbounded-Error Classical and Quantum Communication Complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
81
Voted
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
15 years 3 months ago
The Phase Matrix
Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are q...
Peter Høyer
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
15 years 10 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek