Quantum analogue computing

We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.

[1]  William Thomson,et al.  VI. Mechanical integration of the general linear differential equation of any order with variable coefficients , 1876, Proceedings of the Royal Society of London.

[2]  Claude E. Shannon,et al.  Mathematical Theory of the Differential Analyzer , 1941 .

[3]  E. Wigner.  The Unreasonable Effectiveness of Mathematics in the Natural Sciences (reprint) , 1960 .

[4]  M. B. Pour-El,et al.  Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers) , 1974 .

[5]  L. Rubel.  A universal differential equation , 1981 .

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

[7]  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.

[8]  L. Rubel,et al.  A differentially algebraic replacement theorem, and analog computability , 1987 .

[9]  Lee A. Rubel,et al.  Digital simulation of analog computation and Church's thesis , 1989, Journal of Symbolic Logic.

[10]  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.

[11]  Lee A. Rubel,et al.  The Extended Analog Computer , 1993 .

[12]  Shor,et al.  Scheme for reducing decoherence in quantum computer memory. , 1995, Physical review. A, Atomic, molecular, and optical physics.

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

[14]  A. Steane.  Multiple-particle interference and quantum error correction , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[15]  Laflamme,et al.  Perfect Quantum Error Correcting Code. , 1996, Physical review letters.

[16]  Seth Lloyd,et al.  Universal Quantum Simulators , 1996, Science.

[17]  S. Braunstein,et al.  Quantum computation over continuous variables , 1998 .

[18]  Timothy F. Havel,et al.  Quantum Simulations on a Quantum Computer , 1999, quant-ph/9905045.

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

[20]  Timothy C. Ralph,et al.  Quantum information with continuous variables , 2000, Conference Digest. 2000 International Quantum Electronics Conference (Cat. No.00TH8504).

[21]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[22]  Andrew S. Glassner.  Quantum Computing, Part 3 , 2001, IEEE Computer Graphics and Applications.

[23]  E. Knill,et al.  Simulating physical phenomena by quantum networks , 2001, quant-ph/0108146.

[24]  Kae Nemoto,et al.  Efficient classical simulation of continuous variable quantum information processes. , 2002, Physical review letters.

[25]  D A Lidar,et al.  Polynomial-time simulation of pairing models on a quantum computer. , 2002, Physical review letters.

[26]  Andris Ambainis,et al.  QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS , 2003, quant-ph/0403120.

[27]  Daniel Silva Graça,et al.  Some recent developments on Shannon's General Purpose Analog Computer , 2004, Math. Log. Q..

[28]  Seth Lloyd,et al.  Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[29]  D Porras,et al.  Density matrix renormalization group and periodic boundary conditions: a quantum information perspective. , 2004, Physical review letters.

[30]  7.2 dB quadrature squeezing at 860 nm with periodically-poled KTiOPO 4 , 2006, QELS 2006.

[31]  F. Kannari,et al.  7.2 dB quadrature squeezing at 860 nm with periodically-poled KTiOPO4 , 2006, 2006 Conference on Lasers and Electro-Optics and 2006 Quantum Electronics and Laser Science Conference.

[32]  V. Kendon,et al.  A random walk approach to quantum algorithms , 2006, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[33]  I. Chuang,et al.  Limitations of quantum simulation examined by simulating a pairing Hamiltonian using nuclear magnetic resonance. , 2006, Physical review letters.

[34]  Yuishi Takeno,et al.  9 dB Quadrature squeezing at 860 nm with periodically-poled KTiOPO4 , 2007, 2007 Quantum Electronics and Laser Science Conference.

[35]  Thomas Lippert,et al.  Massively parallel quantum computer simulator , 2006, Comput. Phys. Commun..

[36]  Simon J. Devitt,et al.  Photonic module: An on-demand resource for photonic entanglement , 2007, 0706.2226.

[37]  Samuel L. Braunstein,et al.  Quantum error correction beyond qubits , 2008, 0811.3734.

[38]  Jonathan W. Mills,et al.  The nature of the Extended Analog Computer , 2008 .

[39]  W. Munro,et al.  The idiots guide to Quantum Error Correction , 2009 .

[40]  Nicolas J Cerf,et al.  No-go theorem for gaussian quantum error correction. , 2008, Physical review letters.

[41]  Sarah A Harris,et al.  Quantum-assisted biomolecular modelling , 2010, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[42]  Mark S. Everitt,et al.  Universal Continuous Variable Quantum Computation in the Micromaser , 2010, UC.

[43]  Arjen K. Lenstra,et al.  Factorization of a 768-Bit RSA Modulus , 2010, CRYPTO.