Cited by 1,621Quantum Computing Algorithms and ArchitectureQuantum many-body systemsAdvanced Chemical Physics Studies

The DOI matches its Crossref record; 511 of the 511 references it cites were found in a registry or an index; none of the 313 sources its claims cite is checked for support yet.

Quantum computational chemistry

Open access
McArdle, Sam, Endo, Suguru, Aspuru-Guzik, Alán, Benjamin, Simon C., Yuan, Xiao·2020·Reviews of Modern Physics

Abstract

With small quantum computers becoming a reality, first applications are eagerly sought. Quantum chemistry presents a spectrum of computational problems, from relatively easy to classically intractable. Algorithms for the easiest of these have been run on the first quantum computers. But an urgent question is, how well will these algorithms scale to go beyond what is possible classically? This review presents strategies employed to construct quantum algorithms for quantum chemistry, with the goal that quantum computers will eventually answer presently inaccessible questions, for example, in transition metal catalysis or important biochemical reactions.

Overview

AI snapshot

Written from the paper’s full text.

TL;DR

This review provides a comprehensive introduction to quantum computational chemistry, bridging classical electronic structure methods and quantum algorithms for chemistry. It focuses on near-term variational algorithms with error mitigation and longer-term quantum phase estimation with error correction, and concludes that fault-tolerant chemistry simulations still require far more resources than current hardware.

Key findings

  • Quantum computers can store the full configuration interaction wavefunction of M spin-orbitals using only M qubits in second quantisation, whereas classical FCI scales exponentially; the review identifies strongly correlated systems around 100–200 spin-orbitals as a target “sweet spot” for quantum advantage.
  • For fault-tolerant phase estimation, resource estimates cited include FeMo-co (54 electrons, 108 spin-orbitals) requiring ~10^14 T gates and ~200 million physical qubits, running weeks/months; a later qubitization/low-rank approach for 113 electrons in 152 spin-orbitals reduced this to ~10^11 Toffoli gates and ~1 million physical qubits for 2 months.
  • Condensed-phase/Fermi-Hubbard estimates are lower: ~2×10^8 T gates for a 128 spin-orbital 3D homogeneous electron gas and ~7.1×10^8 T gates for a 100-site 2D Fermi-Hubbard model, corresponding to ~2–3 million qubits for tens of hours; another Trotter estimate gives ~10^6 Toffoli and 10^7–10^8 T gates and ~400,000–600,000 physical qubits for a couple of hours.
  • VQE measurement cost scales as O(M^6/ε^2) in a Gaussian orbital basis and O(M^4/ε^2) in a plane wave dual basis; UCCSD gate counts are O(M^3 N^2) with Jordan-Wigner, improved to O(M^3 N) with swap networks or O(M^3)–O(M^4) with low-rank decomposition.

Methods

  • Design: narrative review, not a primary experimental or numerical study; it synthesizes classical computational chemistry (HF, MCSCF, CI, CC, basis sets, active-space reduction) and quantum computing (qubit encodings, Hamiltonian simulation, phase estimation, VQE, error mitigation).
  • Data/sample: illustrative worked examples map H2 in STO-3G, 6-31G, and cc-PVDZ bases and LiH in STO-3G onto qubits, using Jordan-Wigner, Bravyi-Kitaev, and BK-tree mappings, natural molecular orbital active-space reduction, symmetry qubit removal, and UCCSD.
  • Main analysis: qualitative and asymptotic resource comparisons between classical and quantum methods, with cited gate/qubit estimates for fault-tolerant and near-term algorithms.

Limitations

  • The paper states that the field has grown beyond a single review and that it excludes complementary directions such as quantum machine learning for electronic structure, problem-decomposition approaches, hybrid DFT, relativistic quantum chemistry, molecular vibrations, analog simulators, quantum annealers, and non-Hermitian eigenvalue algorithms.
  • The paper states that resource estimates depend on assumptions about hardware, error rates, error-correcting code, and fault-tolerance protocols; Trotter error bounds are believed loose by several orders of magnitude, and it is not yet possible to conclusively state which Hamiltonian simulation method will perform best.
  • Evident from the text: as a review, it reports no new primary data or experimental results; its numerical resource figures are cited from prior works and are conditional on the stated error-correction and surface-code assumptions.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1103/revmodphys.92.015003

