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:2609.40032

Pauli instability in arbitrary states: detecting magic in physical correlators

Tanner Jackson, Alexey Milekhin

quant-phcond-mat.stat-mechhep-thSubmitted Sep 30, 2026• Announced Oct 1, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether non-Clifford dynamics can be diagnosed through correlators evaluated in physical states rather than infinite-temperature traces. It extends Pauli instability to $\mathcal I_\alpha(\rho,U)=-\log\mathbb E_{A,B}|\operatorname{Tr}[\rho A(t)BA(t)B]|^\alpha$, averaging over Pauli strings. For every full-rank state, including finite-temperature Gibbs states, this quantity vanishes exactly when $U$ is Clifford. It is nonnegative, additive on product states and evolutions, and Clifford-covariant. Faithfulness follows from the equality condition in state-weighted Cauchy–Schwarz and the separation of Pauli strings by commutation relations. At $\alpha=2$, Pauli-character orthogonality evaluates the $B$ average as a weighted sum of squared state-dependent two-point functions. At infinite temperature, the result equals the stabilizer 2-Rényi entropy of the Choi state. Bounding evolved-Pauli support establishes $\mathcal I_2\le r\log2\le k\log2$ for arbitrary Clifford+$T$ circuits, where $r$ is the binary rank of the $k$ rotation axes. A four-copy projector argument sharpens the infinite-temperature bound to $k\log(4/3)$, attained by parallel $T$ gates. For a single fixed probe, the $k\log2$ bound is tight. Full rank is essential: pure states can hide non-Clifford dynamics completely. The sharper $k\log(4/3)$ bound for arbitrary states remains conjectural. Fixed-probe averaging reduces the nominal correlator count from $16^n$ to $4^n$, still exponential. Examples include exact parallel-$T$ formulas, third-Clifford-hierarchy bounds, Wigner-matrix dynamics with early growth $\mathcal I_2\simeq4t^2$, and six-qubit Heisenberg-chain numerics.

No sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
4+6 pages, 1 figure

Related papers

Quantifying non-stabilizerness via information scrambling

Arash Ahmadi, Eliška Greplová

The advent of quantum technologies brought forward much attention to the theoretical characterization of the computational resources they provide. A method to quantify quantum resources is to use a class of functions called magic monotones and stabilizer entropies, which are, however, notoriously hard and impractical to evaluate for large system sizes. In recent studies, a fundamental connection between information scrambling, the magic monotone mana and 2-Renyi stabilizer entropy was established. This connection simplified magic monotone calculation, but this class of methods still suffers from exponential scaling with respect to the number of qubits. In this work, we establish a way to sample an out-of-time-order correlator that approximates magic monotones and 2-Renyi stabilizer entropy. We numerically show the relation of these sampled correlators to different non-stabilizerness measures for both qubit and qutrit systems and provide an analytical relation to 2-Renyi stabilizer entropy. Furthermore, we put forward and simulate a protocol to measure the monotonic behaviour of magic for the time evolution of local Hamiltonians.

arXiv:2204.11236•SciPost Physics•Feb 8, 2024•34 citations

Magic Without Entanglement: Exact Revivals and Their Fisher Information Origin

Rishabh Jha, Karun Gadge

Magic and entanglement are independent quantum resources, yet their exact relation in many-body dynamics has remained elusive. We uncover two structural principles. First, at any stabilizer state, the curvature of the second stabilizer Rényi entropy under an arbitrary Hermitian generator equals the quantum Fisher information up to a fixed normalization, creating a bidirectional bridge between computational and metrological resources. Second, for commuting Ising evolution on any forest graph, a Clifford pruning circuit yields the full stabilizer-Rényi family at arbitrary size and in any spatial embedding, thereby furnishing a graph-theoretic construction of families with finite magic density and vanishing entanglement density in the thermodynamic limit. We solve two paradigmatic one-dimensional realizations central to quantum simulation -- an Ising quench and a kicked Floquet chain -- exactly for arbitrary system size and directly in the thermodynamic limit, revealing finite magic density with vanishing entanglement density, distinct magic and entanglement revival periods, and Clifford points with zero magic but finite bipartite entanglement. The same tangent geometry fixes initial growth, perturbative revival lifting, and stability of thermodynamic magic minima. Large-scale Pauli-basis matrix-product-state calculations verify all predictions, and the tangent bridge yields a concrete protocol for detecting magic through established quantum-Fisher-information measurements.

