7 search results - page 2 / 2 » The Quantum Adversary Method and Classical Formula Size Lowe... |
STOC
2004
ACM
14 years 4 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
COCO
2004
Springer
13 years 9 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...