Cited by 388Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity

Open access
Babbush, Ryan, Gidney, Craig, Berry, Dominic W., Wiebe, Nathan, McClean, Jarrod, Paler, Alexandru, Fowler, Austin, Neven, Hartmut·2018·Physical Review X

Abstract

We construct quantum circuits that exactly encode the spectra of correlated electron models up to errors from rotation synthesis.By invoking these circuits as oracles within the recently introduced "qubitization" framework, one can use quantum phase estimation to sample states in the Hamiltonian eigenbasis with optimal query complexity Oðλ=ϵÞ, where λ is an absolute sum of Hamiltonian coefficients and ϵ is the target precision.For both the Hubbard model and electronic structure Hamiltonian in a second quantized basis diagonalizing the Coulomb operator, our circuits have T-gate complexity O(N þ logð1=ϵÞ), where N is the number of orbitals in the basis.This scenario enables sampling in the eigenbasis of electronic structure Hamiltonians with T complexity O(N 3 =ϵ þ N 2 logð1=ϵÞ=ϵ).Compared to prior approaches, our algorithms are asymptotically more efficient in gate complexity and require fewer T gates near the classically intractable regime.Compiling to surface code fault-tolerant gates and assuming per-gate error rates of one part in a thousand reveals that one can error correct phase estimation on interesting instances of these problems beyond the current capabilities of classical methods using only about a million superconducting qubits in a matter of hours.

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/physrevx.8.041015

Cites

116 of 116 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?

  • Using Babbush et al.'s QROM read, each table lookup has a Toffoli count and measurement depth of 2^{c_mul+c_exp} and uses a negligible O(c_mul+c_exp) ancillae.

    “Using Babbush et al.'s QROM read (section 3A of [2]), each table lookup has a Toffoli count and measurement depth of 2 c mul + c exp and uses a negligible O ( c mul + c exp ) ancillae.”

    From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [2]

    Section III A describes L−1 AND computations for unary iteration and log L ancillae; Section III C applies that technique to QROM lookup. This supports linear lookup cost and logarithmic ancilla use when L = 2^(c_mul+c_exp). The copy gives a T-gate count of 4L−4, however, not the claimed exact Toffoli count or measurement depth. (LLM, conf=0.84)

    Experimental — accuracy not yet measured
  • Crosson et al. demonstrated that this effect is common even for instances that do not exhibit noticeable symmetries.

    “Crosson et al. 298 demonstrated that this effect is common even for instances that do not exhibit noticeable symmetries.”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [298]

  • It is not always necessary to reach the adiabatic regime to achieve a significant overlap with the ground state.

    “Note that it is not always necessary to reach the adiabatic regime to achieve a significant overlap with the ground state.”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [298]

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 118 references couldn’t be matched to a known paper.

Research works printed but not linked: 3

  1. C. Gidney and R. Babbush, Quantum Read-Only Memory for Implement Efficient Fault-Tolerant Quantum Oracles (in press).
  2. C. Gidney, R. Babbush, M. Mohseni, and H. Neven, Quantum Read-Only Memory for Implementing Efficient Fault-Tolerant Quantum Oracles (in press).
  3. R. Martin, Electronic Structure (Cambridge University Press, Cambridge, England, 2004).

Cited by

Sorted by citations

Authors
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H.
Affiliations
  • Google (United States) (US)
  • Macquarie University (AU)
  • Microsoft (United States) (US)
Venue
Physical Review X
Published
2018-10-23
Volume
8
Issue
4
ISSN
2160-3308 (ISSN-L)
OpenAlex
W2801305581
Cited by
383
References
118
Citations by year
2026: 45 · 2025: 82 · 2024: 52 · 2023: 49 · 2022: 43 · 2021: 41 · 2020: 35 · 2019: 32 · 2018: 4
FWCI
15.90
Type
journal article
Language
en
Open access
Locations
  • Physical Review X (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
Australian Research Council (DP160102426)
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 › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
quantum circuits, qubitization, quantum phase estimation, Hubbard model, superconducting qubits, query complexity, correlated electrons

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