Cites

511 of 511 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 of 313 cited sources checked · 0 supported · 0 flagged

Show all 227 claims

  • It may state two separate claims as one. 130
  • Probably not a substantial claim. 148
  • The quote only partly states this claim. 2
240 of 240
  • The paper relies on this without support.

    Using quantum systems as our simulation platform will enable us to tackle classically intractable problems in chemistry, physics, and materials science.

    “It is believed that using quantum systems as our simulation platform will enable us to tackle classically intractable problems in chemistry, physics, and materials science.”
  • The paper relies on this without support.

    Quantum computers will enable a more accurate understanding of the models in use today, as well as the ability to simulate more complex (and therefore, more realistic) models.

    “As quantum computers are able to efficiently simulate quantum systems, it is believed that they will enable a more accurate understanding of the models in use today, as well as the ability to simulate more complex (and therefore, more realistic) models.”
  • The paper relies on this without support.

    The electronic structure problem is a fundamental one in classical computational chemistry.

    “Primarily, this problem is a fundamental one in classical computational chemistry.”
  • The paper relies on this without support.

    Digital quantum simulation is more vulnerable to noise and device imperfections than analog simulation.

    “Digital quantum simulation is more vulnerable to noise and device imperfections than analog simulation.”
  • The paper relies on this without support.

    Many systems of commercial and scientific interest, such as catalysts and high temperature superconductors, are strongly correlated.

    “Many systems of commercial and scientific interest, such as catalysts and high temperature superconductors, are believed to be strongly correlated.”
  • The paper relies on this without support.

    High temperature superconductors are strongly correlated systems.

    “High temperature superconductors are also believed to be strongly correlated systems.”
  • The paper relies on this without support.

    Current quantum computers possess only tens of error-prone physical qubits.

    “In contrast to the large error corrected machines described above, current quantum computers possess only tens of error-prone physical qubits.”
  • The authors state this as an assumption.

    In order to isolate errors arising from the method used, the authors assume they are working in the full molecular orbital basis for the molecule.

    “In order to isolate the errors arising from the method used, we assume that we are working in the full molecular orbital basis for our molecule, although in practice this would be classically intractable for large system sizes”
  • The authors state this as an assumption.

    In the following section, the authors assume they include all possible determinants that a limited number of molecular orbitals can generate, unless explicitly stated.

    “we consider only a limited number of molecular orbitals, but assume that we include all possible determinants that they can generate, unless explicitly stated.”
  • The paper relies on this without support.

    Second quantised basis set methods are the most widely used approach in classical computational chemistry and have formed the basis of most work so far in quantum computational chemistry.

    “Second quantised basis set methods are the most widely used approach in classical computational chemistry, and have formed the basis of most of the work done so far in quantum computational chemistry.”
  • The paper relies on this without support.

    The second quantised grid based method has not yet been used in any classical or quantum computational chemistry algorithms.

    “As discussed above, this second quantised grid based method has not yet (to the best of our knowledge) been used in any classical or quantum computational chemistry algorithms.”
  • The authors state this as an assumption.

    Assuming fairly local interactions for a molecule, the degree of the graph will be less than the number of vertices.

    “Assuming fairly local interactions for a molecule, the degree of the graph will be less than the number of vertices.”
  • The paper relies on this without support.

    For non-relativistic molecules, the total number of electrons and the total s_z value are conserved by the Hamiltonian.

    “For non-relativistic molecules, the total number electrons and the total s z value are conserved.”
    “As the electron number and total s z value are conserved by the Hamiltonian, these qubits are only acted on by the identity or Pauli Z operators.”
  • The paper relies on this without support.

    It is classically intractable to store the required P^{3N} × 2^N = 2^{(3m+1)N} complex amplitudes for large quantum systems.

    “While it is classically intractable to store the required P 3 N × 2 N = 2 (3 m +1) N complex amplitudes for large quantum systems, it is possible using a quantum computer.”
  • The paper relies on this without support.

    Near-term quantum computers will not have enough physical qubits for error correction.

    “As near-term quantum computers will not have enough physical qubits for error correction”
  • The authors state this as an assumption.

    The methods discussed above require fault-tolerance.

    “As a result, these methods are typically assumed to require fault-tolerance.”
  • The authors state this as an assumption.

    A single Trotter step can be used to implement the UCC operator.

    “These gate counts assume that a single Trotter step can be used to implement the UCC operator, which has previously been shown to yield accurate results (Barkoutsos et al. , 2018; Romero et al. , 2019).”
  • The authors state this as an assumption.

    Low-lying excited states differ from the ground state by a small number of excitations.

    “This is designed to target the low-lying excited states, which are assumed to differ from the ground state by a small number of excitations.”
  • The authors state this as an assumption.

    The ansatz is composed of S layers.

    “We assume that the ansatz is composed of S layers.”
  • The authors state this as an assumption.

    The fourth orbital in the LiH NMO 1-RDM is never occupied.

    “we assume that this orbital is never occupied”
  • The paper relies on this without support.

    When the error rate is low, terms resulting from many errors are negligibly small.

    “If the error rate is low, then the other terms can be considered negligibly small.”
  • The authors state this as an assumption.

    The system is prepared in an initial state that has a sufficiently large overlap with the true ground state.

    “All of the resource estimation papers above focus on the cost of phase estimation, and assume that the system is prepared in an initial state that has a sufficiently large overlap with the true ground state.”
  • The paper relies on this without support.

    Current quantum computers possess only around 100 physical qubits, and a fully protected logical qubit has not yet been demonstrated.

    “Current quantum computers possess only around 100 physical qubits, and we have yet to demonstrate a fully protected logical qubit.”
  • The paper relies on this without support.

    The use of error correcting codes is complicated by the difficulty of producing error protected T gates.

    “Nevertheless, the use of error correcting codes is complicated by the difficulty of producing error protected T gates.”
  • The paper relies on this without support.

    Synthesizing an arbitrary angle rotation gate can require at least 10 to 100 T gates.

    “Moreover, synthesizing an arbitrary angle rotation gate can require at least 10 to 100 T gates.”
  • The paper relies on this without support.

    For many of the molecules in the G1 set, an FCI calculation on a sufficiently accurate basis set would be classically intractable.

    “For many of the molecules in the G1 set, an FCI calculation on a sufficiently accurate basis set would be classically intractable (although they are typically not necessary due to highly accurate approximate methods and experimental results).”
