Polynomial-time quantum algorithm for the simulation of chemical dynamics
Open accessThe DOI matches its Crossref record; 45 of the 47 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“QC methods formulated using real-space 3D grids [124] or plane waves [125] as single-particle basis sets are able to simulate the total molecular wavefunction (including both the electronic and nuclear degrees of freedom) and its time evolution.”
From Quantum computing algorithms: getting closer to critical problems in computational biology (2022) · cites this paper as [124]
In the citing paper
“Variationally optimized coupled cluster 84 overcomes this problem but can only be applied to small systems 85-87 or models with a reduced parameter space 88 on a classical computer.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [88]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Solution of the Schrödinger equation by a spectral method
Feit, M. D., Fleck, J. A., & Steiger, A. (1982) · Journal of Computational Physics · doi:10.1016/0021-9991(82)90091-2 · Cited by 3,368 · cited 1×
“The split operator method (15, 20, 21) computes the time evolution by separating the kinetic T̂ and potential V̂ energy contributions to the propagator Û(t) e iĤt.”
MethodQuantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“Lloyd (14) subsequently showed that quantum computers could be used to simulate systems that can be formulated in terms of local interactions, by using resources that scale only polynomially with system size.”
BackgroundPath integrals in the theory of condensed helium
Ceperley, D. M. (1995) · Reviews of Modern Physics · doi:10.1103/revmodphys.67.279 · Cited by 2,470 · cited 1×
“Quantum computers also offer the promise of predicting real-time properties of superfluids (39, 40) and of providing tests for effective potentials for water phases (41).”
BackgroundGiovannetti, V., Lloyd, S., & Maccone, L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.010401 · Cited by 2,440
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Research works printed but not linked: 1
- D. J. Tannor, Introduction to Quantum Mechanics: A TimeDependent Perspective (University Science Books, 2007).
Cited by
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Self-citationQuantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Self-citationQuantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
“er transform (FFFT). This trick can be used to measure the kinetic operator. Correspondingly, the number of measurements can be bounded as301: m2O hV 2i+ hT2i 2 O 10=3N=3 + 2=3N4=3 ; (75) where is the number of electrons in the system, and Trepresents the kinetic energy terms of the Hamiltonian in Equation 44. This bo…”
BackgroundSelf-citationThe Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Metadata
- Authors
- Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A.
- Affiliations
- Harvard University (US)
- Massachusetts Institute of Technology (US)
- Haverford College (US)
- Department of Chemistry and Chemical Biology, Harvard University, Cambridge, MA 02138;
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2008-12-02
- Volume
- 105
- Issue
- 48
- Pages
- 18681-18686
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC2596249
- OpenAlex
- W1998217267
- Cited by
- 385
- References
- 47
- Citations by year
- 2026: 24 · 2025: 32 · 2024: 27 · 2023: 58 · 2022: 30 · 2021: 28 · 2020: 23 · 2019: 17 · 2018: 17 · 2017: 14 · 2016: 12 · 2015: 16 · 2014: 24 · 2013: 10 · 2012: 19
- FWCI
- 17.94
- Type
- journal article
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
- arXiv (Cornell University)
- Funders
- Army Research Office (W911NF)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Keywords
- quantum simulation, reaction dynamics, operator splitting, electron-nucleus interaction, interelectronic interaction, Born-Oppenheimer approximation, state-to-state transition probabilities, quantum state preparation
- MeSH terms
- Algorithms, Chemistry, Physical, Computer Simulation, Models, Chemical, Quantum Theory
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Polynomial-time quantum algorithm for the simulation of chemical dynamics. https://app.cochat.ai/papers/10.1073/pnas.0808245105
- The paper
- Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A. (2008). Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.0808245105
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.