388 search results - page 5 / 78 » Quantum Lower Bounds by Polynomials |
108
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the sta...
73
Voted
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
104
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...