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
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
Quantum computing for chemistry and physics applications from a Monte Carlo perspective
Mazzola, G. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0173591 · Cited by 64
Stabilizer Tensor Networks: Universal Quantum Simulator on a Basis of Stabilizer States
Masot-Llima, S., & García-Sáez, A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.230601 · Cited by 92
Montañez-Barrera, J. A., & Michielsen, K. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01082-1 · Cited by 34
“35,36), so the validation of this remains subject to evaluation within the research community.”
Tensor networks enable the calculation of turbulence probability distributions
Gourianov, N., Givi, P., Jaksch, D., & Pope, S. B. (2025) · Science Advances · doi:10.1126/sciadv.ads5990 · Cited by 73
“TN algorithms allow efficiently evolving these states and analyzing their physical properties without ever leaving the compressed TN representation [12–15], and have enabled the simulation of otherwise intractable quantum systems like superconductors, ferromagnets and quantum computers [16–24].”
Classically Estimating Observables of Noiseless Quantum Circuits
Angrisani, A., Schmidhuber, A., Rudolph, M. S., Cerezo, M., Holmes, Z., & Huang, H.-Y. (2025) · Physical Review Letters · doi:10.1103/lh6x-7rc3 · Cited by 173
“Prior work has proposed several Pauli propagation methods [13, 35, 40–42, 57, 58] for classically simulating the family of expectation values described above.”
Gauging tensor networks with belief propagation
Tindall, J., & Fishman, M. (2023) · SciPost Physics · doi:10.21468/scipostphys.15.6.222 · Cited by 95
Simulating unsteady flows on a superconducting quantum processor
Meng, Z., Zhong, J., Xu, S., Wang, K., Chen, J., Jin, F., Zhu, X., Gao, Y., Wu, Y., Zhang, C., et al. (2024) · Communications Physics · doi:10.1038/s42005-024-01845-w · Cited by 54
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
Advancements in superconducting quantum computing
Jiang, Y.-Y., Deng, C., Fan, H., Li, B.-Y., Sun, L., Tan, X., Wang, W., Xue, G., Yan, F., Yu, H., et al. (2025) · National Science Review · doi:10.1093/nsr/nwaf246 · Cited by 83
A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits
Schuster, T., Yin, C., Gao, X., & Yao, N. Y. (2025) · Physical Review X · doi:10.1103/xct1-7kf2 · Cited by 148
Benchmarking quantum computer simulation software packages: State vector simulators
Jamadagni, A., Läuchli, A. M., & Hempel, C. (2024) · SciPost Physics Core · doi:10.21468/scipostphyscore.7.4.075 · Cited by 55
“Furthermore, our selection is based on additional criteria, such as, whether a package offers to exploit the computational power provided by HPC platforms, is actively maintained and developed (gauged in terms of release cycles) and provides access to relevant documentation (feature snippets,…”
Magic Resources of the Heisenberg Picture
Dowling, N., Kos, P., & Turkeshi, X. (2025) · Physical Review Letters · doi:10.1103/p7xt-s9nz · Cited by 88
Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs
Pelofske, E., Bärtschi, A., Cincio, Ł., Golden, J. K., & Eidenbenz, S. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00906-w · Cited by 66
Real-Time Operator Evolution in Two and Three Dimensions via Sparse Pauli Dynamics
Begušić, T., & Chan, G. K. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020302 · Cited by 84
Self-citationHuang, J., Qian, X., & Qin, M. (2025) · Physical Review A · doi:10.1103/gxdn-zwrw · Cited by 45
Combining matrix product states and noisy quantum computers for quantum simulation
Martin, B. A., Ayral, T., Jamet, F., Rančić, M. J., & Simon, P. (2024) · Physical Review A · doi:10.1103/physreva.109.062437 · Cited by 39
Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Romero, S. V., Visuri, A.-M., Cadavid, A. G., Simen, A., Solano, E., & Hegade, N. N. (2025) · Communications Physics · doi:10.1038/s42005-025-02270-3 · Cited by 18
Simulating 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-citationWaintal, X. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2313269120 · Cited by 27
Wulff, A., Chen, B., Steinberg, M., Tang, Y., Möller, M., & Feld, S. (2024) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2024.117380 · Cited by 22
mRNA Secondary Structure Prediction Using Utility-Scale Quantum Computers
Alevras, D., Metkar, M., Yamamoto, T., Kumar, V., Friedhoff, T., Park, J.-E., Takeori, M., LaDue, M., Davis, W., & Galda, A. (2024) · 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00064 · Cited by 14
A nonstabilizerness monotone from stabilizerness asymmetry
Tarabunga, P. S., Frau, M., Haug, T., Tirrito, E., & Piroli, L. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adfd0d · Cited by 34
“This simulation technique is very similar, and in fact can be seen as the Schrödinger version of the sparse Pauli dynamics method [82, 83].”
Noise-induced shallow circuits and the absence of barren plateaus
Mele, A. A., Angrisani, A., Ghosh, S., Khatri, S., Eisert, J., França, D. S., & Quek, Y. (2026) · Nature Physics · doi:10.1038/s41567-026-03245-z · Cited by 96
Bridging Entanglement and Magic Resources within Operator Space
Dowling, N., Modi, K. K., & White, G. A. L. (2025) · Physical Review Letters · doi:10.1103/c7k1-xcwy · Cited by 57
Dynamics of disordered quantum systems with two- and three-dimensional tensor networks
Tindall, J., Mello, A. F., Fishman, M., Stoudenmire, E. M., & Sels, D. (2026) · Science · doi:10.1126/science.adx2728 · Cited by 100
Grand Challenge of Quantum Applications
Babbush, R., King, R., Boixo, S., Huggins, W. J., Khattar, T., Low, G. H., McClean, J. R., O’Brien, T. E., & Rubin, N. C. (2026) · PRX Quantum · doi:10.1103/6r9l-lynr · Cited by 70
“Notable claims were made by IBM [87] and D-Wave [88] in 2024 but then challenged by several groups shortly thereafter using relatively standard methods [89–93].”
Michel, A., Henriet, L., Domain, C., Browaeys, A., & Ayral, T. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.174409 · Cited by 21
“…improvements involve the slave-spin method itself: doped regimes (relevant to cuprate materials), multiorbital models [60] (relevant to iron-based superconductors, where orbital-selective effects may appear [61]) pose various technical difficulties that warrant further theoretical developments.”
BackgroundMartinez, V., Angrisani, A., Pankovets, E., Fawzi, O., & França, D. S. (2025) · Physical Review Letters · doi:10.1103/j1gg-s6zb · Cited by 45
Park, G., Gray, J., & Chan, G. K. (2025) · Physical review. B./Physical review. B · doi:10.1103/7jzt-xhn6 · Cited by 36
Self-citationNoise robust detection of quantum phase transitions
Lively, K., Bode, T., Szangolies, J., Zhu, J., & Fauseweh, B. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043254 · Cited by 18
Simulating Quantum Circuits with Arbitrary Local Noise Using Pauli Propagation
Angrisani, A., Mele, A. A., Rudolph, M. S., Cerezo, M., & Holmes, Z. (2026) · PRX Quantum · doi:10.1103/fb28-wlv2 · Cited by 99
Exponential qubit reduction in optimization for financial transaction settlement
Huber, E. X., Tan, B. Y. L., Griffin, P., & Angelakis, D. G. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00262-w · Cited by 19
Problem-tailored Simulation of Energy Transport on Noisy Quantum Computers
Chen, I.-C., Pollock, K., Yao, Y., Orth, P. P., & Iadecola, T. (2024) · Quantum · doi:10.22331/q-2024-12-03-1545 · Cited by 9
“To be more quantitative, we also plot in the inset of each panel the corresponding dynamical relative error ϵ ( t ) = F 0 ( t ) /C S 0 ( t ), where (5.12) We see that the optimized entangled sampling basis performs best, with the smallest overall time-averaged relative error (green lines).”
InfluentialEfficient learning for linear properties of bounded-gate quantum circuits
Du, Y., Hsieh, M.-H., & Tao, D. (2025) · Nature Communications · doi:10.1038/s41467-025-59198-z · Cited by 27
Buchs, G., Beck, T. L., Bennink, R. S., Claudino, D., Delgado, A., Fadel, N. A., Groszkowski, P., Hamilton, K. E., Humble, T. S., Kumar, N., et al. (2026) · Future Generation Computer Systems · doi:10.1016/j.future.2026.108487 · Cited by 16
“[154] using Clifford perturbation theory, swiftly followed and validated the results of the quantum simulations, placing an asterisk on the claim of quantum advantage over classical methods.”
Unveiling clean two-dimensional discrete time crystals on a digital quantum computer
Shinjo, K., Seki, K., Shirakawa, T., Sun, R.-Y., & Yunoki, S. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01193-3 · Cited by 57
“The utilisation of a stabilizer formalism may further improve the simulatability of a tensor network [56, 57].”
Loop series expansions for tensor networks
Evenbly, G., Pancotti, N., Milsted, A., Gray, J., & Chan, G. K. (2026) · Physical Review Research · doi:10.1103/vqks-cr6x · Cited by 37
“Although they were traditionally developed for model systems in the context of condensed matter physics, they have more recently been applied towards the benchmarking of nascent quantum computers 11–22 .”
Self-citationEfficient Quantum-Enhanced Classical Simulation for Patches of Quantum Landscapes
Lerch, S., Puig, R., Rudolph, M. S., Angrisani, A., Jones, T., Cerezo, M., Thanasilp, S., & Holmes, Z. (2026) · PRX Quantum · doi:10.1103/fhc5-8sm6 · Cited by 69
Umeano, C., Jamet, F., Lindoy, L. P., Rungger, I., & Kyriienko, O. (2025) · Physical Review Materials · doi:10.1103/physrevmaterials.9.034401 · Cited by 15
Superconducting qubit-resonator quantum processor with effective all-to-all connectivity
Renger, M., Verjauw, J., Wurz, N., Hosseinkhani, A., Ockeloen-Korppi, C. F., Liu, W., Rath, A., Thapa, M., Vigneau, F., Wybo, E., et al. (2026) · Physical Review Research · doi:10.1103/8x68-cx1w · Cited by 26
Survey on Computational Applications of Tensor-Network Simulations
García, M. D., & Romero, A. M. (2024) · IEEE Access · doi:10.1109/access.2024.3519676 · Cited by 23
“Similar experiments demonstrating efficient simulations of TNs for the same transverse-field Ising model on 127 qubits have been conducted independently by other researchers [12, 80, 126].”
Confinement in the Transverse Field Ising Model on the Heavy Hex Lattice
Tindall, J., & Sels, D. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.180402 · Cited by 18
Classical simulability of Clifford + T circuits with Clifford-augmented matrix product states
Liu, Z., & Clark, B. K. (2026) · Physical Review Research · doi:10.1103/ybnf-rjw8 · Cited by 28
Short-time simulation of quantum dynamics by Pauli measurements
Faehrmann, P. K., Eisert, J., Kieferová, M., & Kueng, R. (2025) · Physical Review A · doi:10.1103/6ggs-y392 · Cited by 7
Automatic structural search of tensor network states including entanglement renormalization
Watanabe, R., & Ueda, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033259 · Cited by 3
Realizing Quantum Kernel Models at Scale with Matrix Product State Simulation
Metcalf, M., Andrés-Martínez, P., & Fitzpatrick, N. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00086 · Cited by 3
“Quantum circuit simulation using tensor networks has progressed in tandem with the scaling of quantum computers, often acting as the classical framework competing against quantum advantage claims [16]–[18].”
Classical and quantum algorithms for many-body problems
Ayral, T. (2025) · Comptes Rendus Physique · doi:10.5802/crphys.229 · Cited by 8
Exact closed-form unitary transformations of fermionic operators
Evangelista, F. A., & Magoulas, I. (2025) · Physical Review A · doi:10.1103/physreva.111.042825 · Cited by 6
BlockBP decoder for the surface code
Kaufmann, A., & Arad, I. (2025) · Physical Review Research · doi:10.1103/z2qt-smfb · Cited by 8
State-Dependent Mobility Edge in Kinetically Constrained Models
Badbaria, M., Pancotti, N., Singh, R., Marino, J., & Valencia-Tortora, R. J. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040348 · Cited by 5
PAC-learning of free-fermionic states is NP-hard
Bittel, L., Mele, A. A., Eisert, J., & Leone, L. (2025) · Quantum · doi:10.22331/q-2025-03-20-1665 · Cited by 9
Scalable projected entangled-pair state representation of random quantum circuit states
Lee, S., Choi, H. R., Ohm, D. D., & Lee, S. B. (2025) · Physical Review Research · doi:10.1103/rzgm-cywf · Cited by 12
Variational quantum thermalizers based on weakly-symmetric nonunitary multi-qubit operations
Zapusek, E., Kirova, K., Hahn, W., Marthaler, M., & Reiter, F. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae2886 · Cited by 7
“A common question is finding the ground state of a physical system [2], yet at present it is still debated whether quantum computers can calculate ground state properties faster than classical computers [3].”
Improved quantum computation using operator backpropagation
Fuller, B., Tran, M. C., Lykov, D., Johnson, C., Rossmannek, M., Wei, K. X., He, A., Kim, Y., Vu, D., Sharma, K., et al. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01196-0 · Cited by 34
“Such a strategy has been successful in approximating the outcomes of recent utility-scale experiments [20].”
Misra, N. K., Pathak, N., Ahmadpour, S., Krishnamoorthy, M., Noorallahzadeh, M., Goswami, M., Bhoi, B. K., & Satpathy, S. (2026) · Integration · doi:10.1016/j.vlsi.2026.102689 · Cited by 2
Pauli Propagation: A Computational Framework for Simulating Quantum Systems
Rudolph, M. S., Jones, T., Teng, Y., Angrisani, A., & Holmes, Z. (2026) · PRX Quantum · doi:10.1103/6vd7-l9bn · Cited by 156
“II A), both parts can be simulated via Pauli propagation with very efficient inner product computation, but in principle, any two computational methods (classical or quantum) can be combined [11, 17, 20].”
InfluentialDiamond-shaped quantum circuit for real-time quantum dynamics in one dimension
Miyakoshi, S., Sugimoto, T., Shirakawa, T., Yunoki, S., & Ueda, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043318 · Cited by 5
Analog simulation of noisy quantum circuits
Granet, E., Hémery, K., & Dreyer, H. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013213 · Cited by 5
Correlations, spectra, and entanglement transitions in ensembles of matrix product states
Lóio, H., Cecile, G., Gopalakrishnan, S., Lami, G., & Nardis, J. D. (2025) · Physical review. B./Physical review. B · doi:10.1103/ymzz-923j · Cited by 7
What is the future role of quantum computation in drug discovery?
Schusteritsch, G., Wright, D. W., Green, A. G., & Stojevic, V. (2025) · Emerging Topics in Life Sciences · doi:10.1042/etls20240012 · Cited by 2
Pelofske, E., Rams, M. M., Bärtschi, A., Czarnik, P., Braccia, P., Cincio, Ł., & Eidenbenz, S. (2026) · Physical Review Research · doi:10.1103/p2lg-z4kn · Cited by 8
Efficient online quantum circuit learning with no upfront training
O’Leary, T., Czarnik, P., Pelofske, E., Sornborger, A. T., McKerns, M. M., & Cincio, Ł. (2025) · Communications Physics · doi:10.1038/s42005-025-02423-4 · Cited by 13
Vovrosh, J., Julià-Farré, S., Krinitsin, W., Kaicher, M., Hayes, F. J., Gottlob, E., Kshetrimayum, A., Bidzhiev, K., Jäger, S. B., Schmitt, M., et al. (2026) · Physical Review Research · doi:10.1103/x4gs-g63p · Cited by 20
“Notably, the tensor-network toolbox has been recently leveraged to efficiently and accurately simulate [9, 62, 80, 81] some of the most recent large-scale experiments on qubit-based QPUs [3, 5], and to investigate other dynamics scenarios in square lattices up to 16 16 qubits [63] and 24 24 [82].”
Vast World of Quantum Advantage
Huang, H.-Y., Choi, S., McClean, J. R., & Preskill, J. P. (2026) · Physical Review X · doi:10.1103/tn89-g1xz · Cited by 77
Anonymous, & Nys, J. (2026) · PRX Quantum · doi:10.1103/tggc-8fjx · Cited by 12
Tindall, J., & Fishman, M. (2023) · SciPost Physics · doi:10.21468/scipost.report.7931
Tindall, J., & Fishman, M. (2023) · SciPost Physics · doi:10.21468/scipost.report.7878
Scalable quantum dynamics compilation via quantum machine learning
Zhang, Y., Wiersema, R., Carrasquilla, J., Cincio, Ł., & Kim, Y. B. (2026) · Physical Review Research · doi:10.1103/wswv-nq6d · Cited by 24
Advantages of Density in Tensor Network Geometries for Gradient-Based Training
Masot-Llima, S., & García-Sáez, A. (2025) · Algorithms · doi:10.3390/a18020070 · Cited by 1
Variational tensor network simulation of Gaussian boson sampling and beyond
Vinther, J., & Kastoryano, M. J. (2025) · Physical Review A · doi:10.1103/z463-7gqy · Cited by 4
“Similar ideas of divide-and-conquer are utilized in simulating qubit-based quantum circuits in the form of a joint Schr¨odinger-Heisenberg picture approach [73][74][75].”
Tensor network loop cluster expansions for quantum many-body problems
Gray, J., Park, G., Evenbly, G., Pancotti, N., Kjønstad, E. F., & Chan, G. K. (2026) · Physical review. B./Physical review. B · doi:10.1103/r6mz-6q3g · Cited by 13
“Belief propagation has been increasingly employed as a way to approximately contract tensor networks and these methods have notably achieved success in simulating some recent quantum experiments [24–26].”
Self-citationSymmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits
Camillo, G., Peres, F. C. R., Heinrich, M., & Bermejo-Vega, J. (2026) · PRX Quantum · doi:10.1103/nnzz-481j · Cited by 2
“Indeed, classical simulators allow direct validation of quantum hardware and serve as a benchmark to compare quantum advantage claims against [1–3], while still regularly defying them [4, 5].”
Utility-Scale Quantum State Preparation: Classical Training using Pauli Path Simulation
Lin, C.-J., Gharibyan, H., & Su, V. P. (2026) · Quantum · doi:10.22331/q-2026-03-09-2014 · Cited by 13
“On the other hand, early numerical studies indicate that weight-and path-based truncation schemes can yield high-quality results for VQAs in condensed matter systems of a small system size [20], as well as for quantum machine learning tasks [21].”
A quantum eigenvalue solver based on tensor networks
Leimkuhler, O., & Whaley, K. B. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01128-4 · Cited by 5
“The intuition behind the TNQE ansatz, which may be tested empirically, is that χ can be made constant in N , provided that the non-local correlations are recovered through the inclusion of multiple”
Majorana string simulation of nonequilibrium dynamics in two-dimensional lattice fermion systems
D'Anna, M., Nys, J., & Carrasquilla, J. (2026) · Physical review. B./Physical review. B · doi:10.1103/f6mn-jc3r · Cited by 23
Lang, R. A., Mehendale, S. G., Ryabinkin, I. G., & Izmaylov, A. F. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c01849 · Cited by 3
“This idea has also appeared in recent works re-lated to sparse Pauli dynamics 54 .”
The disparate impact of noise on quantum learning algorithms
Angrisani, A. (2023) · theses.fr (ABES) · doi:10.70675/69f942ebz4417z4eceza746z1c9d436d09bb · Cited by 3
Emulation of large-scale qubit registers with a phase-space approach
de Correc, C., Lacroix, D., & Bertrand, C. (2026) · APS Open Science · doi:10.1103/swn6-s387 · Cited by 1
Resource Assessment of Classical and Quantum Hardware for Post-Quench Dynamics
Vovrosh, J., Mendes-Santos, T., Mamann, H., Bidzhiev, K., Hayes, F. J., Alves, B. X. R., Béguin, L., Dalyac, C., & Dauphin, A. (2026) · PRX Energy · doi:10.1103/kfy5-q531 · Cited by 6
Shin, H., Lee, S., Kwak, M., & Kim, Y. (2026) · International Conference on Supercomputing · doi:10.1145/3797905.3816723
“However, the ability to simulate large quantum systems is fundamentally constrained by exponential state-space growth [8, 46].”
Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
Cichy, S., Faehrmann, P. K., Bittel, L., Eisert, J., & Pashayan, H. (2026) · Physical Review A · doi:10.1103/jj2r-y777 · Cited by 16
Entropy density benchmarking of near-term quantum circuits
Anonymous, Mills, J. K., Hammam, K., & García−Patrón, R. (2026) · Physical Review A · doi:10.1103/swvt-3pkh · Cited by 5
“[16, 17]).”
Hu, B., Shi, W., Xiong, S., Li, S., Wang, K., & Gong, N. (2026) · Frontiers in Medical Technology · doi:10.3389/fmedt.2026.1775679
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.