388 search results - page 4 / 78 » Quantum Lower Bounds by Polynomials |
FCT
2005
Springer
13 years 12 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
STOC
2004
ACM
14 years 6 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...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
STOC
2000
ACM
13 years 10 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
CORR
1998
Springer
13 years 6 months ago
1998
Springer
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...