Quantum Computing for the Classically Minded

(April 24, 2001)

Abstract:

Theoretical studies over the last decade suggest that computers based in the quantum mechanical domain have the potential to dramatically out perform more conventional (i.e., classical) models of computation. For example, Shor developed a quantum algorithm that factors an n-bit integer in polynomial time. (The best known classical algorithm requires O(exp(n^(1/3) (log n)^(2/3))) operations.) This talk will introduce some fundamental concepts of quantum computing, including qubits, quantum circuits, and maybe even the quantum Fourier transform, a component of Shor's algorithm.

References and Links:



Return to Robert Snapp's Home Page or to the Department of Computer Science Home Page
(Last modified on April 26, 2001.)