Early fault-tolerant simulations of the Hubbard model
Open accessThe DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Abstract
Simulation of the Hubbard model is a leading candidate for the first useful applications of a fault-tolerant quantum computer. A recent study of quantum algorithms for early simulations of the Hubbard model [Kivlichan et al 2019 Quantum 4 296] found that the lowest resource costs were achieved by split-operator Trotterization combined with the fast-fermionic Fourier transform (FFFT) on an L × L lattice with length L = 2 k . On lattices with length L ≠ 2 k , Givens rotations can be used instead of the FFFT but lead to considerably higher resource costs. We present a new analytic approach to bounding the simulation error due to Trotterization that provides much tighter bounds for the split-operator FFFT method, leading to 16× improvement in error bounds. Furthermore, we introduce plaquette Trotterization that works on any size lattice and apply our improved error bound analysis to show competitive resource costs. We consider a phase estimation task and show plaquette Trotterization reduces the number of non-Clifford gates by a factor 5.5× to 9× (depending on the parameter regime) over the best previous estimates for 8 × 8 and 16 × 16 lattices and a much larger factor for other lattice sizes not of the form L = 2 k . In conclusion, we find there is a potentially useful application for fault-tolerant quantum computers using around one million Toffoli gates.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Although this logical error per cycle might permit certain fault-tolerant applications11, it is still many orders of magnitude higher than expected and precludes larger fault-tolerant circuits12,21.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [11]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“State-of-the-art many-qubit platforms have only recently demonstrated entangling gates with 99.9% fidelity9,10, far short of the <10−10 error rates needed for many applications11,12.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [11]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“For example, reducing physical error rates by a factor of two would improve the distance-27 logical performance by four orders of magnitude, well into algorithmically relevant error rates11,12.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [11]
Experimental — accuracy not yet measured
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
Electron correlations in narrow energy bands
Hubbard, J. (1963) · Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences · doi:10.1098/rspa.1963.0204 · Cited by 6,699
Quantum 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 · cited 1×
“This can be especially attractive for N -qubit quantum chemistry Hamiltonians with O ( N 4 ) terms [32], but Hubbard model Hamiltonians are very sparse with only O ( N ) local terms, and only 2 Hamiltonian terms when grouped into interaction and hopping terms.”
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · cited 1×
“Kivlichan et al [8] considered estimation of the ground state energy of the Hubbard TDL using phase estimation [9, 10] and second-order Trotter formulae.”
MethodHamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
Suzuki, M. (1990) · Physics Letters A · doi:10.1016/0375-9601(90)90962-n · Cited by 853
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
Abrams, D. S., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5162 · Cited by 817 · cited 1×
“Kivlichan et al [8] considered estimation of the ground state energy of the Hubbard TDL using phase estimation [9, 10] and second-order Trotter formulae.”
MethodOptimal Hamiltonian Simulation by Quantum Signal Processing
Low, G. H., & Chuang, I. L. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.010501 · Cited by 769
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745
Cited by
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“9% fidelity entangling gates [9, 10], far short of the 10 − 10 error rates needed for many applications [11, 12].”
InfluentialHeisenberg-Limited Ground-State Energy Estimation for Early Fault-Tolerant Quantum Computers
Lin, L., & Tong, Y. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010318 · Cited by 176
Dong, Y., Lin, L., & Tong, Y. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040305 · Cited by 298
Quantum Computing 40 Years Later
Preskill, J. P. (2023) · CRC Press eBooks · doi:10.1201/9781003358817-7 · Cited by 188
Early Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103
“12 · 10 9 , 𝛽 = 0 .”
BackgroundMethodInfluential
Metadata
- Authors
- Campbell, E. T.
- Affiliations
- Amazon (United States) (US)
- Corresponding author
- Campbell, Earl T
- ORCID
- Campbell, Earl T
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2021-11-18
- Volume
- 7
- Issue
- 1
- Pages
- 015007
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W3110956917
- Cited by
- 81
- References
- 55
- Citations by year
- 2026: 16 · 2025: 27 · 2024: 13 · 2023: 11 · 2022: 11 · 2021: 2
- FWCI
- 3.27
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- Locations
- Quantum Science and Technology (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- 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 Information and Cryptography
- Keywords
- Hubbard model, fault-tolerant quantum computing, quantum simulation, Givens rotations, phase estimation, Toffoli gate
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: Early fault-tolerant simulations of the Hubbard model. https://app.cochat.ai/papers/10.1088/2058-9565/ac3110
- The paper
- Campbell, E. T. (2022). Early fault-tolerant simulations of the Hubbard model. Quantum Science and Technology. https://doi.org/10.1088/2058-9565/ac3110
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.