Complex Quantum Dynamics Versus Classical Simulability of Noisy Random Circuits
quant-ph
Submitted: 2026-09-30
Updated: 2026-09-30
Comments: 28 pages, 3 figures
Code: https://github.com/anjaliwgh/noisy-quantum-diagnostics-simulability
License: http://creativecommons.org/licenses/by/4.0/
The gist: Claims of quantum advantage rest on the classical hardness of simulating quantum circuits.
Terminology
Abstract
Claims of quantum advantage rest on the classical hardness of simulating quantum circuits. Magic, operator scrambling, anticoncentration, and non-Gaussianity for fermionic circuits are standard diagnostics of complex quantum dynamics. For pure states, some of these have been rigorously connected to classical simulability. Whether these diagnostics reliably track the limits of efficient classical simulation under noise remains unclear. Here, we show that in noisy Clifford+ T and nearest-neighbour matchgate+SWAP circuits, dynamical diagnostics and classical simulability can separate in both directions. In particular, the diagnostics can remain nontrivial after classical simulation becomes efficient, or become trivial before known efficient classical algorithms apply. We trace this mismatch to the different statistical properties they probe: magic and scrambling depend on fourth-order statistics of the Pauli spectrum, whereas the simulation algorithms depend primarily on second-order moments, which local noise suppresses at different rates. Thus, dynamical diagnostics measured on a noisy quantum device do not by themselves constitute evidence for classical hardness.
Sources
- Noise and the frontier of quantum supremacy
- A polynomial-time classical algorithm for noisy quantum circuits
- Solving the sampling problem of the Sycamore quantum circuits
- Simulating quantum circuits with arbitrary local noise using Pauli Propagation
- Simulation of Fermionic circuits using Majorana Propagation
- Stabilizer entropies and nonstabilizerness monotones
- A bound on chaos
- Chaos in quantum channels
- Operator Spreading in Random Unitary Circuits
- Information Scrambling in Computationally Complex Quantum Circuits
- Fermionic Linear Optics and Matchgates
- Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
- Noise-induced Simulability Transition from Operator Scrambling
- A complete theory of the Clifford commutant
- Quantum Complexity and Chaos in Many-Qudit Doped Clifford Circuits
- Classical simulation of a quantum circuit with noisy magic inputs
- Magic spreading in random quantum circuits
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians