Abstract
In this paper we give a quantum mechanical algorithm that can search a database by a single query when the number of solutions is more than a quarter. It utilizes the generalized Grover operator of arbitrary phase.
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.
Similar content being viewed by others
References
Bennett, C. H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26 (1997) 1510–1523
Boyer, M., Brassard, G., HØyer, P., Tapp, A.: Tight bounds on quantum searching. Proceedings of the Fourth Workshop on Physics and Computation, New England Complex Systems Institute, 1996, 36–43
Brassard, G., HØyer, P.: An exact quantum polynomial-time algorithm for Simon’s problem. Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, 1997 (to appear)
Grover, L. K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79 (1997) 325–328
Kitaev, A. Yu.: Quantum measurements and the abelian stabilizer problem. Los Alamos e-print quant-ph/9511026, 1995
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chi, D.P., Kim, J. (1999). Quantum Database Search by a Single Query. In: Williams, C.P. (eds) Quantum Computing and Quantum Communications. QCQC 1998. Lecture Notes in Computer Science, vol 1509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49208-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-49208-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65514-5
Online ISBN: 978-3-540-49208-5
eBook Packages: Springer Book Archive