Simulating chemistry using quantum computers

Annual Review of Physical Chemistry

Volumn 62, Issue , 2011, Pages 185-207

  Kassal, Ivan ^a   Whitfield, James D ^a   Perdomo Ortiz, Alejandro ^a   Yung, Man Hong ^a   Aspuru Guzik, Alán ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

chemical dynamics; electronic structure; quantum algorithms; quantum computation

Indexed keywords

COMPUTATION THEORY; QUANTUM COMPUTERS; QUANTUM OPTICS;

CHEMICAL DYNAMICS; CHEMICAL PROBLEMS; CONVENTIONAL COMPUTERS; DYNAMIC PROTEINS; ELECTRONIC.STRUCTURE; PROTEIN FOLDINGS; QUANTA COMPUTERS; QUANTUM ALGORITHMS; QUANTUM SYSTEM; SCALINGS;

ELECTRONIC STRUCTURE;

EID: 79952355302     PISSN: 0066426X     EISSN: None     Source Type: Book Series    
DOI: 10.1146/annurev-physchem-032210-103512     Document Type: Article

References (139)

1. Feynman R. 1982. Simulating physics with computers. Int. J. Theor. Phys. 21:467-88.
2. Lloyd S. 1996. Universal quantum simulators. Science 273:1073-78. (Pubitemid 26278158)
3. Kaye P, Laflamme R, Mosca M. 2007. An Introduction to Quantum Computing. New York: Oxford Univ. Press.
4. Nielsen MA, Chuang IL. 2000. Quantum Computation and Quantum Information. Cambridge, UK: Cambridge Univ. Press.
5. Aharonov D, vanDam W, Kempe J, Landau Z, Lloyd S, RegevO. 2007. Adiabatic quantum computation is equivalent to standard quantum computation. SIAM J. Comput. 37:166-94. (Pubitemid 351321992)
6. Kempe J, Kitaev A, Regev O. 2006. The complexity of the local Hamiltonian problem. SIAM J. Comput. 35:1070-97. (Pubitemid 44599919)
7. Mizel A, Lidar DA, Mitchell M. 2007. Simple proof of equivalence between adiabatic quantum computation and the circuit model. Phys. Rev. Lett. 99:070502.
8. Kitaev A. 2003. Fault-tolerant quantum computation by anyons. Ann. Phys. 303:2-30. (Pubitemid 36177417)
9. Nayak C, Simon SH, Stern A, Freedman M, Sarma SD. 2008. Non-Abelian anyons and topological quantum computation. Rev. Mod. Phys. 80:1083-159.
10. Raussendorf R, Briegel HJ. 2001. A one-way quantum computer. Phys. Rev. Lett. 86:5188-91. (Pubitemid 32527770)
11. Raussendorf R, Browne DE, Briegel HJ. 2003. Measurement-based quantum computation on cluster states. Phys. Rev. A 68:022312.
12. Kempe J. 2003. Quantum random walks: an introductory overview. Contemp. Phys. 44:307.
13. Barenco A, Bennett CH, Cleve R, DiVincenzo DP, Margolus N, et al. 1995. Elementary gates for quantum computation. Phys. Rev. A 52:3457-67.
14. Deutsch D. 1989. Quantum computational networks. Proc. R. Soc. Lond. A 425:73-90.
15. Null L, Lobur J. 2003. The Essentials of Computer Organization and Architecture. Sudbury, MA: Jones & Bartlett.
16. Ladd TD, Jelezko F, Laflamme R, Nakamura Y, Monroe C, O'Brien JL. 2010. Quantum computers. Nature 464:45-53.
17. Farhi E, Goldstone J, Gutmann S, SipserM. 2000. Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106.
18. Amin MHS. 2009. Consistency of the adiabatic theorem. Phys. Rev. Lett. 102:220401.
19. Messiah A. 1999. Quantum Mechanics. New York: Dover.
20. Tong DM. 2010. Quantitative condition is necessary in guaranteeing the validity of the adiabatic approximation. Phys. Rev. Lett. 104:120401.
21. Tong DM, Singh K, Kwek LC, Oh CH. 2007. Sufficiency criterion for the validity of the adiabatic approximation. Phys. Rev. Lett. 98:150402.
22. Perdomo A, Truncik C, Tubert-Brohman I, Rose G, Aspuru-Guzik A. 2008. Construction of model Hamiltonians for adiabatic quantum computation and its application to finding low-energy conformations of lattice protein models. Phys. Rev. A 78:012320.
23. Arora S, Barak B. 2009. Computational Complexity: AModern Approach.Cambridge,UK: Cambridge Univ. Press.
24. Aaronson S. 2008. The limits of quantum computers. Sci. Am. 298(3):62-69. (Pubitemid 351541564)
25. Watrous J. 2009. Quantum computational complexity. In Encyclopedia of Complexity and System Science, ed. RA Meyer, pp. 7174-201. Berlin: Springer.
26. Shor PW. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26:1484-509. (Pubitemid 127613100)
27. Bakr WS, Peng A, Tai ME, Ma R, Simon J, et al. 2010. Probing the superfluid-to-Mott-insulator transition at the single-atom level. Science 329:547-50.
28. Buluta I, Nori F. 2009. Quantum simulators. Science 326:108-11.
29. Bacon D, Childs AM, Chuang IL, Kempe J, Leung DW, Zhou X. 2001. Universal simulation ofMarkovian quantum dynamics. Phys. Rev. A 64:062302.
30. Berry D, Ahokas G, Cleve R, Sanders B. 2007. Efficient quantum algorithms for simulating sparse Hamiltonians. Commun. Math. Phys. 270:359-71.
31. Hatano N, Suzuki M. 2005. Finding exponential product formulas of higher orders. In Lecture Notes in Physics, Vol. 679, ed. A Das, BK Chakrabarti, pp. 37-68. Berlin: Springer.
32. Brown KL, Munro WJ, Kendon VM. 2010. Using quantum computers for quantum simulation. arXiv:1004.5528.
33. Childs AM. 2004. Quantum information processing in continuous time. PhD thesis. Mass. Inst. Technol., Cambridge.
34. Schack R. 2006. Simulation on a quantum computer. Inf. Forsch. Entwickl. 21:21-27.
35. Aspuru-Guzik A, Dutoi AD, Love PJ, Head-Gordon M. 2005. Simulated quantum computation of molecular energies. Science 309:1704-7. (Pubitemid 41285935)
36. Ortiz G, Gubernatis JE, Knill E, Laflamme R. 2001. Quantum algorithms for fermionic simulations. Phys. Rev. A 64:022319.
37. Somma R, Ortiz G, Gubernatis JE, Knill E, Laflamme R. 2002. Simulating physical phenomena by quantum networks. Phys. Rev. A 65:042323.
38. Somma R, Ortiz G, Knill E, Gubernatis J. 2003. Quantum simulations of physics problems. Int. J. Quantum Inf. 2:189-206.
39. Whitfield J, Biamonte J, Aspuru-Guzik A. 2010. Quantum computing resource estimate of molecular energy simulation. arXiv:1001.3855.
40. Davidson E. 1972. Properties and uses of natural orbitals. Rev. Mod. Phys. 44:451-64.
41. Wang H, Ashhab S, Nori F. 2009. Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer. Phys. Rev. A 79:042335.
42. Kassal I, Jordan SP, Love PJ, Mohseni M, Aspuru-Guzik A. 2008. Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proc. Natl. Acad. Sci. USA 105:18681-86.
43. Wiesner S. 1996. Simulations of many-body quantum systems by a quantum computer. arXiv:quantph/ 9603028.
44. Zalka C. 1998. Simulating quantum systems on a quantum computer. Proc. R. Soc. A 454:313-22. (Pubitemid 128733164)
45. Boghosian BM, Taylor W. 1998. Simulating quantum mechanics on a quantum computer. Physica D 120:30-42. (Pubitemid 128676662)
46. Feit M, Fleck J Jr, Steiger A. 1982. Solution of the Schr ̈ odinger equation by a spectralmethod. J. Comput. Phys. 47:412-33.
47. Kosloff D, Kosloff R. 1983. A Fourier method solution for the time dependent Schr ̈ odinger equation as a tool in molecular dynamics. J. Comput. Phys. 51:35-53.
48. Strini G. 2002. Error sensitivity of a quantum simulator. I: A first example. Fortschr. Phys. 50:171-83.
49. BenentiG, StriniG. 2008. Quantum simulation of the single-particle Schr ̈ odinger equation.Am. J. Phys. 76:657-62.
50. Ĺevi B, Georgeot B, Shepelyansky DL. 2003. Quantum computing of quantum chaos in the kicked rotator model. Phys. Rev. E 67:046220.
51. Lidar DA, Wang H. 1999. Calculating the thermal rate constant with exponential speedup on a quantum computer. Phys. Rev. E 59:2429-38. (Pubitemid 129594687)
52. Grover L, Rudolph T. 2002. Creating superpositions that correspond to efficiently integrable probability distributions. arXiv:quant-ph/0208112.
53. Kaye P, Mosca M. 2004. Quantum networks for generating arbitrary quantum states. arXiv:quantph/ 0407102.
54. Kitaev A, Webb WA. 2008. Wavefunction preparation and resampling using a quantum computer. arXiv:0801.0342.
55. Soklakov AN, Schack R. 2006. Efficient state preparation for a register of quantum bits. Phys. Rev. A 73:012307-13.
56. Ward NJ, Kassal I, Aspuru-Guzik A. 2009. Preparation of many-body states for quantum simulation. J. Chem. Phys. 130:194105.
57. Abrams DS, Lloyd S. 1997. Simulation of many-body Fermi systems on a universal quantum computer. Phys. Rev. Lett. 79:2586-89. (Pubitemid 127644970)
58. Abrams DS, Lloyd S. 1999. Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors. Phys. Rev. Lett. 83:5162-65. (Pubitemid 129585380)
59. Kitaev A. 1995. Quantum measurements and the Abelian stabilizer problem. arXiv:quant-ph/9511026.
60. Biamonte JD, Bergholm V, Whitfield JD, Fitzsimons J, Aspuru-Guzik A. 2010. Adiabatic quantum simulators. arXiv:1002.0368.
61. Oh S. 2008. Quantum computational method of finding the ground-state energy and expectation values. Phys. Rev. A 77:012326.
62. Davis MJ, Heller EJ. 1981. Multidimensional wave functions from classical trajectories. J. Chem. Phys. 75:3916-24.
63. Tannor DJ. 2006. Introduction to Quantum Mechanics: A Time-Dependent Perspective. Mill Valley, CA: Univ. Sci. Books.
64. Giovannetti V, Lloyd S, Maccone L. 2004. Quantum-enhanced measurements: beating the standard quantum limit. Science 306:1330-36. (Pubitemid 39534415)
65. Knill E, Ortiz G, Somma R. 2007. Optimal quantum measurements of expectation values of observables. Phys. Rev. A 75:012328.
66. Smirnov A, Savel'ev S, Mourokh L, Nori F. 2007. Modelling chemical reactions using semiconductor quantum dots. Europhys. Lett. 80:67008.
67. Terhal B, DiVincenzo D. 2000. Problem of equilibration and the computation of correlation functions on a quantum computer. Phys. Rev. A 61:022301.
68. Kassal I, Aspuru-Guzik A. 2009. Quantum algorithm for molecular properties and geometry optimization. J. Chem. Phys. 131:224102.
69. Jordan SP. 2005. Fast quantum algorithm for numerical gradient estimation. Phys. Rev. Lett. 95:050501.
70. Wang H, Kais S, Aspuru-Guzik A, Hoffmann MR. 2008. Quantum algorithm for obtaining the energy spectrum of molecular systems. Phys. Chem. Chem. Phys. 10:5388-93.
71. Wu LA, Byrd MS, Lidar DA. 2002. Polynomial-time simulation of pairing models on a quantum computer. Phys. Rev. Lett. 89:057904.
72. Aharonov D, Ta-Shma A. 2008. Adiabatic quantum state generation. SIAM J. Comput. 37:47-82. (Pubitemid 351321987)
73. Somma R, Batista C, Ortiz G. 2007. Quantum approach to classical statistical mechanics. Phys. Rev. Lett. 99:030603.
74. Temme K, Osborne T, Vollbrecht K, Poulin D, Verstraete F. 2009. Quantum Metropolis sampling. arXiv:0911.3635.
75. Chiang C, Wocjan P. 2010. Quantum algorithm for preparing thermal Gibbs states-detailed analysis. arXiv:1001.1130.
76. Poulin D, Wocjan P. 2009. Preparing ground states of quantum many-body systems on a quantum computer. Phys. Rev. Lett. 102:130503.
77. Poulin D, Wocjan P. 2009. Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer. Phys. Rev. Lett. 103:220502.
78. Somma R, Boixo S, Barnum H, Knill E. 2008. Quantum simulations of classical annealing processes. Phys. Rev. Lett. 101:130504.
79. SzegedyM. 2004. Quantum speed-up ofMarkov chain based algorithms. In Proc. 45th Annu. IEEE Symp. Found. Comput. Sci., pp. 32-41. Washington, DC: IEEE Comput. Soc. (Pubitemid 40575264)
80. Wocjan P, Abeyesinghe A. 2008. Speedup via quantum sampling. Phys. Rev. A 78:042336.
81. Mezard M, Montanari A. 2009. Information, Physics, and Computation. New York: Oxford Univ. Press.
82. Yung MH, Nagaj D, Whitfield JD, Aspuru-Guzik A. 2010. Simulation of classical thermal states on a quantum computer: a transfer matrix approach. arXiv:1005.0020.
83. Kohn W. 1999. Nobel lecture: Electronic structure of matter: wave functions and density functionals. Rev. Mod. Phys. 71:1253-66. (Pubitemid 129329208)
84. Aharonov D, Naveh T. 2002. Quantum NP: a survey. arXiv:quant-ph/0210077.
85. Kitaev A, Shen AH, Vyalyi MN. 2002. Classical and Quantum Computation. Providence, RI: Am. Math. Soc.
86. Oliveira R, Terhal BM. 2008. The complexity of quantum spin systems on a two-dimensional square lattice. Quantum Inf. Comput. 8:900-24.
87. Schuch N, Verstraete F. 2009. Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nat. Phys. 5:732-35.
88. Floudas CA, Pardalos PM. 2000. Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches. New York: Springer. 1st ed.
89. Hartmann AK, Rieger H. 2004. New Optimization Algorithms in Physics. New York:Wiley-VCH.
90. Choi V. 2010. Adiabatic quantum algorithms for the NP-complete maximum-weight independent set, exact cover and 3-SAT problems. arXiv:1004.2226.
91. Hogg T. 2003. Adiabatic quantum computing for random satisfiability problems. Phys. Rev. A 67:022314.
92. Neven H, Denchev VS, Rose G, Macready WG. 2009. Training a large scale classifier with the quantum adiabatic algorithm. arXiv:0912.0779.
93. Neven H, Rose G, Macready WG. 2008. Image recognition with an adiabatic quantum computer. I: Mapping to quadratic unconstrained binary optimization. arXiv:0804.4457.
94. Kolinski A, Skolnick J. 1996. Lattice Models of Protein Folding, Dynamics and Thermodynamics. London: Chapman & Hall.
95. Mirny L, Shakhnovich E. 2001. Protein folding theory: from lattice to all-atom models. Annu. Rev. Biophys. Biomol. Struct. 30:361-96. (Pubitemid 32566168)
96. Pande VS, Grosberg AY, Tanaka T. 2000. Heteropolymer freezing and design: towards physical models of protein folding. Rev. Mod. Phys. 72:259-86.
97. Hart WE, Istrail S. 1997. Robust proofs ofNP-Hardness for protein folding: general lattices and energy potentials. J. Comput. Biol. 4:1-22. (Pubitemid 27209249)
98. Dill KA, Ozkan SB, Shell MS, Weikl TR. 2008. The protein folding problem. Annu. Rev. Biophys. 37:289-316.
99. Lau KF, Dill KA. 1989. A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules 22:3986-97.
100. Epstein CJ, Goldberger RF, Anfinsen CB. 1963. Genetic control of tertiary protein structure: studies with model systems. Cold Spring Harb. Symp. 28:439-49.
101. Kaminsky WM, Lloyd S, Orlando TP. 2004. Scalable superconducting architecture for adiabatic quantum computation. arXiv:quant-ph/0403090.
102. Perdomo-Ortiz A, O'Gorman B, Aspuru-Guzik A. 2010. Construction of energy functions for selfavoiding walks and the lattice heteropolymer model: resource efficient encoding for quantum optimization. Manuscript in preparation.
103. Perdomo-Ortiz A,Drew-Brook M, DicksonN,RoseG, Aspuru-Guzik A. 2010. Experimental realization of a 8-qubit quantum-adiabatic algorithm for a lattice proteinmodel: towards optimization on a quantum computer. Manuscript in preparation.
104. Berger B, Leighton T. 1998. Protein folding in the hydrophobic- hydrophilic (HP) model is NPcomplete. J. Comput. Biol. 5:27-40. (Pubitemid 28153003)
105. Crescenzi P, Goldman D, Papadimitriou C, Piccolboni A, Yannakakis M. 1998. On the complexity of protein folding. J. Comput. Biol. 5:597-603.
106. Amin MHS, Choi V. 2009. First-order quantum phase transition in adiabatic quantum computation. Phys. Rev. A 80:062326.
107. Farhi E, Goldstone J, Gosset D, Gutmann S, Meyer H, Shor P. 2009. Quantum adiabatic algorithms, small gaps, and different paths. arXiv:0909.4766v2.
108. Perdomo-Ortiz A, Venegas-Andraca S, Aspuru-Guzik A. 2010. A study of heuristic guesses for adiabatic quantum computation. Quantum Inf. Process. In press; doi: 10.1007/s11128-010-0168-z.
109. Somaroo S, Tseng CH, Havel TF, Laflamme R, Cory DG. 1999. Quantum simulations on a quantum computer. Phys. Rev. Lett. 82:5381-84. (Pubitemid 129689542)
110. Kok P, Munro WJ, Nemoto K, Ralph TC, Dowling JP, Milburn GJ. 2007. Linear optical quantum computing with photonic qubits. Rev. Mod. Phys. 79:135-40.
111. O'Brien JL. 2007. Optical quantum computing. Science 318:1567-70. (Pubitemid 350233653)
112. Lanyon BP, Whitfield JD, Gillett GG, Goggin ME, Almeida MP, et al. 2010. Towards quantum chemistry on a quantum computer. Nat. Chem. 2:106-11.
113. Baugh J, Chamilliard J, Chandrashekar CM, Ditty M, Hubbard A, et al. 2007. Quantum information processing using nuclear and electron magnetic resonance: review and prospects. Phys. Canada 63:197-206.
114. Brown KR, Clark RJ, Chuang IL. 2006. Limitations of quantum simulation examined by simulating a pairing Hamiltonian using nuclear magnetic resonance. Phys. Rev. Lett. 97:050504.
115. Negrevergne C, Somma R, Ortiz G, Knill E, Laflamme R. 2005. Liquid-state NMR simulations of quantum many-body problems. Phys. Rev. A 71:032344.
116. Peng X, Du J, Suter D. 2005. Quantum phase transition of ground-state entanglement in a Heisenberg spin chain simulated in an NMR quantum computer. Phys. Rev. A 71:012307.
117. Yang X, Wang A, Xu F, Du J. 2006. Experimental simulation of a pairing Hamiltonian on an NMR quantum computer. Chem. Phys. Lett. 422:20-24.
118. Du J, Xu N, Wang P, Wu S, Lu D. 2010. NMR implementation of a molecular hydrogen quantum simulation with adiabatic state preparation. Phys. Rev. Lett. 104:030502.
119. Levi BG. 2009. Superconducting qubit systems come of age. Phys. Today 62:114-16.
120. You JQ, Nori F. 2005. Superconducting circuits and quantum information. Phys. Today 58:42-47. (Pubitemid 41541350)
121. Hofheinz M, Wang H, Ansmann M, Bialczak RC, Lucero E, et al. 2009. Synthesizing arbitrary quantum states in a superconducting resonator. Nature 459:546-49.
122. DiCarlo L, Chow JM, Gambetta JM, Bishop LS, Johnson BR, et al. 2009. Demonstration of two-qubit algorithms with a superconducting quantum processor. Nature 460:240-44.
123. Harris R, Johansson J, Berkley AJ, Johnson MW, Lanting T, et al. 2010. Experimental demonstration of a robust and scalable flux qubit. Phys. Rev. B 81:134510.
124. Johnson MW, Bunyk P, Maibaum F, Tolkacheva E, Berkley AJ, et al. 2010. A scalable control system for a superconducting adiabatic quantum optimization processor. Supercond. Sci. Technol. 23:065004.
125. Berkley AJ, Johnson MW, Bunyk P, Harris R, Johansson J, et al. 2009. A scalable readout system for a superconducting adiabatic quantum optimization system. arXiv:0905.0891.
126. Harris R, Johnson MW, Lanting T, Berkley AJ, Johansson J, et al. 2010. Experimental investigation of an eight qubit unit cell in a superconducting optimization processor. Phys. Rev. B 82:024511.
127. Harris R, Lanting T, Berkley AJ, Johansson J, Johnson MW, et al. 2009. Compound Josephson-junction coupler for flux qubits with minimal crosstalk. Phys. Rev. B 80:052506.
128. Lanting T, Harris R, Johansson J, Amin MHS, Berkley AJ, et al. 2010. Observation of co-tunneling in pairs of coupled flux qubits. arXiv:1006.0028.
129. Blatt R,Wineland D. 2008. Entangled states of trapped atomic ions. Nature 453:1008-15. (Pubitemid 351876983)
130. Cirac JI, Zoller P. 1995. Quantum computations with cold trapped ions. Phys. Rev. Lett. 74:4091-94.
131. Johanning M, Vaŕon AF,Wunderlich C. 2009. Quantum simulations with cold trapped ions. J. Phys. B 42:154009.
132. Friedenauer A, Schmitz H, Glueckert JT, Porras D, Schaetz T. 2008. Simulating a quantum magnet with trapped ions. Nat. Phys. 4:757-61.
133. Gerritsma R, Kirchmair G, Z̈ahringer F, Solano E, Blatt R, Roos CF. 2010. Quantum simulation of the Dirac equation. Nature 463:68-71.
134. Kim K, Chang MS, Korenblit S, Islam R, Edwards EE, et al. 2010. Quantum simulation of frustrated Ising spins with trapped ions. Nature 465:590-93.
135. Childs AM. 2009. Universal computation by quantum walk. Phys. Rev. Lett. 102:180501.
136. Lovett NB, Cooper S, Everitt M, Trevers M, Kendon V. 2010. Universal quantum computation using discrete time quantum walk. Phys. Rev. A 81:042330.
137. Clark CR, Metodi TS, Gasster SD, Brown KR. 2009. Resource requirements for fault-tolerant quantum simulation: the ground state of the transverse Ising model. Phys. Rev. A 79:062314.
138. Chan GKL, Dorando JJ, Ghosh D, Hachmann J, Neuscamman E, et al. 2008. An introduction to the density matrix renormalization group ansatz in quantum chemistry. Prog. Theor. Chem. Phys. 18:49-65.
139. Jacksch P, Papageorgiou A. 2003. Eigenvector approximation leading to exponential speedup of quantum eigenvalue calculation. Phys. Rev. Lett. 91:257902