Lower Bounds for Local Search by Quantum Arguments

Details Lower Bounds for Local Search by Quantum Arguments Lower Bounds for Local Search by Quantum Arguments

2003-07-21

arxiv.org/abs/quant-ph/0307149v2

Physics

Quantum Physics

20 pages, 2 figures

Scientific paper

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 hypercube {0,1}^n, we show a lower bound of Omega(2^{n/4}/n) on the number of queries needed by a quantum computer to solve this problem. More surprisingly, our approach, based on Ambainis' quantum adversary method, also yields a lower bound of Omega(2^{n/2}/n^2) on the problem's classical randomized query complexity. This improves and simplifies a 1983 result of Aldous. Finally, in both the randomized and quantum cases, we give the first nontrivial lower bounds for finding local minima on grids of constant dimension greater than 2.

Affiliated with

Also associated with

No associations

Rating

Lower Bounds for Local Search by Quantum Arguments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower Bounds for Local Search by Quantum Arguments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds for Local Search by Quantum Arguments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-341376