Abstract
The quantum search algorithm is a technique for searching N possibilities in only O(√N) steps. Although the algorithm itself is widely known, not so well known is the series of steps that first led to it, these are quite different from any of the generally known forms of the algorithm. This paper describes these steps, which start by discretizing Schrödinger’s equation. This paper also provides a self contained introduction to quantum computing algorithms from a new perspective.
Similar content being viewed by others
References
L K Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 78(2), 325–328 (1997) available on my homepage http://www.bell-labs.com/user/lkgrover/
A fast quantum mechanical algorithm for database search, Proceedings of 28th Annual ACM Symposium on Theory of Computing (STOC), 212–219 (1996) available on my homepage http://www.bell-labs.com/user/lkgrover/
Richard Jozsa, Searching in Grover’s Algorithm, http://xxx.lanl.gov/abs/quant-ph/9901021
For an N-state system, in order for the terms in each row to sum to unity, the diagonal terms of D should be (1 − i(N − 1)ε). However, for simplicity, we write this as (1 − iNε). For N large, the error due to this is negligible
M Boyer, G Brassard, P Hoyer and A Tapp. Tight bounds on quantum searching, Proc. Phys. Comp. (1996) http://xxx.lanl.gov/abs/quant-ph/9605034
C Zalka, Grover’s quantum searching algorithm is optimal, Phys. Rev. A60, 2746–1751 (1999) http://arXiv.org/abs/quant-ph/9711070
Author information
Authors and Affiliations
Additional information
A preliminary version of this paper was presented in the Winter Institute of Foundations of Quantum Theory in January 2000. A modified version of this has been accepted for publication in the American Journal of Physics and will appear sometime in the period July–September 2000.
Rights and permissions
About this article
Cite this article
Grover, L.K. From Schrödinger’s equation to the quantum search algorithm. Pramana - J Phys 56, 333–348 (2001). https://doi.org/10.1007/s12043-001-0128-3
Issue Date:
DOI: https://doi.org/10.1007/s12043-001-0128-3