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:2312.02039 · Physical Review Research

Entanglement – nonstabilizerness separation in hybrid quantum circuits

Gerald E. Fux, Emanuele Tirrito, Marcello Dalmonte, Rosario Fazio

Published Oct 30, 2024• 72 citations
arXivHTMLPDF

Abstract

Nonstabilizerness describes the distance of a quantum state to its closest stabilizer state. It is—like entanglement—a necessary resource for a quantum advantage over classical computing. We study nonstabilizerness, quantified by stabilizer entropy, in a hybrid quantum circuit with projective measurements and a controlled injection of non-Clifford resources. We discover a phase transition between a power law and constant scaling of nonstabilizerness with system size controlled by the rate of measurements. The same circuit also exhibits a phase transition in entanglement that appears, however, at a different critical measurement rate. This mechanism shows how, from the viewpoint of a quantum advantage, hybrid circuits can host multiple distinct transitions where not only entanglement, but also other nonlinear properties of the density matrix come into play. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.l042030

Related papers

Magic transition in measurement-only circuits

Poetri Sonya Tarabunga, Emanuele Tirrito

Magic, or nonstabilizerness, quantifies the distance of a quantum state from stabilizer states and serves as a resource for quantum computational advantage. Here, we investigate magic transitions in measurement-only quantum circuits comprising competing Clifford and non-Clifford measurements. Remarkably, this circuit can be mapped onto a classical model, enabling efficient large-scale numerical simulations and exact characterization of magic using measures that are additive for tensor products of single-qubit states. We identify a magic transition between two phases exhibiting extensive magic, separated by a critical point where mutual magic displays scaling analogous to entanglement entropy. Additionally, these distinct phases can be distinguished by topological magic. In contrast, with a vanishing rate of non-Clifford measurements, the system exhibits saturation of magic. Our results clarify the nature of magic and its linear combinations in quantum circuits utilizing genuine magic measures, thereby advancing our understanding of quantum complexity in monitored quantum systems.

arXiv:2407.15939•npj Quantum Information•Oct 21, 2025•34 citations

Dynamical Magic Transitions in Monitored Clifford+ T Circuits

Mircea Bejan, Campbell McLauchlan, Benjámin Béri

The classical simulation of highly entangling quantum dynamics is conjectured to be generically hard. Thus, recently discovered measurement-induced transitions between highly entangling and low-entanglement dynamics are phase transitions in classical simulability. Here, we study simulability transitions beyond entanglement: noting that some highly entangling dynamics (e.g., integrable systems or Clifford circuits) are easy to classically simulate, thus requiring “magic”—a subtle form of quantum resource—to achieve computational hardness, we ask how the dynamics of magic competes with measurements. We study the resulting “dynamical magic transitions” focusing on random monitored Clifford circuits doped by T gates (injecting magic). We identify dynamical “stabilizer purification”—the collapse of a superposition of stabilizer states by measurements—as the mechanism driving this transition. We find cases where transitions in magic and entanglement coincide, but also others with a magic and simulability transition in a highly (volume-law) entangled phase. In establishing our results, we use Pauli-based computation, a scheme distilling the quantum essence of the dynamics to a magic state register subject to mutually commuting measurements. We link stabilizer purification to “magic fragmentation” wherein these measurements separate into disjoint, O ( 1 ) -weight blocks, and relate this to the spread of magic in the original circuit becoming arrested. Published by the American Physical Society 2024

arXiv:2312.00132•PRX Quantum•Aug 13, 2024•83 citations

Phase transition in stabilizer entropy and efficient purity estimation

Lorenzo Leone, Salvatore F. E. Oliviero, Gianluca Esposito +1 more

Stabilizer entropy (SE) quantifies the spread of a state in the basis of Pauli operators. It is a computationally tractable measure of nonstabilizerness and thus a useful resource for quantum computation. SE can be moved around a quantum system, effectively purifying a subsystem from its complex features. We show that there is a phase transition in the residual subsystem SE as a function of the density of non-Clifford resources. This phase transition has important operational consequences: it marks the onset of a subsystem purity estimation protocol that requires $poly(n)exp(t)$ many queries to a circuit containing $t$ non-Clifford gates that prepares the state from a stabilizer state. Then, for $t=O({log}_{2}n)$, it estimates the purity with polynomial resources, and, for highly entangled states, attains an exponential speed-up over the known state-of-the-art algorithms.

arXiv:2302.07895•Physical Review A•Mar 1, 2024•39 citations

Nonstabilizerness entanglement entropy: A measure of hardness in the classical simulation of quantum many-body systems with tensor network states

Jiale Huang, Xiangjian Qian, Mingpu Qin

