Pith. sign in

REVIEW 7 cited by

Efficient tensor network simulation of IBM's Eagle kicked Ising experiment

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.14887 v3 pith:6HIHC6BU submitted 2023-06-26 quant-ph

Efficient tensor network simulation of IBM's Eagle kicked Ising experiment

classification quant-ph
keywords quantumsimulationapproachclassicalnetworksystemtensoraccuracy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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 (Nature volume 618, p.~500-505 (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 tree-like correlations of the wavefunction 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 tree-like correlations.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient classical simulation of large-scale unitary cluster Jastrow circuits

    quant-ph 2026-07 conditional novelty 7.0

    A one-layer UCJ quantum chemistry circuit can have its energy computed classically in O(N^7) time, so single-layer UCJ circuits cannot provide quantum advantage for energy estimation.

  2. QANTIS: Hardware-Calibrated Sequential POMDP Belief Updates on IBM Heron

    cs.AI 2026-07 conditional novelty 5.0

    All-step fixed-point amplitude amplification on IBM Heron preserves sequential Tiger POMDP posteriors and planner actions across 8–32 step horizons inside a measured operating envelope.

  3. SU(4) Heisenberg model on the hyperhoneycomb lattice

    cond-mat.str-el 2026-06 unverdicted novelty 5.0

    3D PEPS simulations of the SU(4) Heisenberg model on the hyperhoneycomb lattice extrapolate to a gapless spin-liquid ground state.

  4. SU(4) Heisenberg model on the hyperhoneycomb lattice

    cond-mat.str-el 2026-06 conditional novelty 5.0

    Numerical iPEPS with loop expansions indicates the SU(4) Heisenberg model on the hyperhoneycomb lattice has a gapless quantum spin-liquid ground state, consistent with prior variational Monte Carlo results.

  5. Contracting Tensor Networks with Generalized Belief Propagation

    quant-ph 2026-04 unverdicted novelty 5.0

    Generalized belief propagation approximates tensor network contractions via hierarchical region messages and fixed-point solutions, demonstrated on Ising, ice, AKLT, and random tensor networks.

  6. Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

    quant-ph 2025-09 conditional novelty 5.0

    Systematic numerical study of QAOA parameter transfer on heavy-hex Ising models with local cubic terms shows transferred angles from small instances yield improving expectation values up to 49 layers on instances up t...

  7. Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs

    math.OC 2024-12 unverdicted novelty 3.0

    Classical solvers solve random Ising models on heavy-hex graphs efficiently, with Gurobi showing linear or weakly quadratic scaling up to 100k variables and simulated annealing showing exponential time-to-solution wit...