|
Abstract:
The hope that there are problems that can be solved more
efficiently with a quantum algorithm than with any classical one
motivates much of the effort currently being invested in constructing
quantum computers. Grover's search algorithm combines the two main
building blocks for quantum algorithms—fast transforms and
amplitude amplification—and is deceptively simple. In this talk
I'll explain how a geometer, a probabilist, or an analyst might view
Grover's algorithm. These different views suggest a variety of other
problems that may have efficient quantum solutions.
|