Simulation of noisy quantum circuits using frame representations
quant-ph
Submitted: 2026-01-08
Updated: 2026-11-16
Comments: 27 pages, 6 figures
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: One of the core research questions in the theory of quantum computing is to find out to what precise extent the classical simulation of a noisy quantum circuits is possible and where potential…
Terminology
Abstract
One of the core research questions in the theory of quantum computing is to find out to what precise extent the classical simulation of a noisy quantum circuits is possible and where potential quantum advantages can set in. In this work, we introduce a unified framework for the classical simulation of quantum circuits based on frame theory, encompassing and generalizing a broad class of existing simulation strategies. Within this framework, the computational cost of a simulation algorithm is determined by the one-norm of an associated quasi-probability distribution, providing a common quantitative measure across different simulation approaches. This enables a comprehensive perspective on common methods for the simulation of noisy circuits based on different quantum resources, such as entanglement or non-stabilizerness. It further provides a clear scheme for generating novel classical simulation algorithms. Indeed, by exploring different choices of frames within this formalism and resorting to tools of convex optimization, we are able not only to obtain new insights and improved bounds for existing methods -- such as stabilizer state simulation or Pauli back-propagation -- but also to discover a new approach with an improved performance based on a generalization of the Pauli frame. We, thereby, show that classical simulation techniques can directly benefit from a perspective -- that of frames -- that goes beyond the traditional classification of quantum resources.
Sources
- Efficient classical simulation of noisy quantum computation
- Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
- Gaussian decomposition of magic states for matchgate computations
- Classically estimating observables of noiseless quantum circuits
- Simulating quantum circuits with arbitrary local noise using Pauli Propagation
- A polynomial-time classical algorithm for noisy quantum circuits
- Noise-induced shallow circuits and absence of barren plateaus
- Quantum universality by state distillation
- Systematic benchmarking of quantum computers: status and recommendations
- The EU Quantum Flagship's Key Performance Indicators for Quantum Computing
- Average-computation benchmarking for local expectation values in digital quantum devices
- Mind the gaps: The fraught road to quantum advantage
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements