This is an abstract from a talk at Cornell University...

[Peter Wayner <pcw@access.digex.net>]

Subject: Lecture-Peter Shor-Factoring in Poly time
Date: Mon, 9 May 1994 02:23:57 GMT

FACTORING IN POLYNOMIAL TIME ON A QUANTUM COMPUTER
Peter Shor, AT&T Bell Labs

Richard Feynman and others have challenged the traditional Turing
machine model of computation.  A new model of computation based
on quantum mechanics has recently been proposed.  It is too early
to know whether quantum computers will be practical.  However, it
is shown that quantum computers can factor integers and compute
discrete logarithms in polynomial time.

Lecture Hall D (north end), Goldwin Smith
11:40am, Monday, May 9

-----------------

Any comments on the veracity?