26 of 26

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?

Citations

Cites

Flagged first, then by citations

Show all 415 references

Research works printed but not linked: 12

  1. Berry, D. W., 2014, Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing (STOC ’14)
  2. Berry, D. W., 2015, Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), Berkeley, CA
  3. 10.5555/2481569.2481570 · DOI
  4. Coppersmith, D., 1994, IBM
  5. 10.5555/2685188.2685189 · DOI
  6. Malik, M. R., 2012, NASA
  7. 10.1103/physrevresearch.1.013129 · DOI
  8. 10.5555/2871401.2871402 · DOI
  9. Shor, P. W., 1994, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Sante Fe
  10. Shor, P. W., 1996, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT
  11. 10.5555/2600508.2600515 · DOI
  12. Yamada, S., 2005, Proceedings of the 2005 ACM/IEEE Conference on Supercomputing (SC ’05), Seattle

Cited by

Sorted by citations

Items 801–900 of 1,006

Metadata

Authors
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X.
Affiliations
University of Oxford (GB)
Venue
Reviews of Modern Physics
Published
2020-03-30
Volume
92
Issue
1
ISSN
  • 0034-6861 (ISSN-L)
  • 1539-0756
OpenAlex
W2889126882
Cited by
1,621
References
415
Citations by year
2026: 197 · 2025: 316 · 2024: 305 · 2023: 273 · 2022: 216 · 2021: 212 · 2020: 84
FWCI
77.29
Type
journal article
Language
en
Open access
Locations
  • Reviews of Modern Physics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Engineering and Physical Sciences Research Council (EP/M013243/1)
  • U.S. Department of Defense
  • Japan Student Services Organization
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 algorithms, quantum chemistry, quantum computing, algorithm design, scalability, transition metal catalysis, biochemical reactions, quantum simulation

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.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

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