The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Efficient Tensor Network Simulation of IBM’s Eagle Kicked Ising Experiment
Open accessAbstract
We report an accurate and efficient classical simulation of a kicked Ising quantum system on the heavy hexagon lattice. A simulation of this system was recently performed on a 127-qubit quantum processor using noise-mitigation techniques to enhance accuracy [Y. Kim ., Nature, 618, 500–5 (2023)]. Here we show that, by adopting a tensor network approach that reflects the geometry of the lattice and is approximately contracted using belief propagation, we can perform a classical simulation that is significantly more accurate and precise than the results obtained from the quantum processor and many other classical methods. We quantify the treelike correlations of the wave function in order to explain the accuracy of our belief propagation-based approach. We also show how our method allows us to perform simulations of the system to long times in the thermodynamic limit, corresponding to a quantum computer with an infinite number of qubits. Our tensor network approach has broader applications for simulating the dynamics of quantum systems with treelike correlations. Published by the American Physical Society 2024
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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?
In the simulation of the kicked Ising experiment on the heavy-hex lattice, the shortest loops are length 12, and tree-tensor networks proved to be very fast and economical in computational resources since correlation lengths are relatively short.
“For example, in the aforementioned simulation of the kicked Ising experiment on the heavy-hex lattice, the shortest loops are length 12, and tree-tensor networks proved to be very fast and economical in computational resources since correlation lengths are relatively short 16 .”
From Beyond-classical computation in quantum simulation (2025) · cites this paper as [16]
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
Experimental — accuracy not yet measuredSU methods have been successfully applied for the simulation of a kicked Ising model on a heavy-hex lattice, which despite finite dimensionality (2) has a paucity of short loops.
“SU methods have been successfully applied for the simulation of a kicked Ising model on a heavy-hex lattice for example, which despite finite dimensionality (2) has a paucity of short loops 16,94 .”
From Beyond-classical computation in quantum simulation (2025) · cites this paper as [16]
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
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Orús, R., & Vidal, G. (2009) · Physical Review B · doi:10.1103/physrevb.80.094403 · Cited by 387
Probabilistic error cancellation with sparse Pauli–Lindblad models on noisy quantum processors
van den Berg, E., Minev, Z. K., Kandala, A., & Temme, K. (2023) · Nature Physics · doi:10.1038/s41567-023-02042-2 · Cited by 305
What Limits the Simulation of Quantum Computers?
Zhou, Y., Stoudenmire, E. M., & Waintal, X. (2020) · Physical Review X · doi:10.1103/physrevx.10.041038 · Cited by 254
Self-citationAyral, T., Louvet, T., Zhou, Y., Lambert, C., Stoudenmire, E. M., & Waintal, X. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020304 · Cited by 66
Self-citation
Flagged first, then by citations
Research works printed but not linked: 27
- 10.1038/s41567-020-01109-8 · DOI
- 10.1103/PRXQuantum.4.020340 · DOI
- 10.1103/PhysRevLett.128.030501 · DOI
- 10.1103/PhysRevLett.119.180509 · DOI · Paper page
- 10.1038/s41586-023-06096-3 · DOI · Paper page
- 10.1016/j.aop.2007.10.001 · DOI
- 10.1038/s41467-022-35301-6 · DOI
- 10.1038/nphys3934 · DOI
- 10.1103/PhysRevB.103.205137 · DOI · Paper page
- 10.1103/PhysRevB.92.035142 · DOI · Paper page
- 10.1103/PhysRevLett.101.090603 · DOI · Paper page
- 10.1103/PhysRevLett.91.147902 · DOI · Paper page
- 10.1103/PhysRevB.99.195105 · DOI
- 10.1103/PhysRevB.86.134429 · DOI
- 10.1103/PhysRevB.91.115137 · DOI
- 10.1103/PhysRevResearch.3.023073 · DOI · Paper page
- 10.1038/s41467-022-35090-y · DOI
- 10.1103/PhysRevB.83.134421 · DOI
- 10.1103/PhysRevB.86.195137 · DOI
- 10.1103/PhysRevResearch.3.023073 · DOI · Paper page
- 10.1103/PhysRevB.81.081103 · DOI
- 10.1103/PhysRevB.98.085155 · DOI
- 10.1152/jn.2001.85.3.1220 · DOI
- 10.1137/141000671 · DOI · Paper page
- 10.21468/SciPostPhysCodeb.4-r0.3 · DOI
- 10.1103/PhysRevLett.101.250602 · DOI · Paper page
- 10.1088/1367-2630/16/3/033014 · DOI
Cited by
Sorted by citations
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
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
Begušić, T., Gray, J., & Chan, G. K.-L. (2024) · Science Advances · doi:10.1126/sciadv.adk4321 · Cited by 89
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
Metadata
- Authors
- Tindall, J., Fishman, M., Stoudenmire, E. M., & Sels, D.
- Affiliations
- Flatiron Institute (US)
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2024-01-23
- Volume
- 5
- Issue
- 1
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W4391132757
- Cited by
- 152
- References
- 5
- Citations by year
- 2026: 43 · 2025: 58 · 2024: 44
- FWCI
- 23.12
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- PRX Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- Simons Foundation
- AFOSR (FA9550-21-1-0236)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- tensor networks, classical simulation of quantum dynamics, belief propagation, thermodynamic limit, noise mitigation, quantum chaos
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