Pushing the Classical Frontier of 1D Fermi-Hubbard Quench Dynamics Beyond Current Quantum Simulations

• URL: http://arxiv.org/abs/2606.04771v1
• Date: Wed, 03 Jun 2026 11:52:47 GMT
• Title: Pushing the Classical Frontier of 1D Fermi-Hubbard Quench Dynamics Beyond Current Quantum Simulations
• Abstract summary: The Q-CTRL team recently simulated quench dynamics of the one-dimensional Fermi-Hubbard model on an IBM processor.<n>We exploit the full $mathrmU(1)timesmathrmSU(2)$ symmetry of the Fermi-Hubbard Hamiltonian combined with GPU-accelerated tensor contractions.<n>We achieve fully converged results across the entire simulation window, including rigorous certification of the previously unresolved high-entanglement regime.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Establishing quantum advantage requires comparison against the best achievable classical simulation. The Q-CTRL team recently simulated quench dynamics of the one-dimensional Fermi-Hubbard model on an IBM processor, completing a $L=60$ evolution to time $t=6$ in under three minutes and claiming a $3000\times$ speedup over classical Time-Dependent Variational Principle (TDVP) simulation at bond dimension $χ=4096$. Their classical benchmark required over 160 hours on a CPU cluster, failed to converge in the high-entanglement regime $t\in[5.2,6]$, and left the most challenging window of the experiment unverified. Here, we push the boundaries of classical simulation by exploiting the full $\mathrm{U}(1)\times\mathrm{SU}(2)$ symmetry of the Fermi-Hubbard Hamiltonian combined with GPU-accelerated tensor contractions. Reaching bond dimensions up to $χ\approx62{,}000$ on four NVIDIA H200 GPUs -- among the largest ever achieved in TDVP simulations and fifteen times larger than Q-CTRL's classical baseline -- we achieve fully converged results across the entire simulation window, including rigorous certification of the previously unresolved high-entanglement regime $t\in[5.2,6]$. We further advance the classical frontier to $t=7$, which lies beyond the quantum hardware experiment and any previously verified classical evolution of the full wavefunction. At the bond dimension comparable to Q-CTRL's best classical run, our GPU implementation completes in $\sim\!100$ minutes, directly reducing the claimed $3000\times$ quantum advantage to $\sim\!36\times$. These results substantially narrow the quantum-classical performance gap and establish a new standard for tensor-network benchmarking of large-scale quantum simulations.

Related papers

• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Efficient classical simulation of two-dimensional long-range systems: Rydberg arrays and beyond [19.772754216436983]
  In variational Monte Carlo calculations, evaluating the local energy generally costs $O(N3)$.<n>We introduce a new framework that reduces this cost to $O(N)$ for tensor network states.<n>We obtain accurate simulations of the adiabatic real-time protocol of a $10times10$ dipolar XY model realized in a Rydberg simulator.
  arXiv  Detail & Related papers  (2026-07-06T14:58:14Z)
• Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor [2.182919491659049]
  We report experimental digital quantum simulation of the one-dimensional Fermi-Hubbard model on a superconducting quantum processor.<n>We encode this problem using up to 120 qubits through an efficient mapping that reduces circuit complexity.<n>We improve accuracy through error suppression to simulate dynamical evolution using up to 90 Trotter steps.
  arXiv  Detail & Related papers  (2026-05-05T17:49:07Z)
• Hybrid Quantum-Classical Neural Networks for Few-Shot Credit Risk Assessment [52.05742536403784]
  This work tackles the challenge of few-shot credit risk assessment.<n>We design and implement a novel hybrid quantum-classical workflow.<n>A Quantum Neural Network (QNN) was trained via the parameter-shift rule.<n>On a real-world credit dataset of 279 samples, our QNN achieved a robust average AUC of 0.852 +/- 0.027 in simulations and yielded an impressive AUC of 0.88 in the hardware experiment.
  arXiv  Detail & Related papers  (2025-09-17T08:36:05Z)
• phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale [0.8223023312645978]
  Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms.<n>We present a full-state vector simulation algorithm and software implementation designed to perform HPC simulation of layers of rotations around a string of Pauli operators.
  arXiv  Detail & Related papers  (2025-04-24T18:41:23Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Quantum Calculation for Two-Stream Instability and Advection Test of Vlasov-Maxwell Equations: Numerical Evaluation of Hamiltonian Simulation [0.0]
  We develop a quantum-classical hybrid Vlasov-Maxwell solver. We perform numerical simulation of a 1D advection test and a 1D1V two-stream instability test. Our quantum algorithm is robust under larger time steps compared with classical algorithms.
  arXiv  Detail & Related papers  (2024-08-21T11:56:55Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Sachdev-Ye-Kitaev model on a noisy quantum computer [1.0377683220196874]
  We study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. We compute return probability after time $t$ and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.
  arXiv  Detail & Related papers  (2023-11-29T19:00:00Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• A Race Track Trapped-Ion Quantum Processor [0.0]
  We describe and benchmark a new quantum charge-coupled device based on a linear trap with periodic boundary conditions. The system is initially operated with 32 qubits, but future upgrades will allow for more.
  arXiv  Detail & Related papers  (2023-05-05T20:07:37Z)
• Classical Chaos in Quantum Computers [39.58317527488534]
  Current-day quantum processors, comprising 50-100 qubits, operate outside the range of quantum simulation on classical computers. We demonstrate that the simulation of classical limits can be a potent diagnostic tool potentially mitigating this problem. We find that classical and quantum simulations lead to similar stability metrics in systems with $mathcalO$ transmons.
  arXiv  Detail & Related papers  (2023-04-27T18:00:04Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.