The DOI matches its Crossref record; 92 of the 92 references it cites were found in a registry or an index.
Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
Open accessAbstract
Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized implementations of Trotter-Suzuki-based product formulas. We show that low-order Trotter methods perform surprisingly well when used with phase estimation to compute relative precision quantities (e.g. energies per unit cell), as is often the goal for condensed-phase systems. In this context, simulations of the Hubbard and plane-wave electronic structure models with N < 10 5 fermionic modes can be performed with roughly O ( 1 ) and O ( N 2 ) T complexities. We perform numerics revealing tradeoffs between the error and gate complexity of a Trotter step; e.g., we show that split-operator techniques have less Trotter error than popular alternatives. By compiling to surface code fault-tolerant gates and assuming error rates of one part per thousand, we show that one can error-correct quantum simulations of interesting, classically intractable instances with a few hundred thousand physical qubits.
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
“Both results use interaction picture simulations 197 and plane wave basis and achieve O ( N 11 / 3 ) and O ( η log N ) complexities.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [198]
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 [12]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
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 [12]
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 [12]
Experimental — accuracy not yet measuredIn the citing paper
“A similar technique has also been applied in quantum chemistry 198 to produce the first quantum simulation algorithm of cost scaling sublinearly in the number of basis functions.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [198]
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
Bardeen, J., Cooper, L. N., & Schrieffer, J. R. (1957) · Physical Review · doi:10.1103/physrev.108.1175 · Cited by 13,213
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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
Doping a Mott insulator: Physics of high-temperature superconductivity
Lee, P. A., Nagaosa, N., & Wen, X.-G. (2006) · Reviews of Modern Physics · doi:10.1103/revmodphys.78.17 · Cited by 4,506
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“While the dynamics of many such systems appear intractable for classical computers, quantum computers were originally introduced as universal simulators capable of efficient quantum dynamical simulation [1, 2].”
BackgroundSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 2×
“This is 100 times slower than has been previously assumed [48], as recent (unpublished) research suggests that it will be challenging to achieve even this level of performance.”
BackgroundResultSelf-citation�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597 · cited 1×
“Mapping to qubits under the Jordan-Wigner transformation [62, 63], Eq.”
MethodOn the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282 · cited 2×
“[10] Hale F Trotter, “On the product of semi-groups of operators,” Proceedings of the American Mathematical Society 10, 545–551 (1959).”
BackgroundP y SCF: the Python‐based simulations of chemistry framework
Sun, Q., Berkelbach, T. C., Blunt, N. S., Booth, G. H., Guo, S., Li, Z., Liu, J., McClain, J. D., Sayfutyarova, E. R., Sharma, S., et al. (2018) · WIREs Computational Molecular Science · doi:10.1002/wcms.1340 · Cited by 1,741
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Self-citation
Research works printed but not linked: 6
- A. Y. Kitaev, arXiv preprint arXiv:9511026 (1995).
- D. Poulin, M. B. Hastings, D. Wecker, N. Wiebe, A. C. Doherty, and M. Troyer, Quantum Info. Comput. 15, 361 (2015). · doi:10.5555/2871401.2871402
- M. B. Hastings, D. Wecker, B. Bauer, and M. Troyer, Quantum Info. Comput. 15, 1 (2015). · doi:10.5555/2685188.2685189
- M. Motta, E. Ye, J. R. McClean, Z. Li, A. J. Minnich, R. Babbush, and G. K.-L. Chan, arXiv preprint arXiv:1808.02625 (2018). · arXiv
- A. M. Childs and N. Wiebe, Quantum Info. Comput. 12, 901 (2012). · doi:10.5555/2481569.2481570
- J. E. Savage, Models of computation, Vol. 136 (Addison-Wesley Reading, MA, 1998).
Cited by
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
Self-citationQuantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Self-citationSuppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
“These applications often require billions of quantum operations [9–11] while state-of-the-art quantum processors typically have error rates around 10 − 3 per gate [12–17], far too high to execute such large circuits.”
Self-citationThe Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
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
Metadata
- Authors
- Kivlichan, I. D., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Sun, W., Jiang, Z., Rubin, N., Fowler, A., Aspuru-Guzik, A., Neven, H., & Babbush, R.
- Affiliations
- Google (United States) (US)
- Macquarie University (AU)
- University of Washington (US)
- Google Research, Venice, CA 90291, USA
- Department of Chemistry, University of Toronto, Toronto, Ontario M5G 1Z8, Canada
- ORCID
- Venue
- Quantum
- Published
- 2020-07-16
- Volume
- 4
- Pages
- 296
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2923595161
- Cited by
- 173
- References
- 92
- Citations by year
- 2026: 18 · 2025: 32 · 2024: 19 · 2023: 25 · 2022: 29 · 2021: 25 · 2020: 19
- FWCI
- 9.54
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- 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 › Cold Atom Physics and Bose-Einstein Condensates
- Keywords
- correlated electrons, condensed systems, Trotterization, product formula, phase estimation, Hubbard model, operator splitting, Trotter error, gate complexity, surface code, error correction, 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization. https://app.cochat.ai/papers/10.22331/q-2020-07-16-296
- The paper
- Kivlichan, I. D., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Sun, W., Jiang, Z., Rubin, N., Fowler, A., Aspuru-Guzik, A., Neven, H., & Babbush, R. (2020). Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization. Quantum. https://doi.org/10.22331/q-2020-07-16-296
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.