Abstract
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1–ε, where ε is a random variable that is uniformly distributed in the range (0,ε 0).The problem is to try to select a marked item from the database in a single query. If the algorithm selects a marked item, it succeeds, else if it selects an unmarked item, it makes an error.
How low can we make the probability of error? The best possible classical algorithm can lower the probability of error to O(ε \(_{\rm 0}^{\rm 2}\)). The best known quantum algorithms for this problem could also only lower the probability of error to O( ε \(_{\rm 0}^{\rm 2}\)). Using a recently invented quantum search technique, this paper gives an algorithm that reduces the probability of error to O(ε \(_{\rm 0}^{\rm 3}\)). The algorithm is asymptotically optimal.
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
Grover, L.K.: Quantum Mechanics helps in searching for a needle in a haystack. Phys. Rev. Letters 78(2), 325 (1997)
Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for Simon’s problem. In: Proceedings of Fifth Israeli Symposium on Theory of Computing and Systems (ISTCS 1997), Ramat-Gan, Israel, June 1997, pp. 12–23 (1997) quant-ph/9704027
Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Letters 80(19), 4329–4332 (1998)
Boyer, et al.: quant-ph/9605034, PhysComp 96, and Fortsch.Phys. 46, 493-506 (1998)
Mosca, M.: Theoretical Computer Science, vol. 264, pp. 139–153 (2001)
Younes, A., Rowe, J., Miller, J.: Quantum Search Algorithm with more Reliable Behavior using Partial Diffusion, quant-ph/0312022
Grover, L.K.: A different kind of quantum search, quant-ph/0503205
Reichardt., B., Grover, L.K.: Quantum error correction of systematic errors using a quantum search framework, quant-ph/0506242
Chakraborty, S., Radhakrishnan, J., Raghunathan, N.: The optimality of Grover’s recent quantum search algorithm, manuscript in preparation
Tulsi, T., Grover, L., Patel, A.: A new algorithm for directed quantum search, quant-ph/0505007
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grover, L.K. (2005). Quantum Searching Amidst Uncertainty. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_2
Download citation
DOI: https://doi.org/10.1007/11560319_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29100-8
Online ISBN: 978-3-540-32022-7
eBook Packages: Computer ScienceComputer Science (R0)