Cited by 123Quantum Computing Algorithms and ArchitectureQuantum many-body systemsAdvanced Chemical Physics Studies

Fault-tolerant quantum simulations of chemistry in first quantization

Open access
Su, Yuan, Berry, Dominic W., Wiebe, Nathan, Rubin, Nicholas, Babbush, Ryan·2021·PRX Quantum

Abstract

The future is first-quantized: A complete cost analysis of quantum algorithms adapted to first quantization shows that the approach is unrivaled for high accuracy simulations of solid-state materials and certain chemical compounds.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/prxquantum.2.040332

Cites

114 of 114 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • QC methods formulated using real-space 3D grids or plane waves 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.

    “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.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

2 of the 116 references couldn’t be matched to a known paper.

Research works printed but not linked: 10

  1. Matthew B. Hastings, Dave Wecker, Bela Bauer, and Matthias Troyer, Improving quantum algorithms for quan- tum chemistry, Quantum Inf. Comput. 15, 1 (2015).
  2. Richard M. Martin, Electronic Structure (Cambridge Uni- versity Press, Cambridge, U.K., 2004).
  3. Andrew M. Childs and Nathan Wiebe, Hamiltonian sim- ulation using linear combinations of unitary operations, Quantum Inf. Comput. 12, 901 (2012).
  4. Mario Szegedy, in 45th Annual IEEE Symposium on Foundations of Computer Science (IEEE, 2004), p. 32.
  5. Dominic W. Berry, Richard Cleve, and Sevag Gharib- ian, Gate-efficient discrete simulations of continuous-time quantum query algorithms, Quantum Inf. Comput. 14, 0001 (2014).
  6. Michael Codish, Luís Cruz-Filipe, Michael Frank, and Peter Schneider-Kamp, in 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (2014), p. 186.
  7. Richard Cleve and John Watrous, in Proceedings 41st Annual Symposium on Foundations of Computer Science (IEEE, 2000), p. 526.
  8. Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma, in STOC '14 Pro- ceedings of the 46th Annual ACM Symposium on Theory of Computing (2014), p. 283.
  9. Mathias Soeken, Martin Roetteler, Nathan Wiebe, and Giovanni De Micheli, in 2017 54th ACM/EDAC/IEEE Design Automation Conference (DAC) (IEEE, 2017), p. 1.
  10. Bill Poirier and Jonathan Jerke, Full-Dimensional Schrödinger Wavefunction Calculations using Tensors and Quantum Computers: the Cartesian component- separated approach, arXiv:2105.03787 (2021). · arXiv

Cited by

Sorted by citations

Authors
Su, Y., Berry, D. W., Wiebe, N., Rubin, N., & Babbush, R.
Affiliations
  • California Institute of Technology (US)
  • Macquarie University (AU)
  • Google (United States) (US)
Venue
PRX Quantum
Published
2021-11-11
Volume
2
Issue
4
ISSN
2691-3399 (ISSN-L)
OpenAlex
W3165437982
Cited by
123
References
116
Citations by year
2026: 28 · 2025: 29 · 2024: 22 · 2023: 20 · 2022: 19 · 2021: 4 · 2020: 1
FWCI
5.74
Type
journal article
Language
en
Open access
Locations
  • PRX Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
  • Australian Research Council (DP190102633, DP210101367)
  • US Department of Energy
  • Office of Science (DE-SC0012704)
  • National Science Foundation (1839204)
  • Quantum Information (PHY-1733907)
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
first quantization, fault tolerance, quantum algorithms, cost analysis, solid-state materials, chemical compounds, quantum chemistry

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