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.
Peter
W. Shor, ``Polynomial-time algorithms for prime factorization and
discrete logarithms on a quantum computer,'' SIAM Journal of
Computation, vol. 26, n.5 (1997), pp. 1484-1509.
Claude Cohen-Tannoudji, et al., Quantum Mechanics, vols 1 &
2, Wiley and Sons, (1992). (Likely the best advanced textbook on quantum
theory, albeit an expensive paperback!)
P.J.E. Peebles, Quantum Mechanics, Princeton University Press,
1992. (A clear and concise introduction to the essentials.)
David Bohm, Quantum Theory Dover Books, (1989). (A classic
and affordable.)
John von Neumann, Mathematical Foundations of Quantum
Mechanics, Princeton University Press, (1986).