Quantum Computation and Quantum Learning -- James Pommersheim, March 2, 2004

In recent years, computer scientists, physicists, and mathematicians alike have become excited by the idea of building a quantum computer, a computer which operates at the logical level according to quantum mechanical principles. Over the past decade, we have learned that such a computer would be capable of tasks, such as factoring large integers, which are widely believed to be difficult to solve on a classical computer. This technology would also enable two parties to communicate securely over a bugged channel. In this talk, we will introduce a mathematical formulation of quantum computation. We will examine some of the problems at which quantum computers excel, including the problems of Bernstein-Vazirani and Grover. We will see how these problems fit in with classical learning theory, and present a new general method for finding quantum solutions to learning problems.