© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2607.14222

Magic Without Entanglement: Exact Revivals and Their Fisher Information Origin

Rishabh Jha, Karun Gadge

quant-phcond-mat.stat-mechmath-phSubmitted Jul 15, 2026• Announced Jul 17, 2026• 0 citations• Revised Jul 22, 2026 (v2)

v1 · Jul 15, 2026 v2 · Jul 22, 2026

Abstract

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.

Comments: 6+42 pages, 3+0 figures

Related papers

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•0 citations

Magic Resources of the Heisenberg Picture

Neil Dowling, Pavel Kos, Xhek Turkeshi

We study a nonstabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer Rényi entropy analog in operator space is a good magic monotone satisfying the usual conditions while inheriting efficient computability properties and providing a tight lower bound to the minimum number of non-Clifford gates in a circuit. Operationally, this measure quantifies how well an operator can be approximated by one with only a few Pauli strings-analogous to how entanglement entropy relates to tensor-network truncation. A notable advantage of operator stabilizer entropies is their inherent locality, as captured by a Lieb-Robinson bound. This feature makes them particularly suited for studying local dynamical magic resource generation in many-body systems. We compute this quantity analytically in two distinct regimes. First, we show that under random evolution, operator magic typically reaches near-maximal value for all Rényi indices, and we evaluate the Page correction. Second, harnessing both dual unitarity and ZX graphical calculus, we solve the operator stabilizer entropy for interacting integrable XXZ circuit, finding that it quickly saturates to a constant value. Overall, this measure sheds light on the structural properties of many-body nonstabilizerness generation and can inspire Clifford-assisted tensor network methods.

arXiv:2408.16047•Physical Review Letters•Jul 7, 2025•25 citations

Quantum Magic Reveals CP Phases Invisible to Entanglement in Spin-0 Decays

Nicolas Viaux, Ariel Norambuena, Pedro Orellana

All standard scalar quantum-information measures -- concurrence, negativity, entanglement entropy, the optimized CHSH bound, and quantum Fisher information -- are CP-blind in ideal \\ spin-0 $\to f\bar f$ decays because the two-qubit spin state is maximally entangled for every CP angle. We show that stabilizer magic, fixed in the physical Pauli frame of spin analysis, escapes this blind spot: the stabilizer Rényi entropy admits an exact closed form, vanishing at CP-definite and Clifford phases and peaking at maximal non-Clifford mixing. Two experimentally accessible, magic-inspired CP witnesses follow; the linear amplitude is $14.3\times$ more efficient than its quartic counterpart and reaches discovery-level sensitivity at the HL-LHC for $H\toτ^+τ^-$.

quant-pharXiv:2605.19117•May 20, 2026•0 citations

Spectral geometry of nonlocal stabilizer entropy

Piotr Sierant

Magic, or nonstabilizerness, is the resource that promotes stabilizer operations to universal quantum computation. For bipartite pure states, its component intrinsic to the correlations between the subsystems, the nonlocal magic, is obtained by minimizing a magic measure over local unitaries. For the stabilizer Rényi entropy (SRE), the minimum is conjectured to be attained by the computational-basis (CB) representative, the state obtained by assigning the Schmidt coefficients in decreasing order to matching computational-basis labels. We prove this conjecture for two families of states at every system size and bipartition: states with dyadic-staircase Schmidt spectra and states of Schmidt rank at most six. For arbitrary bipartite pure states, we show that the CB value exceeds the nonlocal SRE by at most $4$, fixing the leading term of any divergent scaling of nonlocal SRE. We further show that the nonlocal SRE grows at most logarithmically with the entanglement entropy. Consequently, one-dimensional area-law states have bounded nonlocal SRE, while critical states with logarithmic entanglement entropy permit at most doubly logarithmic growth with system size. We apply these results to the transverse-field Ising chain, where we tightly bound the nonlocal SRE in the gapped phases and identify its double-logarithmic growth at criticality.

quant-pharXiv:2609.13106•Sep 14, 2026•0 citations

Stabilizer Rényi entropy for translation-invariant matrix product states

L. Liu, Su Yi, Jian Cui

