This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Beyond Bits: The Future of Quantum Information Processing
January 2000 (vol. 33 no. 1)
pp. 38-45

Today's computers operate on the same fundamental principle as the mechanical devices dreamed up by Charles Babbage in the 19th century and later formalized by Alan Turing: One stable state of the machine represents one number. Even seemingly nonstandard computation models, such as the one based on DNA, share this basic principle.

Recently, physicists and computer scientists have realized that not only do their ideas about computing rest on partly accurate principles, but they miss out on a whole class of computation. Quantum physics offers powerful methods of encoding and manipulating information that are not possible within a classical framework. The potential applications of these quantum information-processing methods include provably secure key distribution for cryptography, rapid integer factoring, and quantum simulation. The authors discuss the directions that quantum information theory appears to be heading and the research and applications it has accrued.

1. P.W. Shor, "Polynomial-Time Algorithms for Prime Factorization and Discrete Algorithms on a Quantum Computer," SIAM J. Computing, Vol. 26, No. 1484-1509, 1997.
2. D. Deutsch, "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer," Proc. Royal Society of London, Series A, A400, 1985, pp. 97-117.
3. R.P. Feynman, "Quantum Mechanical Computers," Lectures on Computation, A.J.G. Hey and R.W. Alice, eds., Addison-Wesley, Reading, Mass., 1996, pp. 185-211.
4. L.K. Grover, "A Fast Quantum Mechanical Algorithm for Database Search," Proc. 28th Ann. ACM Symp. Theory of Computing, ACM Press, New York, 1996, pp. 212-219.
5. A. Hey, ed., Feynman and Computation, Perseus Books, Reading, Mass., 1999.
6. J. Preskill and A. Kitaev, "Course Information for Physics 229 Advanced Mathematical Methods of Physics," http://www.theory.caltech.edu/people/preskill/ ph229index.html# lecture.
7. E. Rieffel and W. Polak, "An Introduction to Quantum Computing for Non-Physicists," to be published in ACM Computing Surveys, June 2000; .
8. A. Steane, "Quantum Computing," Reports on Progress in Physics, Vol. 61, 1998, pp. 117-173; http://xxx.lanl.gov/abs/quant-ph/9809016http:/ /xxx.lanl.gov/abs/quant-ph9708022 .
1. P.W. Shor, "Polynomial-Time Algorithms for Prime Factorization and Discrete Algorithms on a Quantum Computer," SIAM J. Computing, Vol. 26, No. 1484-1509, 1997.
1. C.H. Bennett, G. Brassard, and A.K. Ekert, "Quantum Cryptography," Scientific American, Oct. 1992, pp. 50-57.

Citation:
Andrew M. Steane, Eleanor G. Rieffel, "Beyond Bits: The Future of Quantum Information Processing," Computer, vol. 33, no. 1, pp. 38-45, Jan. 2000, doi:10.1109/2.816267
Usage of this product signifies your acceptance of the Terms of Use.