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:2502.20455 · Physical Review X

Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudomagic States

Beatrice Magni, Alexios Christopoulos, Andrea De Luca, Xhek Turkeshi

Published Aug 15, 2025• 39 citations
arXivHTMLPDF

Abstract

Anticoncentration describes how an ensemble of quantum states spreads over the allowed Hilbert space, leading to statistically uniform output probability distributions. In this work, we investigate the anticoncentration of random Clifford circuits toward the overlap distribution of random stabilizer states. Using exact analytical techniques and extensive numerical simulations based on Clifford replica tensor networks, we demonstrate that random Clifford circuits fully anticoncentrate in logarithmic circuit depth; namely, higher-order moments of the overlap distribution converge to those of random stabilizer states. Moreover, we investigate the effect of introducing a controlled number of non-Clifford (magic) resources into Clifford circuits. We show that inserting a polylogarithmic in qudit number of T states is sufficient to drive the overlap distribution toward the Porter-Thomas statistics, effectively recovering full quantum randomness. In short, this fact presents doped tensor networks and shallow Clifford circuits as pseudomagic quantum states. Our results clarify the interplay between Clifford dynamics, magic-state injection, and quantum complexity, with implications for quantum circuit sampling, many-body quantum physics, and the benchmarking of quantum computational advantage.

DOI
10.1103/p8dn-glcw

Related papers

Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks

Beatrice Magni, Markus Heinrich, Lorenzo Leone +1 more

We investigate the statistical properties of orthogonal, or real, Clifford circuits doped with magic and imaginary resources. By developing the Weingarten calculus for the real Clifford group, we derive the exact overlap distribution of real stabilizer states, identifying a new universality class: the orthogonal Clifford Porter-Thomas distribution. We prove that local real architectures recover this global statistic in logarithmic depth. Furthermore, we uncover a sharp hierarchy in resource requirements: while retrieving Haar statistics necessitates a polylogarithmic amount of magic states, recovering the full unitary Clifford statistics requires only a single phase gate.

quant-pharXiv:2512.15880•Physical Review A•Dec 19, 2025•18 citations

Limits of Clifford Disentangling in Tensor Network States

Sergi Masot-Llima, Piotr Sierant, Paolo Stornati +1 more

Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic and are thus also classically tractable. Clifford tensor networks combine the benefits of both approaches, exploiting Clifford circuits to reduce the classical complexity of the tensor network description of states, with promising effects on simulation approaches. We study the disentangling power of Clifford transformations acting on tensor networks, with a particular emphasis on entanglement cooling strategies. We identify regimes where exact or heuristic Clifford disentanglers are effective, explain the link between the two approaches, and characterize their breakdown as non-Clifford resources accumulate. Additionally, we prove that, beyond stabilizer settings, no Clifford operation can universally disentangle even a single qubit from an arbitrary non-Clifford rotation. Our results clarify both the capabilities and fundamental limitations of Clifford-based simulation methods.

quant-pharXiv:2602.15942•Physical review. B./Physical review. B•Feb 19, 2026•4 citations

Quantum Complexity and Chaos in Many-Qudit Doped Clifford Circuits

Beatrice Magni, Xhek Turkeshi

We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension d . Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results and perform large-scale simulations in regimes challenging for tensor network and Pauli-based methods. We begin by analyzing generalized stabilizer entropies, computable magic monotones in many-qudit systems, and identify a dynamical phase transition in the doping rate, marking the breakdown of classical simulability and the onset of Haar-random behavior. The critical behavior is governed by the qudit dimension and the magic content of the non-Clifford gate. Using the qudit T -gate as a benchmark, we show that higher-dimensional qudits converge faster to Haar-typical stabilizer entropies. For qutrits ( d = 3 ), analytical predictions match numerics on brickwork circuits, showing that locality plays a limited role in magic spreading. We also examine anticoncentration and entanglement growth, showing that O ( log ⁡ N ) non-Clifford gates suffice for approximating Haar expectation values to precision ε , and relate antiflatness measures to stabilizer entropies in qutrit systems. Finally, we analyze out-of-time-order correlators and show that a finite density of non-Clifford gates is needed to induce chaos, with a sharp transition fixed by the local dimension, twice that of the magic transition. Altogether, these results establish a unified framework for diagnosing complexity in doped Clifford circuits and deepen our understanding of resource theories in multiqudit systems.

arXiv:2506.02127•Quantum•Dec 24, 2025•27 citations

Stabilizer Tensor Networks with Magic State Injection

Azar C. Nakhl, Ben Harper, Maxwell T. West +4 more