quant-pharXiv:2607.14222•Jul 17, 2026•3 citations

Efficient Quantum Algorithms for Stabilizer Entropies

Tobias Haug, Soovin Lee, M. S. Kim

Stabilizer entropies (SEs) are measures of nonstabilizerness or "magic" that quantify the degree to which a state is described by stabilizers. SEs are especially interesting due to their connections to scrambling, localization and property testing. However, applications have been limited so far as previously known measurement protocols for SEs scale exponentially with the number of qubits. Here, we efficiently measure SEs for integer Rényi index n>1 via Bell measurements. The SE of N-qubit quantum states can be measured with O(n) copies and O(nN) classical computational time, where for even n we additionally require the complex conjugate of the state. We provide efficient bounds of various nonstabilizerness monotones that are intractable to compute beyond a few qubits. Using the IonQ quantum computer, we measure SEs of random Clifford circuits doped with non-Clifford gates and give bounds for the stabilizer fidelity, stabilizer extent, and robustness of magic. We provide efficient algorithms to measure Clifford-averaged 4n-point out-of-time-order correlators and multifractal flatness. With these measures we study the scrambling time of doped Clifford circuits and random Hamiltonian evolution depending on nonstabilizerness. Counterintuitively, random Hamiltonian evolution becomes less scrambled at long times, which we reveal with the multifractal flatness. Our results open up the exploration of nonstabilizerness with quantum computers.

arXiv:2305.19152•Physical Review Letters•Jun 13, 2024•103 citations

Clifford entropy

Gianluca Cuffaro, Matthew B. Weiss

We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is invariant under composition with Clifford unitaries, and is subadditive under tensor products. Rewriting the Clifford entropy in terms of the stabilizer entropy of the corresponding Choi state allows us to derive an upper bound: that this bound is not tight follows from considering the properties of symmetric informationally complete sets. Nevertheless we are able to numerically estimate the maximum in low dimensions, comparing it to the average over all unitaries, which we derive analytically. Finally, harnessing a concentration of measure result, we show that as the dimension grows large, with probability approaching unity, the ratio between the Clifford entropy of a Haar random unitary and that of a fixed magic gate gives a lower bound on the depth of a doped Clifford circuit which realizes the former in terms of the latter. In fact, numerical evidence suggests that this result holds reliably even in low dimensions. We conclude with several directions for future research.

quant-pharXiv:2512.23050•Dec 30, 2025•0 citations

Entanglement entropy and magic of ZX-diagrams

Marcin Szyniszewski, Razin A. Shaikh, Aleks Kissinger

Entanglement and non-stabilizerness are complementary resources underlying the complexity of quantum states, yet extracting either quantity from large quantum circuits generally requires exponentially scaling resources. In diagrammatic approaches to quantum computation, such as the ZX-calculus, both quantities likewise typically require expensive tensor contractions that are not native to graphical rewriting. Here we show that both entanglement and magic can be efficiently estimated directly from ZX-diagrams. Flow enables efficient extraction of a normal form separating a potentially extensively entangled graph-state backbone from non-Clifford Pauli gadgets. This structure yields additive upper and lower bounds on bipartite entanglement entropy, which we further tighten through a preprocessing procedure that removes or merges redundant non-Clifford contributions. The same normal form gives an upper bound on logarithmic stabilizer extent. We benchmark these methods in random unitary and monitored circuits, and a circuit combining Trotterized Hamiltonian evolution with Clifford layers, finding that the resulting bounds remain informative even at large qubit numbers, circuit depths, and internal spider counts. Our results provide scalable probes of entanglement and non-stabilizerness of ZX-diagrams and establish a bridge between ZX-calculus and quantum many-body resource characterization, with applications across quantum computing, quantum information, and condensed-matter physics.

quant-pharXiv:2610.12447•Oct 9, 2026•0 citations

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
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.
The paper asks whether non-Clifford dynamics can be diagnosed through correlators evaluated in physical states rather than infinite-temperature traces. It extends Pauli instability to Iα(ρ,U)=−log⁡EA,B∣Tr⁡[ρA(t)BA(t)B]∣α\mathcal I_\alpha(\rho,U)=-\log\mathbb E_{A,B}|\operatorname{Tr}[\rho A(t)BA(t)B]|^\alphaIα​(ρ,U)=−logEA,B​∣Tr[ρA(t)BA(t)B]∣α, averaging over Pauli strings. For every full-rank state, including finite-temperature Gibbs states, this quantity vanishes exactly when UUU is Clifford. It is nonnegative, additive on product states and evolutions, and Clifford-covariant. Faithfulness follows from the equality condition in state-weighted Cauchy–Schwarz and the separation of Pauli strings by commutation relations.
At α=2\alpha=2α=2, Pauli-character orthogonality evaluates the BBB average as a weighted sum of squared state-dependent two-point functions. At infinite temperature, the result equals the stabilizer 2-Rényi entropy of the Choi state. Bounding evolved-Pauli support establishes I2≤rlog⁡2≤klog⁡2\mathcal I_2\le r\log2\le k\log2I2​≤rlog2≤klog2 for arbitrary Clifford+TTT circuits, where rrr is the binary rank of the kkk rotation axes. A four-copy projector argument sharpens the infinite-temperature bound to klog⁡(4/3)k\log(4/3)klog(4/3), attained by parallel TTT gates. For a single fixed probe, the klog⁡2k\log2klog2 bound is tight.
Full rank is essential: pure states can hide non-Clifford dynamics completely. The sharper klog⁡(4/3)k\log(4/3)klog(4/3) bound for arbitrary states remains conjectural. Fixed-probe averaging reduces the nominal correlator count from 16n16^n16n to 4n4^n4n, still exponential. Examples include exact parallel-TTT formulas, third-Clifford-hierarchy bounds, Wigner-matrix dynamics with early growth I2≃4t2\mathcal I_2\simeq4t^2I2​≃4t2, and six-qubit Heisenberg-chain numerics.
The advent of quantum technologies brought forward much attention to the theoretical characterization of the computational resources they provide. A method to quantify quantum resources is to use a class of functions called magic monotones and stabilizer entropies, which are, however, notoriously hard and impractical to evaluate for large system sizes. In recent studies, a fundamental connection between information scrambling, the magic monotone mana and 2-Renyi stabilizer entropy was established. This connection simplified magic monotone calculation, but this class of methods still suffers from exponential scaling with respect to the number of qubits. In this work, we establish a way to sample an out-of-time-order correlator that approximates magic monotones and 2-Renyi stabilizer entropy. We numerically show the relation of these sampled correlators to different non-stabilizerness measures for both qubit and qutrit systems and provide an analytical relation to 2-Renyi stabilizer entropy. Furthermore, we put forward and simulate a protocol to measure the monotonic behaviour of magic for the time evolution of local Hamiltonians.
Magic and entanglement are independent quantum resources, yet their exact relation in many-body dynamics has remained elusive. We uncover two structural principles. First, at any stabilizer state, the curvature of the second stabilizer Rényi entropy under an arbitrary Hermitian generator equals the quantum Fisher information up to a fixed normalization, creating a bidirectional bridge between computational and metrological resources. Second, for commuting Ising evolution on any forest graph, a Clifford pruning circuit yields the full stabilizer-Rényi family at arbitrary size and in any spatial embedding, thereby furnishing a graph-theoretic construction of families with finite magic density and vanishing entanglement density in the thermodynamic limit. We solve two paradigmatic one-dimensional realizations central to quantum simulation -- an Ising quench and a kicked Floquet chain -- exactly for arbitrary system size and directly in the thermodynamic limit, revealing finite magic density with vanishing entanglement density, distinct magic and entanglement revival periods, and Clifford points with zero magic but finite bipartite entanglement. The same tangent geometry fixes initial growth, perturbative revival lifting, and stability of thermodynamic magic minima. Large-scale Pauli-basis matrix-product-state calculations verify all predictions, and the tangent bridge yields a concrete protocol for detecting magic through established quantum-Fisher-information measurements.
Stabilizer entropies (SEs) are measures of nonstabilizerness or "magic" that quantify the degree to which a state is described by stabilizers. SEs are especially interesting due to their connections to scrambling, localization and property testing. However, applications have been limited so far as previously known measurement protocols for SEs scale exponentially with the number of qubits. Here, we efficiently measure SEs for integer Rényi index n>1 via Bell measurements. The SE of N-qubit quantum states can be measured with O(n) copies and O(nN) classical computational time, where for even n we additionally require the complex conjugate of the state. We provide efficient bounds of various nonstabilizerness monotones that are intractable to compute beyond a few qubits. Using the IonQ quantum computer, we measure SEs of random Clifford circuits doped with non-Clifford gates and give bounds for the stabilizer fidelity, stabilizer extent, and robustness of magic. We provide efficient algorithms to measure Clifford-averaged 4n-point out-of-time-order correlators and multifractal flatness. With these measures we study the scrambling time of doped Clifford circuits and random Hamiltonian evolution depending on nonstabilizerness. Counterintuitively, random Hamiltonian evolution becomes less scrambled at long times, which we reveal with the multifractal flatness. Our results open up the exploration of nonstabilizerness with quantum computers.
We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is invariant under composition with Clifford unitaries, and is subadditive under tensor products. Rewriting the Clifford entropy in terms of the stabilizer entropy of the corresponding Choi state allows us to derive an upper bound: that this bound is not tight follows from considering the properties of symmetric informationally complete sets. Nevertheless we are able to numerically estimate the maximum in low dimensions, comparing it to the average over all unitaries, which we derive analytically. Finally, harnessing a concentration of measure result, we show that as the dimension grows large, with probability approaching unity, the ratio between the Clifford entropy of a Haar random unitary and that of a fixed magic gate gives a lower bound on the depth of a doped Clifford circuit which realizes the former in terms of the latter. In fact, numerical evidence suggests that this result holds reliably even in low dimensions. We conclude with several directions for future research.
Entanglement and non-stabilizerness are complementary resources underlying the complexity of quantum states, yet extracting either quantity from large quantum circuits generally requires exponentially scaling resources. In diagrammatic approaches to quantum computation, such as the ZX-calculus, both quantities likewise typically require expensive tensor contractions that are not native to graphical rewriting. Here we show that both entanglement and magic can be efficiently estimated directly from ZX-diagrams. Flow enables efficient extraction of a normal form separating a potentially extensively entangled graph-state backbone from non-Clifford Pauli gadgets. This structure yields additive upper and lower bounds on bipartite entanglement entropy, which we further tighten through a preprocessing procedure that removes or merges redundant non-Clifford contributions. The same normal form gives an upper bound on logarithmic stabilizer extent. We benchmark these methods in random unitary and monitored circuits, and a circuit combining Trotterized Hamiltonian evolution with Clifford layers, finding that the resulting bounds remain informative even at large qubit numbers, circuit depths, and internal spider counts. Our results provide scalable probes of entanglement and non-stabilizerness of ZX-diagrams and establish a bridge between ZX-calculus and quantum many-body resource characterization, with applications across quantum computing, quantum information, and condensed-matter physics.
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.