Magic, capturing the deviation of a quantum state from the stabilizer formalism, is a key resource underpinning the quantum advantage. The recently introduced stabilizer Rényi entropy (SRE) offers a tractable measure of magic, avoiding the complexity of conventional methods. We study SRE in translation-invariant matrix product states (MPS), deriving exact expressions for representative states and introducing a numerically stable algorithm, named bond-DMRG, to compute the SRE density in infinite systems. Applying this method, we obtain high-precision SRE densities for the ground state of the one-dimensional Ising model. We also analyze non-local SRE density, showing it is bounded by a universal function of entanglement entropy, and further prove that two-site mutual SRE vanishes asymptotically in injective MPS. Our work not only introduces a powerful method for extracting the SRE density in quantum many-body systems, but also numerically reveals a fundamental connection between magic and entanglement, thereby paving the way for deeper theoretical investigations into their interplay.

arXiv:2508.03534•Physical Review A•May 14, 2026•2 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 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.

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.

We study a nonstabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer Rényi entropy analog in operator space is a good magic monotone satisfying the usual conditions while inheriting efficient computability properties and providing a tight lower bound to the minimum number of non-Clifford gates in a circuit. Operationally, this measure quantifies how well an operator can be approximated by one with only a few Pauli strings-analogous to how entanglement entropy relates to tensor-network truncation. A notable advantage of operator stabilizer entropies is their inherent locality, as captured by a Lieb-Robinson bound. This feature makes them particularly suited for studying local dynamical magic resource generation in many-body systems. We compute this quantity analytically in two distinct regimes. First, we show that under random evolution, operator magic typically reaches near-maximal value for all Rényi indices, and we evaluate the Page correction. Second, harnessing both dual unitarity and ZX graphical calculus, we solve the operator stabilizer entropy for interacting integrable XXZ circuit, finding that it quickly saturates to a constant value. Overall, this measure sheds light on the structural properties of many-body nonstabilizerness generation and can inspire Clifford-assisted tensor network methods.

All standard scalar quantum-information measures -- concurrence, negativity, entanglement entropy, the optimized CHSH bound, and quantum Fisher information -- are CP-blind in ideal \\ spin-0

\to f\bar f

decays because the two-qubit spin state is maximally entangled for every CP angle. We show that stabilizer magic, fixed in the physical Pauli frame of spin analysis, escapes this blind spot: the stabilizer Rényi entropy admits an exact closed form, vanishing at CP-definite and Clifford phases and peaking at maximal non-Clifford mixing. Two experimentally accessible, magic-inspired CP witnesses follow; the linear amplitude is

14.3\times

more efficient than its quartic counterpart and reaches discovery-level sensitivity at the HL-LHC for

H\toτ^+τ^-

.

Magic, or nonstabilizerness, is the resource that promotes stabilizer operations to universal quantum computation. For bipartite pure states, its component intrinsic to the correlations between the subsystems, the nonlocal magic, is obtained by minimizing a magic measure over local unitaries. For the stabilizer Rényi entropy (SRE), the minimum is conjectured to be attained by the computational-basis (CB) representative, the state obtained by assigning the Schmidt coefficients in decreasing order to matching computational-basis labels. We prove this conjecture for two families of states at every system size and bipartition: states with dyadic-staircase Schmidt spectra and states of Schmidt rank at most six. For arbitrary bipartite pure states, we show that the CB value exceeds the nonlocal SRE by at most

4

, fixing the leading term of any divergent scaling of nonlocal SRE. We further show that the nonlocal SRE grows at most logarithmically with the entanglement entropy. Consequently, one-dimensional area-law states have bounded nonlocal SRE, while critical states with logarithmic entanglement entropy permit at most doubly logarithmic growth with system size. We apply these results to the transverse-field Ising chain, where we tightly bound the nonlocal SRE in the gapped phases and identify its double-logarithmic growth at criticality.

Magic, capturing the deviation of a quantum state from the stabilizer formalism, is a key resource underpinning the quantum advantage. The recently introduced stabilizer Rényi entropy (SRE) offers a tractable measure of magic, avoiding the complexity of conventional methods. We study SRE in translation-invariant matrix product states (MPS), deriving exact expressions for representative states and introducing a numerically stable algorithm, named bond-DMRG, to compute the SRE density in infinite systems. Applying this method, we obtain high-precision SRE densities for the ground state of the one-dimensional Ising model. We also analyze non-local SRE density, showing it is bounded by a universal function of entanglement entropy, and further prove that two-site mutual SRE vanishes asymptotically in injective MPS. Our work not only introduces a powerful method for extracting the SRE density in quantum many-body systems, but also numerically reveals a fundamental connection between magic and entanglement, thereby paving the way for deeper theoretical investigations into their interplay.

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.