This Letter augments the recently introduced stabilizer tensor network (STN) protocol with magic state injection, reporting a new framework with significantly enhanced ability to simulate circuits with an extensive number of non-Clifford operations. Specifically, for random T-doped N-qubit Clifford circuits the computational cost of circuits prepared with magic state injection scales as O[poly(N)] when the circuit has t≲N T gates compared to an exponential scaling for the STN approach, which is demonstrated in systems of up to 200 qubits. In the case of the hidden bit shift circuit, a paradigmatic benchmarking system for extended stabilizer methods with a tunable amount of magic, we report that our magic state injected STN framework can efficiently simulate 4000 qubits and 320T gates. These findings provide a promising outlook for the use of this protocol in the classical modeling of quantum circuits that are conventionally difficult to simulate efficiently.

arXiv:2411.12482•Physical Review Letters•May 15, 2025•31 citations

Magic spreading in random quantum circuits

Xhek Turkeshi, Emanuele Tirrito, Piotr Sierant

Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error correction and computation. In this paper, we investigate how fast generic many-body dynamics generate magic resources under the constraints of locality and unitarity, focusing on magic spreading in brick-wall random unitary circuits. We explore scalable magic measures intimately connected to the algebraic structure of the Clifford group. These metrics enable the investigation of the spreading of magic for system sizes of up to N = 1024 qudits, surpassing the previous state-of-the-art, which was restricted to about a dozen qudits. We demonstrate that magic resources equilibrate on timescales logarithmic in the system size, akin to anti-concentration and Hilbert space delocalization phenomena, but qualitatively different from the spreading of entanglement entropy. As random circuits are minimal models for chaotic dynamics, we conjecture that our findings describe the phenomenology of magic resources growth in a broad class of chaotic many-body systems.

arXiv:2407.03929•Nature Communications•Mar 15, 2025•106 citations

Anticoncentration and State Design of Random Tensor Networks

Guglielmo Lami, Jacopo De Nardis, Xhek Turkeshi

We investigate quantum random tensor network states in which the dimension of the bond scales polynomially with the size of the system N. Specifically, we examine the delocalization properties of random matrix product states (RMPS) in the computational basis by deriving an exact analytical expression for the inverse participation ratio (IPR) of any degree, applicable to both open and closed boundary conditions. For bond dimensions χ∼γN, we determine the leading order of the associated overlaps probability distribution and demonstrate its convergence to the Porter-Thomas distribution, characteristic of Haar-random states, as γ increases. Additionally, we provide numerical evidence for the frame potential, measuring the 2-distance from the Haar ensemble, which confirms the convergence of random MPS to Haar-like behavior for χ≫sqrt[N]. We extend this analysis to two-dimensional systems using random projected entangled pair states, where we similarly observe the convergence of IPRs to their Haar values for χ≫sqrt[N]. These findings demonstrate that random tensor networks with bond dimensions scaling polynomially in the system size are fully Haar anticoncentrated and approximate unitary designs, regardless of the spatial dimension.

