CoChat

Exponentially more precise quantum simulation of fermions in second quantization

Open access
Babbush, Ryan, Berry, Dominic W, Kivlichan, Ian D, Wei, Annie Y, Love, Peter J, Aspuru-Guzik, Alán · 2016 · New Journal of Physics

The DOI matches its Crossref record; 47 of the 49 references it cites were found in a registry or an index.

Abstract

We introduce novel algorithms for the quantum simulation of fermionic systems which are dramatically more efficient than those based on the Lie–Trotter–Suzuki decomposition. We present the first application of a general technique for simulating Hamiltonian evolution using a truncated Taylor series to obtain logarithmic scaling with the inverse of the desired precision. The key difficulty in applying algorithms for general sparse Hamiltonian simulation to fermionic simulation is that a query, corresponding to computation of an entry of the Hamiltonian, is costly to compute. This means that the gate complexity would be much higher than quantified by the query complexity. We solve this problem with a novel quantum algorithm for on-the-fly computation of integrals that is exponentially faster than classical sampling. While the approaches presented here are readily applicable to a wide class of fermionic models, we focus on quantum chemistry simulation in second quantization, perhaps the most studied application of Hamiltonian simulation. Our central result is an algorithm for simulating an N spin–orbital system that requires O ~ ( N 5 t ) gates. This approach is exponentially faster in the inverse precision and at least cubically faster in N than all previous approaches to chemistry simulation in the literature.

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.

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

Integrity signals

Registry

Crossref · 10.1088/1367-2630/18/3/033032

Cites

47 of 47 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Thecircuit for PREPARE ( ) b as described in equation ( 33 ) . An expression for k q is given in equation ( 35 ) . W PREPARE ( ) is implemented using a precomputed classical database.
Figure 1 Thecircuit for PREPARE ( ) b as described in equation ( 33 ) . An expression for k q is given in equation ( 35 ) . W PREPARE ( ) is implemented using a precomputed classical database.CC-BY · From the PDF
Figure 2 Thecircuit implementing  . The oval indicates the control register for V SELECT ( ) .
Figure 2 Thecircuit implementing  . The oval indicates the control register for V SELECT ( ) .CC-BY · From the PDF
Figure 3 Anoracle which returns the value of a particular basis function at a particular position z  depending on the state of an ancilla register j ∣ ñ which selects the oracle. Here j is represented in binary, where j 1 refers to the fi rst bit of j , and j 2 refers to the second bit of j . This example is only valid when there are four basis functions.
Figure 3 Anoracle which returns the value of a particular basis function at a particular position z  depending on the state of an ancilla register j ∣ ñ which selects the oracle. Here j is represented in binary, where j 1 refers to the fi rst bit of j , and j 2 refers to the second bit of j . This example is only valid when there are four basis functions.CC-BY · From the PDF
Image 4
CC-BY · From the PDF

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.

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?

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

Show all 47 references

Research works printed but not linked: 3

  1. Berry D W, Ahokas G, Cleve R and Sanders B C 2007 Commun. Math. Phys. 270 359 · DOI · Paper page
  2. Abrams D S and Williams C P 1999 arXiv:quant-ph/9908083 · arXiv
  3. Grover L K 1996 Proc. 28th Annual ACM Symp. on Theory of Computing (STOC '96 ACM) (New York, NY, USA) pp 212-9

Cited by

See all 171

Metadata

Authors
Babbush, R., Berry, D. W., Kivlichan, I. D., Wei, A. Y., Love, P. J., & Aspuru-Guzik, A.
Affiliations
  • Google (United States) (US)
  • Macquarie University (AU)
  • Harvard University (US)
  • Tufts University (US)
Venue
New Journal of Physics
Published
2016-03-24
Volume
18
Issue
3
Pages
033032
ISSN
1367-2630 (ISSN-L)
OpenAlex
W3101201397
Cited by
135
References
49
Citations by year
2026: 4 · 2025: 8 · 2024: 12 · 2023: 14 · 2022: 9 · 2021: 18 · 2020: 13 · 2019: 14 · 2018: 23 · 2017: 9 · 2016: 10
FWCI
15.34
Type
journal article
Language
en
Open access
Licence
Locations
  • New Journal of Physics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (PHY-0955518)
  • Air Force Office of Scientific Research (FA9550-12-1-0046)
  • Australian Research Council (FT100100761)
  • Discovery Project (DP160102426)
  • Office of Naval Research (N00014-16-1-2008)
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 › Quantum Mechanics and Applications
Keywords
Hamiltonian simulation, second quantization, truncated Taylor series, quantum chemistry simulation, gate complexity, query complexity

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: Exponentially more precise quantum simulation of fermions in second quantization. https://app.cochat.ai/papers/10.1088/1367-2630/18/3/033032
The paper
Babbush, R., Berry, D. W., Kivlichan, I. D., Wei, A. Y., Love, P. J., & Aspuru-Guzik, A. (2016). Exponentially more precise quantum simulation of fermions in second quantization. New Journal of Physics. https://doi.org/10.1088/1367-2630/18/3/033032

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.