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.
Work done while at the University of Bristol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ambainis, A., de Wolf, R.: Average-case quantum query complexity. J. Phys. A: Math. Gen. 34, 6741–6754 (2001), quant-ph/9904079
Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778–797 (2001), quant-ph/9802049
Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4-5), 493–505 (1998), quant-ph/9605034
Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information: A Millennium Volume, pp. 53–74 (2002), quant-ph/0005055
Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theoretical Computer Science 288, 21–43 (2002)
Grover, L.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997), quant-ph/9706033
Grover, L., Rudolph, T.: Creating superpositions that correspond to efficiently integrable probability distributions (2002), quant-ph/0208112
Høyer, P.: Arbitrary phases in quantum amplitude amplification. Phys. Rev. A 62, 052304 (2000), quant-ph/0006031
Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)
Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge University Press, Cambridge (2000)
Press, W.H.: Strong profiling is not mathematically optimal for discovering rare malfeasors. Proceedings of the National Academy of Sciences 106(6), 1716–1719 (2009)
Zalka, C.: Grover’s quantum searching algorithm is optimal. Phys. Rev. A. 60(4), 2746–2751 (1999), quant-ph/9711070
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montanaro, A. (2011). Quantum Search with Advice. In: van Dam, W., Kendon, V.M., Severini, S. (eds) Theory of Quantum Computation, Communication, and Cryptography. TQC 2010. Lecture Notes in Computer Science, vol 6519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18073-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-18073-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18072-9
Online ISBN: 978-3-642-18073-6
eBook Packages: Computer ScienceComputer Science (R0)