Fast classical simulation of `Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor'

• URL: http://arxiv.org/abs/2608.13805v1
• Date: Thu, 13 Aug 2026 22:31:30 GMT
• Title: Fast classical simulation of `Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor'
• Abstract summary: We study the Néel quench dynamics of a 1D Fermi-Hubbard model which has recently been simulated on quantum hardware.<n>We demonstrate that the set of 7260 observable trajectories measured in the quantum experiment can be obtained more quickly and accurately through classical tensor network simulation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the Néel quench dynamics of a 1D Fermi-Hubbard model which has recently been simulated on quantum hardware. We demonstrate that the set of 7260 observable trajectories measured in the quantum experiment can be obtained more quickly and accurately through classical tensor network simulation using modest computation. Our result relies on transverse tensor network contraction, where a bond dimension of 32 is already sufficient to reproduce the quantum experiment. We further extend the converged observable trajectories to longer times than in the hardware simulation and in other recent classical simulations.

Related papers

• Benchmarking quantum simulation with neutron-scattering experiments [0.0]
  We show that a superconducting quantum processor operating on up to 50 qubits can already produce meaningful, quantitative comparisons with inelastic neutron-scattering measurements.<n>We extend our simulations to 1D XXZ Heisenberg model with next-nearest neighbor interactions and a strong anisotropy, producing a gapped excitation spectrum.
  arXiv  Detail & Related papers  (2026-03-16T17:56:58Z)
• Digital Quantum Simulation of the Holstein-Primakoff Transformation on Noisy Qubits [40.8066152850216]
  We study the digital quantum simulation of bosonic modes on a cloud-based superconducting quantum processor.<n>We examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters.
  arXiv  Detail & Related papers  (2026-02-19T20:14:04Z)
• Comment on: "Dynamics of disordered quantum systems with two- and three-dimensional tensor networks" arXiv:2503.05693 [0.2656235427539931]
  This work should not be misinterpreted as having overturned the claim of Ref. [2]: the demonstration of quantum simulations beyond the reach of classical methods.<n>In the near future these classical methods can be combined with quantum simulations to help sharpen the boundary between classical and quantum simulability.
  arXiv  Detail & Related papers  (2025-03-25T17:52:08Z)
• Leapfrogging Sycamore: Harnessing 1432 GPUs for 7$\ imes$ Faster Quantum Random Circuit Sampling [40.83618005962484]
  Random quantum circuit sampling serves as a benchmark to demonstrate quantum computational advantage. Recent progress in classical algorithms has significantly reduced the classical simulation time. Our work provides the first unambiguous experimental evidence to refute textitSycamore's claim of quantum advantage.
  arXiv  Detail & Related papers  (2024-06-27T05:01:47Z)
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics [42.29248343585333]
  We benchmark quantum hardware and error mitigation techniques on up to 133 qubits. We show reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates. Results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning.
  arXiv  Detail & Related papers  (2024-04-11T18:00:05Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance [0.0]
  A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits exceeds 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.
  arXiv  Detail & Related papers  (2023-08-09T17:15:17Z)
• Fast classical simulation of evidence for the utility of quantum computing before fault tolerance [0.0]
  We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor. Our simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, and are in good agreement with the zero-noise extrapolated experimental results.
  arXiv  Detail & Related papers  (2023-06-28T17:08:00Z)
• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment [0.0]
  We report an accurate and efficient classical simulation of a kicked Ising quantum system on the heavy-hexagon lattice. We adopt a tensor network approach that reflects the geometry of the lattice and is approximately contracted using belief propagation.
  arXiv  Detail & Related papers  (2023-06-26T17:54:08Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.