Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1704.04405 · Physical Review A

Classical simulation of quantum circuits by dynamical localization: Analytic results for Pauli-observable scrambling in time-dependent disorder

Adrian Chapman, Akimasa Miyake

Published Jul 10, 2018• 18 citations
arXivHTMLPDF

Abstract

We extend the concept of Anderson localization, the confinement of quantum information in a spatially irregular potential, to quantum circuits. Considering matchgate circuits, generated by time-dependent spin-$\frac{1}{2}$ $XY$ Hamiltonians, we give an analytic formula for the out-of-time-ordered correlator of a local observable and show that it can be efficiently evaluated by a classical computer even when the explicit Heisenberg time evolution cannot. Because this quantity bounds the average error incurred by truncating the evolution to a spatially limited region, we demonstrate dynamical localization as a means for classically simulating quantum computation and give examples of localized phases under certain spatiotemporal disordered Hamiltonians.

DOI
10.1103/physreva.98.012309

Related papers

Observation of Localization Using a Noisy Quantum Computer

Kazue Kudo

Quantum dynamics in a strongly disordered quantum many-body system show localization properties. The initial state memory is maintained owing to slow relaxation when the system is in the localized regime. This work demonstrates how localization can be observed using a noisy quantum computer by evaluating the magnetization and twist overlap in a quantum spin chain after short-time evolution. The quantities obtained from quantum-circuit simulation and real-device computation show their apparent dependence on disorder strength, although real-device computation suffers from noise-induced errors significantly. Using the exact diagonalization of the Hamiltonian, we analyze how noise-induced errors affect those quantities. The analysis also suggests how the twist overlap can reflect the information on the eigenstates of the Hamiltonian.

arXiv:2303.12309•Journal of the Physical Society of Japan•Jan 11, 2024•0 citations

Classical Simulation Healed by Quantum Entanglement

Jue Xu, Chu Zhao, Xiangran Zhang +2 more

Entanglement is not only the origin of exotic quantum phenomena, but also widely regarded as the fundamental barrier to classical simulation of quantum dynamics. We overturn this intuition: for predicting local observables under Hamiltonian evolution, entanglement in the quantum state actually heals the classical simulation error in the Heisenberg picture. Classical algorithms that propagate observables in the Pauli basis with proper truncation have shown remarkable empirical success in simulating noiseless quantum dynamics, yet all prior rigorous guarantees required noise or randomness---leaving the physically relevant noiseless regime without theoretical foundation. To close this gap, we prove that the truncation error of Low-weight Pauli Dynamics (LPD) admits an average-case bound without assuming randomness, provided the state is sufficiently entangled. Since tensor-network methods efficiently simulate low-entanglement states while LPD thrives precisely in the complementary regime, together they extend rigorous classical simulation to longer times, sharpening the boundary between classically simulable and genuinely quantum dynamics.

quant-pharXiv:2601.15770•Jan 23, 2026•6 citations

Quantum algorithms for disordered physics

Andrei Alexandru, Paulo F. Bedaque, Scott Lawrence

We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random-number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body disordered systems in the large volume limit, in particular, Anderson localization. The method requires a number of (error corrected) qubits proportional to the logarithm of the volume of the system, and each time evolution step requires a number of gates polylogarithmic in the volume. We simulate the method to observe the metal-insulator transition on a three-dimensional lattice. Additionally, we demonstrate the algorithm on a one-dimensional lattice, using physical quantum processors.

arXiv:1911.11117•Physical Review A•Mar 19, 2020•8 citations

Complex Quantum Dynamics Versus Classical Simulability of Noisy Random Circuits

Anjali Waghmare, Sergii Strelchuk, Sathyawageeswar Subramanian

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.

quant-pharXiv:2609.39734•Oct 1, 2026•0 citations

Fast scrambling in classically simulable quantum circuits

Mike Blake, Noah Linden, Anthony P. Thompson

We study operator scrambling in quantum circuits built from “super-Clifford” gates. For such circuits it was established by Blake and Linden [] that the time evolution of operator entanglement for a large class of many-body operators can be efficiently simulated on a classical computer, including for operators with volume-law entanglement. Here we extend the scope of this formalism in two key ways. First we provide evidence that these classically simulable circuits include examples of fast scramblers, by constructing a circuit for which operator entanglement is numerically found to saturate in a time t * ∼ ln ( N ) (with N the number of qubits). Second we demonstrate that, in addition to operator entanglement, certain out-of-time-ordered correlation functions (OTOCs) can be classically simulated within the same formalism. As a consequence such OTOCs can be computed numerically in super-Clifford circuits with thousands of qubits and we study several explicit examples in the aforementioned fast scrambling circuits.

arXiv:2410.19614•Physical Review A•Jun 12, 2025•0 citations