Classical and quantum states can be distinguished by entanglement entropy, which can be viewed as a measure of quantum resources. Entanglement entropy also plays a pivotal role in understanding computational complexity in simulating quantum systems. However, stabilizer states formed solely by Clifford gates can be efficiently simulated with the tableau algorithm according to the Gottesman-Knill theorem, although they can host large entanglement entropy. In this work, we introduce the concept of non-stabilizerness entanglement entropy which is basically the minimum residual entanglement entropy for a quantum state by excluding the contribution from Clifford circuits. It can serve as a new practical and better measure of difficulty in the classical simulation of quantum many-body systems. We discuss why it is a better criterion than previously proposed metrics such as Stabilizer Rényi Entropy. We also show numerical results of non-stabilizerness entanglement entropy with concrete quantum many-body models. The concept of non-stabilizerness entanglement entropy expands our understanding of the ``hardness`` in the classical simulation of quantum many-body systems.

arXiv:2409.16895•Physical Review A•Jul 3, 2025•37 citations

Spreading of Magic Resource under Unitary Clifford Dynamics

Mircea Bejan, Pieter W. Claeys, Jiangtian Yao

Nonstabilizerness, or quantum magic resource, presents a valuable resource in quantum error correction and computation. We study the dynamics of locally injected nonstabilizerness in unitary Clifford circuits, where the total nonstabilizerness is conserved. However, the absence of physical observables quantifying nonstabilizerness precludes a direct microscopic or hydrodynamic description of its local distribution and dynamics. Using insights from stabilizer quantum error correcting codes, we rigorously show that the spatial distribution of nonstabilizerness can be inferred from a canonical representation of low-magic states, dubbed the bipartite magic gauge. Moreover, we propose two operationally relevant magic length scales. We numerically establish that, at early times, both length scales grow ballistically at distinct velocities set by the entanglement velocity, after which nonstabilizerness delocalizes. Our work sheds light on the spatiotemporal structure of quantum resources and complexity in many-body dynamics, opening up avenues for investigating their transport properties and further connections with quantum error correction.

quant-pharXiv:2511.21487•Physical Review Letters•Nov 27, 2025•12 citations

Nonstabilizerness of the entangling layer in quantum circuit Born machines

Marcin Płodzień

The entangling layer of a quantum circuit Born machine can supply both entanglement and nonstabilizerness. In this work we show that the entangling layer can be a Clifford circuit, which supplies no nonstabilizerness. We use an architecture in which a fixed, non-trainable entangler is reused in every layer and only single-qubit rotations are optimized. There, a Clifford entangler reaches the same Kullback--Leibler divergence as a near-Haar one at sufficient circuit depth, and entanglers spanning zero to Haar-typical nonstabilizerness reach the same loss, up to a small offset for a free-fermion matchgate entangler. A doping control that raises the entangler's nonstabilizerness while leaving the entangling power of every gate unchanged leaves the loss flat. With a Clifford entangler the nonstabilizerness of the trained state comes entirely from the rotations, which take the trained circuit outside the stabilizer formalism. We also show that, among all pure states whose Born distribution is a given target, the one whose amplitudes are the positive square roots of the probabilities has the smallest stabilizer Rényi entropy, so this minimum can be computed without training.

