Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
Open accessThe DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Abstract
A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits that exceed the capabilities of exact classical simulation. We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment and can also be systematically converged beyond the experimental accuracy. Our most accurate technique combines a mixed Schrödinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propagation to compute expectation values with an effective wave function–operator sandwich bond dimension >16,000,000, achieving an absolute accuracy, without extrapolation, in the observables of <0.01, which is converged for many practical purposes. We thereby identify inaccuracies in the experimental extrapolations and suggest how future experiments can be implemented to increase the classical hardness.
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
Figures


![Fig. 3. Expectation values of the quantum circuit in Eq. 1. (A) Magnetization; (B) X{3}Y{2}Z{5} ≡ X13,29,31Y9,30Z8,12,17,28,32; (C) X{8}Y{1}Z{8} ≡ X37,41,52,56,57,58,62,79Y75Z38,40,42,63,72,80,90,91, all after five steps; (D) X{8}Y{8}Z{1} ≡ X37,41,52,56,57,58,62,79Y38,40,42,63,72,80,90,91Z75 for a five-step circuit with an additional X-rotation layer, and (E) 〈Z62〉 after 20 steps. The results presented include the exact benchmarks calculated using TN contraction [“Exact,” (A) to (D)], SPD results obtained within on average 10 s per point on a single core of a laptop computer (“SPD 10s”), MIX TN results on a single GPU under 3 min (“MIX 3 min”), and the zero-noise extrapolated quantum experiment (“Quantum”) of (8). All data apart from the quantum simulations were computed at θh between zero and π/2 in increments of π/32. Thresholds used for the SPD simulations are reported in table S1.](https://figures.cochat.ai/paper-figures/88de39cd94494e9398fb9ed2269fb5b0/fast-and-converged-classical-simulations-of-evidence-for-the-utility-of-quantum-figure-3.jpg)







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.
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
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“For example, Clifford-based approaches (20–24), can treat circuits with large numbers of qubits and highly entangled states as long as there is only a small number of non-Clifford gates.”
Error Mitigation for Short-Depth Quantum Circuits
Temme, K., Bravyi, S., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180509 · Cited by 1,379 · cited 1×
“Using zero-noise extrapolation (9) of the experimental data, Ref.”
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor
Wu, Y., Bao, W.-S., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180501 · Cited by 1,059
Evidence for the utility of quantum computing before fault tolerance
Kim, Y., Eddins, A., Anand, S., Wei, K. X., van den Berg, E., Rosenblatt, S., Nayfeh, H., Wu, Y., Zaletel, M., Temme, K., et al. (2023) · Nature · doi:10.1038/s41586-023-06096-3 · Cited by 1,050 · cited 8×
“A recent quantum experiment of this kind simulated the kicked Ising model on IBM’s 127-qubit processor (8).”
InfluentialSimulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Accurate Determination of Tensor Network State of Quantum Lattice Models in Two Dimensions
Jiang, H. C., Weng, Z. Y., & Xiang, T. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.090603 · Cited by 464 · cited 2×
“(We note that recently, other related Pauli-based approaches have been proposed, with truncation based on Fourier expansion or Hamming weights of the Pauli operators (14, 16, 25, 26)).”
Coarse-graining renormalization by higher-order singular value decomposition
Xie, Z. Y., Chen, J., Qin, M. P., Zhu, J. W., Yang, L. P., & Xiang, T. (2012) · Physical Review B · doi:10.1103/physrevb.86.045139 · Cited by 394 · cited 1×
“Once this has been done for every bond, we can group and contract each site’s tensors now with all adjacent projectors, yielding a single tensor per site with maximum single bond dimension χ (21, 38, 39).”
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
Bravyi, S., & Gosset, D. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.250501 · Cited by 320
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S. B., Browne, D. E., Calpin, P., Campbell, E. T., Gosset, D., & Howard, M. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 224
Algorithms for finite projected entangled pair states
Lubasch, M., Cirac, J. I., & Bañuls, M.-C. (2014) · Physical Review B · doi:10.1103/physrevb.90.064425 · Cited by 205 · cited 1×
“Figure S6 shows how the computational cost of the method and the Frobenius norm of the evolved operator scale with the threshold.”
Hyper-optimized tensor network contraction
Gray, J., & Kourtis, S. (2021) · Quantum · doi:10.22331/q-2021-03-15-410 · Cited by 186
Self-citationquimb: A python package for quantum information and many-body calculations
Gray, J. (2018) · Journal of Open Source Software · doi:10.21105/joss.00819 · Cited by 172
Self-citationEfficient Tensor Network Simulation of IBM’s Eagle Kicked Ising Experiment
Tindall, J., Fishman, M., Stoudenmire, E. M., & Sels, D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010308 · Cited by 152
Quantum Graphical Models and Belief Propagation
Leifer, M. S., & Poulin, D. (2008) · Annals of Physics · doi:10.1016/j.aop.2007.10.001 · Cited by 148
Solving the Sampling Problem of the Sycamore Quantum Circuits
Pan, F., Chen, K., & Zhang, P. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.090502 · Cited by 141
Classical simulations of noisy variational quantum circuits
Fontana, E., Rudolph, M. S., Duncan, R., Rungger, I., & Cîrstoiu, C. (2025) · npj Quantum Information · doi:10.1038/s41534-024-00955-1 · Cited by 139 · cited 1×
“(We note that recently, other related Pauli-based approaches have been proposed, with truncation based on Fourier expansion or Hamming weights of the Pauli operators (14, 16, 25, 26)).”
Isometric Tensor Network States in Two Dimensions
Zaletel, M. P., & Pollmann, F. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.037201 · Cited by 138 · cited 1×
“…different Pauli observables O were not only beyond the reach of exact classical simulations, but furthermore could not be computed to the experimental accuracy with certain approximate classical techniques, such as matrix product state (MPS) or isometric 2D tensor network (isoTNS) simulations (10).”
Phase transition in Random Circuit Sampling
Morvan, A., Villalonga, B., Mi, X., Mandrà, S., Bengtsson, A., Klimov, P. V., Chen, Z., Hong, S., Erickson, C., Drozdov, I. K., et al. (2023) · arXiv · doi:10.48550/arxiv.2304.11119 · Cited by 138
Quantum belief propagation: An algorithm for thermal quantum systems
Hastings, M. B. (2007) · Physical Review B · doi:10.1103/physrevb.76.201102 · Cited by 135
A simple tensor network algorithm for two-dimensional steady states
Kshetrimayum, A., Weimer, H., & Orús, R. (2017) · Nature Communications · doi:10.1038/s41467-017-01511-6 · Cited by 133 · cited 1×
“The first is equivalent to methods already demonstrated for wavefunctions (27, 31, 32) and operators (41) but with an efficient ‘lazy’ implementation that allows us to globally compress large and complex tensor networks.”
Simulation of qubit quantum circuits via Pauli propagation
Rall, P., Liang, D., Cook, J., & Kretschmer, W. (2019) · Physical Review A · doi:10.1103/physreva.99.062337 · Cited by 133 · cited 1×
“For example, Clifford-based approaches (20–24), can treat circuits with large numbers of qubits and highly entangled states as long as there is only a small number of non-Clifford gates.”
A simple tensor network algorithm for two-dimensional steady states
Kshetrimayum, A., Weimer, H., & Orús, R. (2017) · Institutional Repository of Leibniz Universität Hannover (Leibniz Universität Hannover) · doi:10.15488/2608 · Cited by 128
Unifying projected entangled pair state contractions
Lubasch, M., Cirac, J. I., & Bañuls, M.-C. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033014 · Cited by 126 · cited 2×
“Given the equivalence of BP compression to simple update, itself equivalent to cluster update (28, 29) with ‘zero cluster size’, an interesting question is whether the environment correlations can be systematically increased in a similar manner.”
Classical surrogate simulation of quantum systems with LOWESAPreprint
Rudolph, M. S., Fontana, E., Holmes, Z., & Cincio, Ł. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2308.09109 · Cited by 124 · cited 2×
“(We note that recently, other related Pauli-based approaches have been proposed, with truncation based on Fourier expansion or Hamming weights of the Pauli operators (14, 16, 25, 26)).”
Polynomially scaling spin dynamics simulation algorithm based on adaptive state-space restriction
Kuprov, I., Wagner-Rundell, N., & Hore, P. J. (2007) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2007.09.014 · Cited by 118 · cited 1×
“, the number of non-identity Pauli matrices appearing in a Pauli operator (14, 31, 32).”
Dissipation-assisted operator evolution method for capturing hydrodynamic transport
Rakovszky, T., von Keyserlingk, C. W., & Pollmann, F. (2022) · Physical Review B · doi:10.1103/physrevb.105.075131 · Cited by 103
Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
Shao, Y., Wei, F., Cheng, S., & Liu, Z. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.120603 · Cited by 99
Gauging tensor networks with belief propagation
Tindall, J., & Fishman, M. (2023) · SciPost Physics · doi:10.21468/scipostphys.15.6.222 · Cited by 95 · cited 4×
“(30, 31), at the convergence of the BP procedure, the BP messages correspond to working in the ‘super orthogonal’ gauge defined in Ref.”
InfluentialSimulating quantum circuit expectation values by Clifford perturbation theory
Begušić, T., Hejazi, K., & Chan, G. K. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0269149 · Cited by 75
Self-citationClassical Simulation of Quantum Supremacy Circuits
Huang, C., Zhang, F., Newman, M., Cai, J., Gao, X., Tian, Z., Wu, J., Xu, H., Yu, H., Yuan, B., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.06787 · Cited by 74
Extending the range of real time density matrix renormalization group simulations
Kennes, D. M., & Karrasch, C. (2015) · Computer Physics Communications · doi:10.1016/j.cpc.2015.10.019 · Cited by 72
Simulation of low-depth quantum circuits as complex undirected graphical models
Boixo, S., Isakov, S. V., Smelyanskiy, V., & Neven, H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.05384 · Cited by 72 · cited 1×
“One approach is to compare against exact classical simulations, such as state-vector methods which store the wavefunction amplitudes of the n qubits as a 2 n -dimensional vector, or exact tensor network (TN) contractions (1–6), which have an exponential cost in circuit tree-width (7).”
Classical Simulation of Intermediate-Size Quantum Circuits
Chen, J., Zhang, F., Huang, C., Newman, M., & Shi, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.01450 · Cited by 70 · cited 1×
“Exact contraction of these unstructured networks then becomes the dominant computational step, and we make use of recent advances to do so efficiently and with controlled memory (2, 37).”
Ran, S.-J., Li, W., Xi, B., Zhang, Z., & Su, G. (2012) · Physical Review B · doi:10.1103/physrevb.86.134429 · Cited by 67
Classical benchmarking of zero noise extrapolation beyond the exactly-verifiable regimePreprint
Anand, S., Temme, K., Kandala, A., & Zaletel, M. P. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.17839 · Cited by 63
Fourier expansion in variational quantum algorithms
Nemkov, N. A., Kiktenko, E. O., & Fedorov, A. K. (2023) · Physical Review A · doi:10.1103/physreva.108.032406 · Cited by 53 · cited 1×
“Projectors adjacent to each site are then contracted in, yielding single tensors with maximum dimension χ .”
Unbiased simulation of near-Clifford quantum circuits
Bennink, R. S., Ferragut, E. M., Humble, T. S., Laska, J. A., Nutaro, J. J., Pleszkoch, M. G., & Pooser, R. C. (2017) · Physical Review A · doi:10.1103/physreva.95.062337 · Cited by 49
Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
Kechedzhi, K., Isakov, S. V., Mandrà, S., Villalonga, B., Mi, X., Boixo, S., & Smelyanskiy, V. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2023.12.002 · Cited by 42
Boundary tensor renormalization group
Iino, S., Morita, S., & Kawashima, N. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.035449 · Cited by 41
Block belief propagation algorithm for two-dimensional tensor networks
Guo, C., Poletti, D., & Arad, I. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.125111 · Cited by 41
Efficient tensor network simulation of quantum many-body physics on sparse graphsPreprint
Sahu, S., & Swingle, B. G. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.04701 · Cited by 33 · cited 1×
“Figure S6 shows how the computational cost of the method and the Frobenius norm of the evolved operator scale with the threshold.”
Tensor Network Message Passing
Wang, Y., Zhang, Y., Pan, F. P., & Zhang, P. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.117401 · Cited by 30 · cited 2×
“(We note that recently, other related Pauli-based approaches have been proposed, with truncation based on Fourier expansion or Hamming weights of the Pauli operators (14, 16, 25, 26)).”
Clifford recompilation for faster classical simulation of quantum circuits
Qassim, H., Wallman, J. J., & Emerson, J. (2019) · Quantum · doi:10.22331/q-2019-08-05-170 · Cited by 27
Tensor networks contraction and the belief propagation algorithm
Alkabetz, R., & Arad, I. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023073 · Cited by 27 · cited 2×
“(We note that recently, other related Pauli-based approaches have been proposed, with truncation based on Fourier expansion or Hamming weights of the Pauli operators (14, 16, 25, 26)).”
One-step replica symmetry breaking in the language of tensor networksPreprint
Pancotti, N., & Gray, J. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.15004 · Cited by 20
Self-citationFast classical simulation of evidence for the utility of quantum computing before fault tolerancePreprint
Begušić, T., & Chan, G. K. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.16372 · Cited by 9
Self-citationSimulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator
Liao, H.-J., Wang, K., Zhou, Z.-S., Zhang, P., & Xiang, T. (2023) · arXiv · doi:10.48550/arxiv.2308.03082 · Cited by 4 · cited 1×
“(We note that recently, other related Pauli-based approaches have been proposed, with truncation based on Fourier expansion or Hamming weights of the Pauli operators (14, 16, 25, 26)).”
Tensor Network Message PassingPreprint
Wang, Y., Zhang, Y. E., Pan, F., et al. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2305.01874 · Cited by 4 · cited 2×
“(We note that recently, other related Pauli-based approaches have been proposed, with truncation based on Fourier expansion or Hamming weights of the Pauli operators (14, 16, 25, 26)).”
Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
Tindall, J., Fishman, M., Stoudenmire, M., & Sels, D. (2023) · arXiv · doi:10.48550/arxiv.2306.14887
Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
Kechedzhi, K., Isakov, S. V., Mandrà, S., Villalonga, B., Mi, X., Boixo, S., & Smelyanskiy, V. (2023) · arXiv · doi:10.48550/arxiv.2306.15970
Gauging tensor networks with belief propagation
Tindall, J., & Fishman, M. T. (2023) · arXiv · doi:10.48550/arxiv.2306.17837 · cited 4×
“(30, 31), at the convergence of the BP procedure, the BP messages correspond to working in the ‘super orthogonal’ gauge defined in Ref.”
InfluentialBlock belief propagation algorithm for two-dimensional tensor networks
Guo, C., Poletti, D., & Arad, I. (2023) · arXiv · doi:10.48550/arxiv.2301.05844
Hyper-optimized approximate contraction of tensor networks with arbitrary geometry
Gray, J., & Chan, G. K.-L. (2022) · arXiv · doi:10.48550/arxiv.2206.07044
Self-citationSimulating Noisy Variational Quantum Algorithms: A Polynomial Approach
Shao, Y., Wei, F., Cheng, S., & Liu, Z. (2023) · arXiv · doi:10.48550/arxiv.2306.05804
Research works printed but not linked: 1
- 10.22331/q-2021-03-15-410 · DOI · Paper page
Cited by
Beyond-classical computation in quantum simulation
King, A. D., Nocera, A., Rams, M. M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R., et al. (2025) · Science · doi:10.1126/science.ado6285 · Cited by 138
Does provable absence of barren plateaus imply classical simulability?
Cerezo, M., Larocca, M., García-Martín, D., Diaz, N. L., Braccia, P., Fontana, E., Rudolph, M. S., Bermejo, P., Ijaz, A., Thanasilp, S., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-63099-6 · Cited by 110
Benchmarking quantum computers
Proctor, T., Young, K., Baczewski, A. D., & Blume-Kohout, R. (2025) · Nature Reviews Physics · doi:10.1038/s42254-024-00796-z · Cited by 67
“This is because classical algorithms continue to improve and the power and speed of classical computers continues to grow, so even a 1,000× quantum advantage could be erased within years, or even days, with rapid classical algorithm development to counter a claimed quantum advantage 111–114 .”
Efficient tensor network simulation of IBM's largest quantum processors
Patra, S., Jahromi, S. S., Singh, S., & Orús, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013326 · Cited by 63
Observation of constructive interference at the edge of quantum ergodicity
Collaborators, G. Q. A. A., Abanin, D. A., Acharya, R., Beni, L. A., Aigeldinger, G., Ajoy, A., Alcaraz, R., Aleǐner, I. L., Andersen, T. I., Ansmann, M., et al. (2025) · Nature · doi:10.1038/s41586-025-09526-6 · Cited by 195
Metadata
- Authors
- Begušić, T., Gray, J., & Chan, G. K.-L.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Begušić, Tomislav
- Gray, Johnnie
- Chan, Garnet Kin-Lic
- Venue
- Science Advances
- Published
- 2024-01-19
- Volume
- 10
- Issue
- 3
- Pages
- eadk4321-eadk4321
- ISSN
- 2375-2548 (ISSN-L)
- PMC
- PMC12697566
- OpenAlex
- W4390959369
- Cited by
- 89
- References
- 38
- Citations by year
- 2026: 28 · 2025: 36 · 2024: 20
- FWCI
- 12.37
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by-nc
- Locations
- Science Advances (publishedVersion, cc-by-nc)
- PubMed Central (publishedVersion, cc-by-nc)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by-nc-sa)
- arXiv (Cornell University)
- Funders
- National Science Foundation (DEAC02-05CH11231)
- U.S. Department of Energy (DESC0022088, -AC02-05CH11231, 05CH11231, DE AC02 05CH11231, DE-AC02-)
- California Institute of Technology
- Resnick Sustainability Institute for Science, Energy and Sustainability, California Institute of Technology
- National Energy Research Scientific Computing Center (DE–AC02–05CH11231, 05CH11231, AC02-05CH11231)
- Flatiron Health
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (214214)
- Office of Science (DEAC02–05CH11231, AC02-05CH11231, DE-AC02, DESC0022088)
- Basic Energy Sciences (DE-AC02, SC0022088, DE-AC02-05CH11231., DESC0022088, AC02–05CH11231)
- Advanced Scientific Computing Research (DE-AC02-05CH11231, DESC0022088)
- Lawrence Berkeley National Laboratory (AC02‐05CH11231, DE-AC02-05CH11231, 05CH11231)
- 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
- classical simulation of quantum circuits, tensor networks, belief propagation, bond dimension, expectation value estimation, quantum advantage
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
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.