10 search results - page 1 / 2 » Quantum and classical query complexities of local search are... |
126
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
157
Voted
COCO
2000
Springer
15 years 6 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
105
click to vote
STOC
2004
ACM
16 years 2 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...
92
Voted
STACS
2005
Springer
15 years 7 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
144
click to vote
COCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...