Abstract
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can be applied only to small systems. By contrast, we demonstrate that quantum computers could exactly simulate chemical reactions in polynomial time. Our algorithm uses the split-operator approach and explicitly simulates all electron-nuclear and interelectronic interactions in quadratic time. Surprisingly, this treatment is not only more accurate than the Born–Oppenheimer approximation but faster and more efficient as well, for all reactions with more than about four atoms. This is the case even though the entire electronic wave function is propagated on a grid with appropriately short time steps. Although the preparation and measurement of arbitrary states on a quantum computer is inefficient, here we demonstrate how to prepare states of chemical interest efficiently. We also show how to efficiently obtain chemically relevant observables, such as state-to-state transition probabilities and thermal reaction rates. Quantum computers using these techniques could outperform current classical computers with 100 qubits.
References
42
Referenced
273
10.1063/1.463007
10.1063/1.1560636
10.1063/1.476142
10.1126/science.1104085
10.1063/1.1323746
10.1016/j.jphotochem.2007.05.015
10.1021/jp994174i
10.1146/annurev.physchem.57.032905.104612
10.1088/0953-4075/34/3/103
10.1103/PhysRevLett.94.063002
10.1126/science.286.5449.2474
10.1126/science.1120263
10.1007/BF02650179
10.1126/science.273.5278.1073
10.1098/rspa.1998.0162
- S Wiesner Simulations of many-body quantum systems by a quantum computer. arXiv:quant-ph/9603028. (1996).
10.1103/PhysRevE.59.2429
10.1126/science.1113479
- AM Steane, How to build a 300 bit, 1 giga-operation quantum computer. Quant Inf Comput 7, 171–183 (2007). / Quant Inf Comput / How to build a 300 bit, 1 giga-operation quantum computer by Steane AM (2007)
10.1016/0021-9991(82)90091-2
10.1016/0021-9991(83)90015-3
- D Coppersmith An approximate Fourier transform useful in quantum factoring. arXiv:quant-ph/0201067. (2002).
-
E Bernstein U Vazirani Quantum complexity theory. (Assoc for Comput Machinery New York) pp. 11–20 (1993).
(
10.1145/167088.167097
) 10.1007/s00220-006-0150-x
- DE Knuth Art of Computer Programming, Vol 2: Seminumerical Algorithms (Addison–Wesley, 3rd Ed., Boston, 1997). / Art of Computer Programming, Vol 2: Seminumerical Algorithms by Knuth DE (1997)
- MA Nielsen, IL Chuang Quantum Computation and Quantum Information (Cambridge Univ Press, 1st Ed., Cambridge, UK, 2000). / Quantum Computation and Quantum Information by Nielsen MA (2000)
10.1103/PhysRevE.73.036708
10.1063/1.471430
-
D Aharonov A Ta-Shma Adiabatic quantum state generation and statistical zero knowledge. (Assoc for Comput Machinery New York) pp. 20–29 (2003).
(
10.1145/780542.780546
) - L Grover T Rudolph Creating superpositions that correspond to efficiently integrable probability distributions. arXiv:quant-ph/0208112. (2002).
10.1103/PhysRevLett.79.2586
10.1103/PhysRevLett.83.5162
10.1103/PhysRevLett.97.170501
10.1126/science.1145699
10.1103/PhysRevLett.96.010401
- G Brassard P Hoyer M Mosca A Tapp Quantum amplitude amplification and estimation. arXiv:quant-ph/0005055. (2000).
10.1103/PhysRevA.75.012328
- DJ Tannor Introduction to Quantum Mechanics: A Time-Dependent Perspective (Univ Sci Books, Mill Valley, CA, 2007). / Introduction to Quantum Mechanics: A Time-Dependent Perspective by Tannor DJ (2007)
10.1063/1.460139
10.1103/RevModPhys.67.279
10.1063/1.2358137
10.1209/0295-5075/80/67008
Dates
Type | When |
---|---|
Created | 16 years, 9 months ago (Nov. 24, 2008, 9:56 p.m.) |
Deposited | 3 years, 4 months ago (April 12, 2022, 5:40 p.m.) |
Indexed | 4 days, 23 hours ago (Aug. 28, 2025, 8:10 a.m.) |
Issued | 16 years, 9 months ago (Dec. 2, 2008) |
Published | 16 years, 9 months ago (Dec. 2, 2008) |
Published Online | 16 years, 9 months ago (Dec. 2, 2008) |
Published Print | 16 years, 9 months ago (Dec. 2, 2008) |
@article{Kassal_2008, title={Polynomial-time quantum algorithm for the simulation of chemical dynamics}, volume={105}, ISSN={1091-6490}, url={http://dx.doi.org/10.1073/pnas.0808245105}, DOI={10.1073/pnas.0808245105}, number={48}, journal={Proceedings of the National Academy of Sciences}, publisher={Proceedings of the National Academy of Sciences}, author={Kassal, Ivan and Jordan, Stephen P. and Love, Peter J. and Mohseni, Masoud and Aspuru-Guzik, Alán}, year={2008}, month=dec, pages={18681–18686} }