Quantum computation

As device structures get smaller quantum mechanical effects predominate. About twenty years ago it was shown that it was possible to redesign devices so that they could still carry out the same functions. Recently it has been shown that the processing speed of computers based on quantum mechanics is indeed far superior to their classical counterparts for some important applications. This paper introduces quantum mechanics and shows how this can be used for computation.

[1]  N. Margolus.  Physics-like models of computation☆ , 1984 .

[2]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[3]  N. Sloane,et al.  Quantum Error Correction Via Codes Over GF , 1998 .

[4]  King,et al.  Demonstration of a fundamental quantum logic gate. , 1995, Physical review letters.

[5]  Arthur O. Pittenger,et al.  An Introduction to Quantum Computing Algorithms , 2000 .

[6]  Tommaso Toffoli.  Integration of the Phase-Difference Relations in Asynchronous Sequential Networks , 1978, ICALP.

[7]  Wojciech H. Zurek,et al.  Reversibility and stability of information processing systems , 1984 .

[8]  Peter W. Shor,et al.  Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract) , 1994, FOCS 1994.

[9]  Ekert,et al.  Quantum Error Correction for Communication. , 1996 .

[10]  N. Mermin.  Quantum theory: Concepts and methods , 1997 .

[11]  Gilles Brassard,et al.  An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[12]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[13]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[14]  Tommaso Toffoli,et al.  Computation and Construction Universality of Reversible Cellular Automata , 1977, J. Comput. Syst. Sci..

[15]  E. Schrödinger.  Discussion of Probability Relations between Separated Systems , 1935, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[17]  Charles H. Bennett,et al.  Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.

[18]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[19]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[20]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[21]  R. Cleve.  An Introduction to Quantum Complexity Theory , 1999, quant-ph/9906111.

[22]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[23]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[24]  Physical Review , 1965, Nature.

[25]  S. Lloyd.  Quantum-Mechanical Computers , 1995 .

[26]  細谷 暁夫,et al.  量子コンピュータの基礎 : lectures on quantum computation , 1999 .

[27]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[28]  E. Schrödinger.  Probability relations between separated systems , 1936, Mathematical Proceedings of the Cambridge Philosophical Society.

[29]  N. Gershenfeld,et al.  Quantum Computing with Molecules , 1998 .

[30]  Barenco,et al.  Quantum networks for elementary arithmetic operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[31]  Lydia L. Sohn,et al.  The Aharonov-Casher effect for vortices in Josephson-junction arrays , 1994 .

[32]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[33]  David P. DiVincenzo,et al.  Quantum information and computation , 2000, Nature.

[34]  Eric Allender,et al.  Complexity Theory , 1997, Encyclopedia of Cryptography and Security.

[35]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[36]  Gilles Brassard,et al.  A Quantum Jump in Computer Science , 1995, Computer Science Today.

[37]  Andrew Chi-Chih Yao,et al.  Coherent Functions and Program ( extended abstract ) Checkers , .

[38]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[39]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[40]  Richard Edwin Stearns,et al.  Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[41]  I. Chuang,et al.  Creation of a persistent quantum bit using error correction , 1997 .

[42]  Bertram M. Schwarzschild.  Inhaling Hyperpolarized Noble Gas Helps Magnetic Resonance Imaging of Lungs , 1995 .

[43]  S. Braunstein,et al.  Quantum computation , 1996 .

[44]  J Glanz,et al.  A quantum leap for computers? , 1995, Science.

[45]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[46]  Tommaso Toffoli,et al.  Cellular automata machines - a new environment for modeling , 1987, MIT Press series in scientific computation.

[47]  Benjamin Schumacher.  Sending quantum entanglement through noisy channels , 1996 .

[48]  R. Feynman.  Simulating physics with computers , 1999 .

[49]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[50]  ROLF LANDAUER.  Dissipation in computation , 1989, Nature.

[51]  R. D. Wolf.  Quantum Computation and Shor's Factoring Algorithm , 1999 .

[52]  Pérès,et al.  Reversible logic and quantum computers. , 1985, Physical review. A, General physics.

[53]  Mooij,et al.  One-Dimensional Mott Insulator Formed by Quantum Vortices in Josephson Junction Arrays. , 1996, Physical review letters.

[54]  Tommaso Toffoli,et al.  Cellular Automata as an Alternative to (Rather than an Approximation of) Differential Equations in M , 1984 .

[55]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[56]  Gottesman.  Class of quantum error-correcting codes saturating the quantum Hamming bound. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[57]  Asher Peres,et al.  Measurement of time by quantum clocks , 1980 .

[58]  DiVincenzo.  Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[59]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[60]  T. Spiller,et al.  Quantum information processing: cryptography, computation, and teleportation , 1996, Proc. IEEE.

[61]  Schumacher,et al.  Quantum data processing and error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[62]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[63]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.