quant-pharXiv:2609.32025•Sep 29, 2026•1 citation
Nonstabilizerness describes the distance of a quantum state to its closest stabilizer state. It is—like entanglement—a necessary resource for a quantum advantage over classical computing. We study nonstabilizerness, quantified by stabilizer entropy, in a hybrid quantum circuit with projective measurements and a controlled injection of non-Clifford resources. We discover a phase transition between a power law and constant scaling of nonstabilizerness with system size controlled by the rate of measurements. The same circuit also exhibits a phase transition in entanglement that appears, however, at a different critical measurement rate. This mechanism shows how, from the viewpoint of a quantum advantage, hybrid circuits can host multiple distinct transitions where not only entanglement, but also other nonlinear properties of the density matrix come into play. Published by the American Physical Society 2024
Magic, or nonstabilizerness, quantifies the distance of a quantum state from stabilizer states and serves as a resource for quantum computational advantage. Here, we investigate magic transitions in measurement-only quantum circuits comprising competing Clifford and non-Clifford measurements. Remarkably, this circuit can be mapped onto a classical model, enabling efficient large-scale numerical simulations and exact characterization of magic using measures that are additive for tensor products of single-qubit states. We identify a magic transition between two phases exhibiting extensive magic, separated by a critical point where mutual magic displays scaling analogous to entanglement entropy. Additionally, these distinct phases can be distinguished by topological magic. In contrast, with a vanishing rate of non-Clifford measurements, the system exhibits saturation of magic. Our results clarify the nature of magic and its linear combinations in quantum circuits utilizing genuine magic measures, thereby advancing our understanding of quantum complexity in monitored quantum systems.
The classical simulation of highly entangling quantum dynamics is conjectured to be generically hard. Thus, recently discovered measurement-induced transitions between highly entangling and low-entanglement dynamics are phase transitions in classical simulability. Here, we study simulability transitions beyond entanglement: noting that some highly entangling dynamics (e.g., integrable systems or Clifford circuits) are easy to classically simulate, thus requiring “magic”—a subtle form of quantum resource—to achieve computational hardness, we ask how the dynamics of magic competes with measurements. We study the resulting “dynamical magic transitions” focusing on random monitored Clifford circuits doped by T gates (injecting magic). We identify dynamical “stabilizer purification”—the collapse of a superposition of stabilizer states by measurements—as the mechanism driving this transition. We find cases where transitions in magic and entanglement coincide, but also others with a magic and simulability transition in a highly (volume-law) entangled phase. In establishing our results, we use Pauli-based computation, a scheme distilling the quantum essence of the dynamics to a magic state register subject to mutually commuting measurements. We link stabilizer purification to “magic fragmentation” wherein these measurements separate into disjoint, O ( 1 ) -weight blocks, and relate this to the spread of magic in the original circuit becoming arrested. Published by the American Physical Society 2024
Stabilizer entropy (SE) quantifies the spread of a state in the basis of Pauli operators. It is a computationally tractable measure of nonstabilizerness and thus a useful resource for quantum computation. SE can be moved around a quantum system, effectively purifying a subsystem from its complex features. We show that there is a phase transition in the residual subsystem SE as a function of the density of non-Clifford resources. This phase transition has important operational consequences: it marks the onset of a subsystem purity estimation protocol that requires poly(n)exp(t)poly(n)exp(t)poly(n)exp(t) many queries to a circuit containing ttt non-Clifford gates that prepares the state from a stabilizer state. Then, for t=O(log2n)t=O({log}_{2}n)t=O(log2​n), it estimates the purity with polynomial resources, and, for highly entangled states, attains an exponential speed-up over the known state-of-the-art algorithms.
Classical and quantum states can be distinguished by entanglement entropy, which can be viewed as a measure of quantum resources. Entanglement entropy also plays a pivotal role in understanding computational complexity in simulating quantum systems. However, stabilizer states formed solely by Clifford gates can be efficiently simulated with the tableau algorithm according to the Gottesman-Knill theorem, although they can host large entanglement entropy. In this work, we introduce the concept of non-stabilizerness entanglement entropy which is basically the minimum residual entanglement entropy for a quantum state by excluding the contribution from Clifford circuits. It can serve as a new practical and better measure of difficulty in the classical simulation of quantum many-body systems. We discuss why it is a better criterion than previously proposed metrics such as Stabilizer Rényi Entropy. We also show numerical results of non-stabilizerness entanglement entropy with concrete quantum many-body models. The concept of non-stabilizerness entanglement entropy expands our understanding of the ``hardness`` in the classical simulation of quantum many-body systems.
Nonstabilizerness, or quantum magic resource, presents a valuable resource in quantum error correction and computation. We study the dynamics of locally injected nonstabilizerness in unitary Clifford circuits, where the total nonstabilizerness is conserved. However, the absence of physical observables quantifying nonstabilizerness precludes a direct microscopic or hydrodynamic description of its local distribution and dynamics. Using insights from stabilizer quantum error correcting codes, we rigorously show that the spatial distribution of nonstabilizerness can be inferred from a canonical representation of low-magic states, dubbed the bipartite magic gauge. Moreover, we propose two operationally relevant magic length scales. We numerically establish that, at early times, both length scales grow ballistically at distinct velocities set by the entanglement velocity, after which nonstabilizerness delocalizes. Our work sheds light on the spatiotemporal structure of quantum resources and complexity in many-body dynamics, opening up avenues for investigating their transport properties and further connections with quantum error correction.
The entangling layer of a quantum circuit Born machine can supply both entanglement and nonstabilizerness. In this work we show that the entangling layer can be a Clifford circuit, which supplies no nonstabilizerness. We use an architecture in which a fixed, non-trainable entangler is reused in every layer and only single-qubit rotations are optimized. There, a Clifford entangler reaches the same Kullback--Leibler divergence as a near-Haar one at sufficient circuit depth, and entanglers spanning zero to Haar-typical nonstabilizerness reach the same loss, up to a small offset for a free-fermion matchgate entangler. A doping control that raises the entangler's nonstabilizerness while leaving the entangling power of every gate unchanged leaves the loss flat. With a Clifford entangler the nonstabilizerness of the trained state comes entirely from the rotations, which take the trained circuit outside the stabilizer formalism. We also show that, among all pure states whose Born distribution is a given target, the one whose amplitudes are the positive square roots of the probabilities has the smallest stabilizer Rényi entropy, so this minimum can be computed without training.