Quantum search with advice

Authors:
Ashley Montanaro
Affiliations:
Department of Applied Mathematics and Theoretical Physics, University of Cambridge, UK
Venue:
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Year:
2010

Citing 4
Cited 0

Randomized algorithms

Randomized algorithms
Quantum lower bounds by polynomials

Journal of the ACM (JACM)
Quantum computation and quantum information

Quantum computation and quantum information
Complexity measures and decision tree complexity: a survey

Theoretical Computer Science - Complexity and logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of search of an unstructured list for a marked element x, when one is given advice as to where x might be located, in the form of a probability distribution. The goal is to minimise the expected number of queries to the list made to find x, with respect to this distribution. We present a quantum algorithm which solves this problem using an optimal number of queries, up to a constant factor. For some distributions on the input, such as certain power law distributions, the algorithm can achieve exponential speed-ups over the best possible classical algorithm. We also give an efficient quantum algorithm for a variant of this task where the distribution is not known in advance, but must be queried at an additional cost. The algorithms are based on the use of Grover's quantum search algorithm and amplitude amplification as subroutines.