Santa Clara University

SCU Mathematics/CS Colloquium Series Fall 2010

Title: Factoring on a Quantum Computer

Speaker:Wolfgang Polak, Computer Science Consultant

Tuesday,October 26, 2010
3:50 pm.
O'Connor 207

Abstract: All practical public-key encryption systems rely on the complexity of either factoring or discrete logarithms. Both problems can be solved efficiently on a quantum computer. Thus, once built, quantum computers can defeat most known digital security schemes.

This talk introduces essential features of quantum mechanics needed to characterize quantum information, quantum state transformations and their use for computation. Peter Shor's polynomial-time factoring algorithm will be used to illustrate the unique features of quantum computation.

If you have a disability and require a reasonable accommodation,
please call/email Rick Scott 408-554-4460/rscott at scu dot edu (or
use 1-800-735-2929 TTY—California Relay).