- This event has passed.
Papers We Love: Shor’s Algorithm
February 11 @ 7:00 pm - 9:00 pm
This month’s paper is about quantum computing so we’re glad someone as smart as Kevin Brown will be there to explain it to us all.
A digital computer is generally believed to be an efficient universal computing device, able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. Join our discussion of Peter Shor’s paper, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.