arXiv:2409.13023•Physical Review Letters•Jan 2, 2025•23 citations
Anticoncentration describes how an ensemble of quantum states spreads over the allowed Hilbert space, leading to statistically uniform output probability distributions. In this work, we investigate the anticoncentration of random Clifford circuits toward the overlap distribution of random stabilizer states. Using exact analytical techniques and extensive numerical simulations based on Clifford replica tensor networks, we demonstrate that random Clifford circuits fully anticoncentrate in logarithmic circuit depth; namely, higher-order moments of the overlap distribution converge to those of random stabilizer states. Moreover, we investigate the effect of introducing a controlled number of non-Clifford (magic) resources into Clifford circuits. We show that inserting a polylogarithmic in qudit number of T states is sufficient to drive the overlap distribution toward the Porter-Thomas statistics, effectively recovering full quantum randomness. In short, this fact presents doped tensor networks and shallow Clifford circuits as pseudomagic quantum states. Our results clarify the interplay between Clifford dynamics, magic-state injection, and quantum complexity, with implications for quantum circuit sampling, many-body quantum physics, and the benchmarking of quantum computational advantage.
We investigate the statistical properties of orthogonal, or real, Clifford circuits doped with magic and imaginary resources. By developing the Weingarten calculus for the real Clifford group, we derive the exact overlap distribution of real stabilizer states, identifying a new universality class: the orthogonal Clifford Porter-Thomas distribution. We prove that local real architectures recover this global statistic in logarithmic depth. Furthermore, we uncover a sharp hierarchy in resource requirements: while retrieving Haar statistics necessitates a polylogarithmic amount of magic states, recovering the full unitary Clifford statistics requires only a single phase gate.
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic and are thus also classically tractable. Clifford tensor networks combine the benefits of both approaches, exploiting Clifford circuits to reduce the classical complexity of the tensor network description of states, with promising effects on simulation approaches. We study the disentangling power of Clifford transformations acting on tensor networks, with a particular emphasis on entanglement cooling strategies. We identify regimes where exact or heuristic Clifford disentanglers are effective, explain the link between the two approaches, and characterize their breakdown as non-Clifford resources accumulate. Additionally, we prove that, beyond stabilizer settings, no Clifford operation can universally disentangle even a single qubit from an arbitrary non-Clifford rotation. Our results clarify both the capabilities and fundamental limitations of Clifford-based simulation methods.
We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension d . Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results and perform large-scale simulations in regimes challenging for tensor network and Pauli-based methods. We begin by analyzing generalized stabilizer entropies, computable magic monotones in many-qudit systems, and identify a dynamical phase transition in the doping rate, marking the breakdown of classical simulability and the onset of Haar-random behavior. The critical behavior is governed by the qudit dimension and the magic content of the non-Clifford gate. Using the qudit T -gate as a benchmark, we show that higher-dimensional qudits converge faster to Haar-typical stabilizer entropies. For qutrits ( d = 3 ), analytical predictions match numerics on brickwork circuits, showing that locality plays a limited role in magic spreading. We also examine anticoncentration and entanglement growth, showing that O ( log ⁡ N ) non-Clifford gates suffice for approximating Haar expectation values to precision ε , and relate antiflatness measures to stabilizer entropies in qutrit systems. Finally, we analyze out-of-time-order correlators and show that a finite density of non-Clifford gates is needed to induce chaos, with a sharp transition fixed by the local dimension, twice that of the magic transition. Altogether, these results establish a unified framework for diagnosing complexity in doped Clifford circuits and deepen our understanding of resource theories in multiqudit systems.
This Letter augments the recently introduced stabilizer tensor network (STN) protocol with magic state injection, reporting a new framework with significantly enhanced ability to simulate circuits with an extensive number of non-Clifford operations. Specifically, for random T-doped N-qubit Clifford circuits the computational cost of circuits prepared with magic state injection scales as O[poly(N)] when the circuit has t≲N T gates compared to an exponential scaling for the STN approach, which is demonstrated in systems of up to 200 qubits. In the case of the hidden bit shift circuit, a paradigmatic benchmarking system for extended stabilizer methods with a tunable amount of magic, we report that our magic state injected STN framework can efficiently simulate 4000 qubits and 320T gates. These findings provide a promising outlook for the use of this protocol in the classical modeling of quantum circuits that are conventionally difficult to simulate efficiently.
Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error correction and computation. In this paper, we investigate how fast generic many-body dynamics generate magic resources under the constraints of locality and unitarity, focusing on magic spreading in brick-wall random unitary circuits. We explore scalable magic measures intimately connected to the algebraic structure of the Clifford group. These metrics enable the investigation of the spreading of magic for system sizes of up to N = 1024 qudits, surpassing the previous state-of-the-art, which was restricted to about a dozen qudits. We demonstrate that magic resources equilibrate on timescales logarithmic in the system size, akin to anti-concentration and Hilbert space delocalization phenomena, but qualitatively different from the spreading of entanglement entropy. As random circuits are minimal models for chaotic dynamics, we conjecture that our findings describe the phenomenology of magic resources growth in a broad class of chaotic many-body systems.
We investigate quantum random tensor network states in which the dimension of the bond scales polynomially with the size of the system N. Specifically, we examine the delocalization properties of random matrix product states (RMPS) in the computational basis by deriving an exact analytical expression for the inverse participation ratio (IPR) of any degree, applicable to both open and closed boundary conditions. For bond dimensions χ∼γN, we determine the leading order of the associated overlaps probability distribution and demonstrate its convergence to the Porter-Thomas distribution, characteristic of Haar-random states, as γ increases. Additionally, we provide numerical evidence for the frame potential, measuring the 2-distance from the Haar ensemble, which confirms the convergence of random MPS to Haar-like behavior for χ≫sqrt[N]. We extend this analysis to two-dimensional systems using random projected entangled pair states, where we similarly observe the convergence of IPRs to their Haar values for χ≫sqrt[N]. These findings demonstrate that random tensor networks with bond dimensions scaling polynomially in the system size are fully Haar anticoncentrated and approximate unitary designs, regardless of the spatial dimension.