131 search results - page 5 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
128
click to vote
STOC
2006
ACM
16 years 1 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...
107
click to vote
STOC
1991
ACM
15 years 4 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
123
click to vote
CORR
2002
Springer
15 years 1 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...
114
click to vote
CORR
1998
Springer
15 years 28 days 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...
116
click to vote
AIEDAM
2008
15 years 1 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...