Benchmarking quantum simulation at scale

• URL: http://arxiv.org/abs/2607.14212v1
• Date: Wed, 15 Jul 2026 18:00:01 GMT
• Title: Benchmarking quantum simulation at scale
• Abstract summary: We propose a scalable verification scheme for non-equilibrium quantum simulation based on stabilizer scars.<n>We show that the fidelity of quantum simulating these states bounds the fidelity of classically intractable simulations.
• Score: 0.8264316322451414
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The applications for which quantum computers will clearly outperform classical computers are still being identified and benchmarking such an advantage is challenging. We propose a scalable verification scheme for non-equilibrium quantum simulation based on stabilizer scars, a special class of quantum many-body scars, whose structure ensures both classical simulability and efficient direct fidelity estimation. Assuming a physically motivated error model, we show that the fidelity of quantum simulating these states bounds the fidelity of classically intractable simulations, providing a benchmark for quantum-advantage experiments in non-equilibrium dynamics.

Related papers

• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Fermionic dynamics on a trapped-ion quantum computer beyond exact classical simulation [0.024486319744627862]
  We implement an efficient quantum simulation algorithm on Quantinuum's System Model H2 trapped-ion quantum computer.<n>We focus on the periodic spinful 2D Fermi-Hubbard model and present evidence of spin-charge separation.<n>Our results herald the use of quantum computing for simulating strongly correlated electronic systems.
  arXiv  Detail & Related papers  (2025-10-30T09:39:02Z)
• Evaluating classical simulations with a quantum processor [0.5592394503914488]
  Scaling predictions are based on local structure and assumptions.<n>We use a quantum annealing processor to produce a ground truth for evaluating classical tensor-network methods.<n>Our results demonstrate that the virtuous cycle of competition between classical and quantum simulations can lend insight in both directions.
  arXiv  Detail & Related papers  (2025-08-21T17:55:53Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Digital quantum magnetism at the frontier of classical simulations [2.8109777276732992]
  We use Quantinuum's H2 quantum computer to simulate digitized dynamics of the quantum Ising model.<n>In addition to confirming the stability of dynamics subject to achievable digitization errors, we show direct evidence of the resultant local equilibration.
  arXiv  Detail & Related papers  (2025-03-26T18:00:02Z)
• Challenging the Quantum Advantage Frontier with Large-Scale Classical Simulations of Annealing Dynamics [0.0]
  Recent demonstrations of D-Wave's quantum simulators have established new benchmarks for quantum computational advantage.<n>We demonstrate that time-dependent variational Monte Carlo can efficiently simulate quantum annealing of spin glasses up to system sizes.
  arXiv  Detail & Related papers  (2025-03-11T10:09:37Z)
• Operationally classical simulation of quantum states [41.94295877935867]
  A classical state-preparation device cannot generate superpositions and hence its emitted states must commute.<n>We show that no such simulation exists, thereby certifying quantum coherence.<n>Our approach is a possible avenue to understand how and to what extent quantum states defy generic models based on classical devices.
  arXiv  Detail & Related papers  (2025-02-03T15:25:03Z)
• Efficient quantum-enhanced classical simulation for patches of quantum landscapes [0.0]
  We show that it is always possible to generate a classical surrogate of a sub-region of an expectation landscape produced by a parameterized quantum circuit.<n>We provide a quantum-enhanced classical algorithm which, after simple measurements on a quantum device, allows one to classically simulate approximate expectation values of a subregion of a landscape.
  arXiv  Detail & Related papers  (2024-11-29T18:00:07Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

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.