From Schrodinger's equation to the quantum search algorithm

The quantum search algorithm is a technique for searching N possibilities i n only O(rootN) steps. Although the algorithm itself is widely known, not s o well known is the series of steps that first led to it, these are quite d ifferent from any of the generally known forms of the algorithm. This paper describes these steps, which start by discretizing Schrodinger's equation. This paper also provides a self contained introduction to quantum computin g algorithms from a new perspective.