[Colloquium] Correction to Traub announcement

[Meridel Trimble]

The Traub talk is, of course, May 5th--not April 5th--sorry for the typo!

-Meridel

TOYOTA TECHNOLOGICAL INSTITUTE TALK 

Speaker: Joseph F. Traub 
Speaker 's Homepage:  Columbia University 
http://www1.cs.columbia.edu/~traub/ 
 
Time: Wednesday, May 5th 2004, 2:45p.m. 

Title: Algorithms and Complexity for Continuous Problems on Quantum Computers

Abstract: For four decades advances in computation have been made possible by 
Moore's Law. It is generally believed that Moore's Law using current
technologies will end in one to two decades because of both physical and 
economic limits. One candidate for the future is quantum computation.

There are two major reasons for studying continuous problems on a quantum 
computer:

--Many problems in science, economics, finance and engineering have continuous 
mathematical models. In particular, formulations of quantum mechanics such as 
Schroedinger's equation and path integration are continuous.

--To establish a problem's quantum speedup, one must know the problem's 
classical computational complexity. The classical complexity of many 
continuous problems is known. This may be contrasted to discrete problems, 
such as factorization, where the classical complexity is unknown.

We are developing algorithms for solving important continuous models which are 
difficult to solve on classical computers and which have large
theoretical speedups on quantum computers. We seek quantum algorithms which 
require only a modest number of qubits.

Future research directions will be indicated.