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.
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.
Quantum simulation provides a route to studying the real-time dynamics of strongly correlated quantum many-body systems beyond the reach of classical computation. This thesis focuses on two central obstacles that limit its practical utility: the high cost of implementing the required quantum circuits and the challenge of verifying their output in regimes where classical benchmarks are unavailable. Both issues are addressed by exploiting structure, either through prior physical knowledge of the target system or through special properties of selected quantum states, to reduce simulation overhead and to develop new techniques for quantum verification. The background on which this work rests is assembled first: why classical simulation of quantum many-body systems is hard, why a quantum approach built on real-time evolution offers a way past these barriers, and the recurring tools the thesis relies on, including the thermalization of isolated quantum systems, the stabilizer formalism, and lattice gauge theories. Next, known structure is exploited to reduce the cost of computing spectral densities and response functions, quantities at the heart of the description of nuclear reactions. Recasting the Gaussian integral transform of the response in a Fourier basis turns the moments that determine the spectrum into expectation values of real-time evolution, measurable directly on a quantum computer. Prior knowledge of the low-order energy moments, the mean and variance, then allows the transform to be centered and rescaled so that far fewer evolution times are needed to resolve the response. Turning from exploiting structure to discovering it, an exactly solvable form of weak ergodicity breaking is identified. In a 2+1-dimensional Z2 lattice gauge theory, a family of quantum many-body scars is shown to be composed entirely of stabilizer states. These scars carry exactly zero magic and exactly zero distillable entanglement, making them classically simple by both resource measures even as they sit within otherwise thermalizing, classically intractable dynamics, and their anomalous behavior is traced to an underlying commutant algebra. This structure is then put to work as a verification tool. Because the stabilizer scars span a small, dynamically isolated subspace, their evolution can be computed exactly by classical means, and bounds on their non-stabilizerness ensure efficient direct fidelity estimation. Together these properties yield a self-contained and scalable benchmark: the measured fidelity of the scar states, compared against their exact classical prediction, quantifies the accuracy of the simulator and in turn bounds the fidelity of the genuinely intractable, non-scar dynamics run on the same device. The result is a concrete strategy for benchmarking quantum simulation at scale, in the regime where a classical check would otherwise be unavailable. Finally, these results are drawn together, reflecting on what the shared strategy of exploiting structure achieves and where its limits lie, and sketching directions for extending it to richer systems and harder simulation tasks.
Creating scalable, reliable, and well-motivated benchmarks for quantum computers is challenging: straightforward approaches to benchmarking suffer from exponential scaling, are insensitive to important errors, or use poorly-motivated performance metrics. Furthermore, curated benchmarking suites cannot include every interesting quantum circuit or algorithm, which necessitates a tool that enables the easy creation of new benchmarks. In this work, we introduce a software tool for creating scalable and reliable benchmarks that measure a well-motivated performance metric (process fidelity) from user-chosen quantum circuits and algorithms. Our software, called scarab, enables the creation of efficient and robust benchmarks even from circuits containing thousands or millions of qubits, by employing efficient fidelity estimation techniques, including mirror circuit fidelity estimation and subcircuit volumetric benchmarking. scarab provides a simple interface that enables the creation of reliable benchmarks by users who are not experts in the theory of quantum computer benchmarking or noise. We demonstrate the flexibility and power of scarab by using it to turn existing inefficient benchmarks into efficient benchmarks, to create benchmarks that interrogate hardware and algorithmic trade-offs in Hamiltonian simulation, to quantify the in-situ efficacy of approximate circuit compilation, and to create benchmarks that use subcircuits to measure progress towards executing a circuit of interest.
Several quantum hardware platforms, while being unable to perform fully fault-tolerant quantum computation, can still be operated as analogue quantum simulators for addressing many-body problems. However, due to the presence of errors, it is not clear to what extent those devices can provide us with an advantage with respect to classical computers. In this work, we make progress on this problem for noisy analogue quantum simulators computing physically relevant properties of many-body systems both in equilibrium and undergoing dynamics. We first formulate a system-size independent notion of stability against extensive errors, which we prove for Gaussian fermion models, as well as for a restricted class of spin systems. Remarkably, for the Gaussian fermion models, our analysis shows the stability of critical models which have long-range correlations. Furthermore, we analyze how this stability may lead to a quantum advantage, for the problem of computing the thermodynamic limit of many-body models, in the presence of a constant error rate and without any explicit error correction.
While quantum computers promise to solve classically intractable problems, identifying the point at which fault-tolerant quantum computation outperforms the best classical algorithms for practical applications remains an outstanding challenge. Here we establish a concrete quantum-classical crossover for quantum many-body dynamics under realistic hardware conditions. We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations, suppressing the residual logical errors that limit existing partially fault-tolerant approaches. A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics at modest system sizes. For a physical error rate of p=10−3, fault-tolerant simulation requires approximately 2 hours and 3.7×105 physical qubits for a 100-site 1D system, whereas tensor network approaches would require about 100 years. For 2D models, where rapid entanglement growth limits the classical evolution time, we project quantum runtimes within minutes. A physical error rate of p=10−4 leads to at least an order of magnitude reduction in qubit count (3.1×104 physical qubits) and runtime (minutes for 1D and seconds for 2D). The reduction in quantum runtime arises from our improved rotation-state injection and co-design of quantum error correction and observable-estimation protocols, which jointly suppress logical-error accumulation and reduce sampling overhead. Our results establish a scalable route towards practical quantum advantage and identify quantitative engineering targets for future fault-tolerant architectures.
As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized benchmarking, cannot efficiently check correctness of most of the processes involved. In particular non-Clifford gates are a requirement for not only universal quantum computation but for any algorithm or quantum simulation that yields fundamental speedup in comparison with its classical counterpart. We show that it is in fact still possible to validate such non-simulable processes by taking advantage of expected or engineered conservations laws in the system, combined with a unitary one-design strategy to randomize errors over the computational Hilbert space. We show that in the context of (fault-tolerant) quantum error correction, we can construct a one-design using the logically encoded Clifford group over the engineered error-free stabilizer subspace to obtain average error for arbitrary logically-encoded gates and algorithms. In the case of benchmarking simulation of physical systems, these can have various exotic symmetries over which one-design strategies can nonetheless be constructed. We give examples for fermionic systems which conserve particle number, as well as for the Fermi-Hubbard model. The symmetry benchmarking method preserves robustness to state preparation and measurement imperfections.
The predictive success of quantum mechanics underpins many areas of modern science, even as the exact simulation of large, interacting quantum systems remains beyond the reach of classical computation. This success has been enabled by the remarkable advancement of scalable numerical approximation methods, which often demonstrate practical accuracy despite the absence of formal guarantees. As quantum simulation pushes into regimes where these approximations struggle, a fundamental challenge arises: How can quantum outcomes be trusted when reliable classical benchmarks are unavailable? Here, we establish a framework for the independent validation of quantum estimates in this setting and present evidence that they provide the most credible result among several considered methods, in the absence of an immediately accessible ground-truth solution. We apply our framework to the semi-scrambling dynamics of a physical model that strains several leading classical simulation methods yet remains experimentally accessible, in part through our introduction of the \textit{operator Loschmidt echo}. We systematically design a series of experiments using quantum heuristics that, taken together, test the underlying assumptions and provide strong confidence in the observable estimates obtained from the quantum computer. We then show how this framework can be extended to place accuracy bounds on quantum estimates via careful characterization and manipulation of the device noise, transforming the problem of validating the observable estimation to validating the noise model. These results establish a route towards trusted quantum computation for scientific discovery, independent of classical verification.