|
|
MIT Electrical Engineering and Computer Science
EECS Event |
Thursday, October 5, 2000
1:00 PM
Grier Room, Room 34-401A
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 seminar will describe these steps, which start by discretizing Schrvdinger's equation and then following the evolution of the system in a potential function.