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.
Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
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.
representative citing papers
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.
Generalized belief propagation approximates tensor network contractions via hierarchical region messages and fixed-point solutions, demonstrated on Ising, ice, AKLT, and random tensor networks.
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 to 156 qubits, with hardware runs confirming gains up to p=10.
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 without cubic terms.
citing papers explorer
-
QANTIS: Hardware-Calibrated Sequential POMDP Belief Updates on IBM Heron
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.
-
SU(4) Heisenberg model on the hyperhoneycomb lattice
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.
-
Contracting Tensor Networks with Generalized Belief Propagation
Generalized belief propagation approximates tensor network contractions via hierarchical region messages and fixed-point solutions, demonstrated on Ising, ice, AKLT, and random tensor networks.
-
Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
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 to 156 qubits, with hardware runs confirming gains up to p=10.
-
Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs
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 without cubic terms.