Pauli instability in arbitrary states: detecting magic in physical correlators

Tanner Jackson, Alexey Milekhin

Measures of non-stabilizerness (``magic'') of a quantum evolution quantify how hard it is to simulate on a classical computer. A natural question is how to extract information about magic from physical correlators, for example at finite temperature or in the ground state. In this paper we show how to measure magic using out-of-time-order correlators evaluated in an arbitrary state. For every full-rank state, and in particular for every Gibbs state, the resulting quantity vanishes if and only if the evolution is Clifford. We establish its basic properties, relate it to the stabilizer entropy of the Choi state, and prove that, even with a single fixed probe operator, it gives a lower bound on the number of $T$ gates needed to implement the dynamics in any circuit architecture.

quant-pharXiv:2609.40032•Oct 1, 2026•1 citation
We extend the concept of Anderson localization, the confinement of quantum information in a spatially irregular potential, to quantum circuits. Considering matchgate circuits, generated by time-dependent spin-12\frac{1}{2}21​ XYXYXY Hamiltonians, we give an analytic formula for the out-of-time-ordered correlator of a local observable and show that it can be efficiently evaluated by a classical computer even when the explicit Heisenberg time evolution cannot. Because this quantity bounds the average error incurred by truncating the evolution to a spatially limited region, we demonstrate dynamical localization as a means for classically simulating quantum computation and give examples of localized phases under certain spatiotemporal disordered Hamiltonians.
Quantum dynamics in a strongly disordered quantum many-body system show localization properties. The initial state memory is maintained owing to slow relaxation when the system is in the localized regime. This work demonstrates how localization can be observed using a noisy quantum computer by evaluating the magnetization and twist overlap in a quantum spin chain after short-time evolution. The quantities obtained from quantum-circuit simulation and real-device computation show their apparent dependence on disorder strength, although real-device computation suffers from noise-induced errors significantly. Using the exact diagonalization of the Hamiltonian, we analyze how noise-induced errors affect those quantities. The analysis also suggests how the twist overlap can reflect the information on the eigenstates of the Hamiltonian.
Entanglement is not only the origin of exotic quantum phenomena, but also widely regarded as the fundamental barrier to classical simulation of quantum dynamics. We overturn this intuition: for predicting local observables under Hamiltonian evolution, entanglement in the quantum state actually heals the classical simulation error in the Heisenberg picture. Classical algorithms that propagate observables in the Pauli basis with proper truncation have shown remarkable empirical success in simulating noiseless quantum dynamics, yet all prior rigorous guarantees required noise or randomness---leaving the physically relevant noiseless regime without theoretical foundation. To close this gap, we prove that the truncation error of Low-weight Pauli Dynamics (LPD) admits an average-case bound without assuming randomness, provided the state is sufficiently entangled. Since tensor-network methods efficiently simulate low-entanglement states while LPD thrives precisely in the complementary regime, together they extend rigorous classical simulation to longer times, sharpening the boundary between classically simulable and genuinely quantum dynamics.
We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random-number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body disordered systems in the large volume limit, in particular, Anderson localization. The method requires a number of (error corrected) qubits proportional to the logarithm of the volume of the system, and each time evolution step requires a number of gates polylogarithmic in the volume. We simulate the method to observe the metal-insulator transition on a three-dimensional lattice. Additionally, we demonstrate the algorithm on a one-dimensional lattice, using physical quantum processors.
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+TTT 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.
We study operator scrambling in quantum circuits built from “super-Clifford” gates. For such circuits it was established by Blake and Linden [] that the time evolution of operator entanglement for a large class of many-body operators can be efficiently simulated on a classical computer, including for operators with volume-law entanglement. Here we extend the scope of this formalism in two key ways. First we provide evidence that these classically simulable circuits include examples of fast scramblers, by constructing a circuit for which operator entanglement is numerically found to saturate in a time t * ∼ ln ( N ) (with N the number of qubits). Second we demonstrate that, in addition to operator entanglement, certain out-of-time-ordered correlation functions (OTOCs) can be classically simulated within the same formalism. As a consequence such OTOCs can be computed numerically in super-Clifford circuits with thousands of qubits and we study several explicit examples in the aforementioned fast scrambling circuits.
Measures of non-stabilizerness (``magic'') of a quantum evolution quantify how hard it is to simulate on a classical computer. A natural question is how to extract information about magic from physical correlators, for example at finite temperature or in the ground state. In this paper we show how to measure magic using out-of-time-order correlators evaluated in an arbitrary state. For every full-rank state, and in particular for every Gibbs state, the resulting quantity vanishes if and only if the evolution is Clifford. We establish its basic properties, relate it to the stabilizer entropy of the Choi state, and prove that, even with a single fixed probe operator, it gives a lower bound on the number of TTT gates needed to implement the dynamics in any circuit architecture.