Bibliography and References

WWW INFORMATION

There is much material on the WWW on the subjects of quantum computation, quantum cryptography and quantum information theory.

• Quantum Physics archive at Los Alamos National Laboratory
• Quantum Computation and Cryptography Home Page at Oxford
• John Smolin's Quantum Information Page
• Samuel L. Bernstein's Tutorial on Quantum Computation

For an excellent introduction to the Many Worlds theory I recommend the many-worlds-faq by Michael Clive Price, which is available on the world wide web.

POPULAR ARTICLES

A number of articles about quantum computing have appeared in popular scientific magazines. I recommend:

• Julian Brown, A Quantum Revolution for Computing, New Scientist, 24 September 1994, pp. 21-24
• D. Deutsch, Quantum computation, Physics World, June 1992.
• Seth Lloyd, Quantum Mechanical Computers, Scientific American, October 1995, pp. 44-50.
• The Economist, The Weirdest Computer of All.
  

PAPERS

• P. Benioff (1980), The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, J. Statist. Phys., 22, pp. 563-591.
• P. Benioff (1982a), Quantum mechanical Hamiltonian models of Turing machines, J. Statist. Phys., 29, pp. 515-546.
• P. Benioff (1982b), Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy, Phys. Rev. Lett., 48, pp 1581-1585.
• C. Bennet (1973), Logical reversibility of computation, IBM J. Res. Develop., 17, pp. 525-532.
• C. Bennett, E. Bernstein, G. Brassard, U. Vazirani (1996) Strengths and Weaknesses of Quantum Computing, available from http://xxx.lanl.gov/archive/quant-ph
• E. Bernstein and U. Varirani (1993) Quantum Complexity Theory, Proceedings of the 25th Annual ACM symposium on Theory of Computing, 1993, 11-20
• G. Brassard (1996), New trends in quantum computing, 13th Symposium on Theoretical Aspects of computer science, Grenoble, France, 22 - 24 February 1996.
• D. Deutsch (1985), Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London Ser. A, 400, pp. 96-117.
• D. Deutsch (1989), Quantum computational networks, Proc. Roy. Soc. London Ser. A, 425, pp. 73-90.
• D. DiVincenzo (1995), Two-bit gates are universal for quantum computation, Phys. Rev. A, 51, pp. 1015-1022.
• A. Ekert (1993), Quantum Computation
• Y. Lecerf (1963), Machines de Turing réversibles. R‚cursive insolubilité en n Î N de l'équation u = qnu, où q est un isomorphisme de code, C. R. Acad. Française Sci., 257, pp. 2597-2600.
• A. K. Lenstra, H. W. Lenstra, Jr. (1993), The Development of the Number Field Sieve, Lecture Notes in Mathematics, Vol. 1554, Springer
• R. Feynman (1982), Simulating physics with computers, Internat. J. Theoret. Phys, 21, pp. 467-488.
• R. Feynman (1986), Quantum mechanical computers, Found. Phys., 16, pp. 507-531. Originally appeared in Optics News (February 1985), pp. 11-20.
• P. Shor (1996) Polynomial-time algorithms for prime factorisation and discrete logarithms on a quantum computer, available from http://xxx.lanl.gov/archive/quant-ph
• A. Yao (1993), Quantum circuit complexity, in Proceedings of the 34th Anual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 352-361