From Schrödinger's Equation to the Quantum Search Algorithm

Abstract

The quantum search algorithm is a technique for searching N possibilities in only sqrt(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 the quantum search algorithm from a new perspective.

Postscript file, 16 pages. This is a pedagogical article describing the invention of the quantum search algorithm. It appeared in the July, 2001 issue of American Journal of Physics (AJP)

Cited by in corpus (14)

• Statistical Assertions for Validating Patterns and Finding Bugs in Quantum Programs
• A Computer Science-Oriented Approach to Introduce Quantum Computing to a New Audience
• Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2
• Search on a Fractal Lattice using a Quantum Random Walk
• Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene
• Search on a Hypercubic Lattice through a Quantum Random Walk: II. d=2
• Entanglement cost and entangling power of bipartite unitary and permutation operators
• Opening the Black Box Inside Grover's Algorithm
• Density functionals and Kohn-Sham potentials with minimal wavefunction preparations on a quantum computer
• Observation of exceptional point in a PT broken non-Hermitian system simulated using a quantum circuit
• Scaling Hypothesis of Spatial Search on Fractal Lattice Using Quantum Walk
• Quantum walks as thermalizations, with application to fullerene graphs
• Measurement Schemes for Quantum Linear Equation Solvers
• Unobservable causal loops as a way to explain both the quantum computational speedup and quantum nonlocality