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:2512.23013 · Physical Review A

Stabilizer Entropy of Subspaces

Simone Cepollaro, Gianluca Cuffaro, Matthew B. Weiss, Stefano Cusumano, Alioscia Hamma, Seth Lloyd

quant-phSubmitted Dec 28, 2025• Announced Dec 30, 2025• 0 citations
arXivHTMLPDF

Abstract

We consider the costs and benefits of embedding the states of one quantum system within those of another. Such embeddings are ubiquitous, e.g., in error correcting codes and in symmetry-constrained systems. In particular we investigate the impact of embeddings in terms of the resource theory of nonstabilizerness (also known as magic) quantified via the stabilizer entropy (SE). We analytically and numerically study the stabilizer entropy gap or magic gap: the average gap between the SE of a quantum state realized within a subspace of a larger system and the SE of the quantum state considered on its own. We find that while the stabilizer entropy gap is typically positive, requiring the injection of magic, both zero and negative magic gaps are achievable. This suggests that certain choices of embedding subspace provide strong resource advantages over others. We provide formulas for the average nonstabilizerness of a subspace given its corresponding projector and sufficient conditions for realizing zero or negative gaps: in particular, certain classes of stabilizer codes provide paradigmatic examples of the latter. Through numerical optimization, we find subspaces which achieve both minimal and maximal average SE for a variety of dimensions, and compute the magic gap for specific error-correcting codes and symmetry-induced subspaces. Our results suggest that a judicious choice of embedding can lead to greater efficiency in both classical and quantum simulations.

Comments
40 pages, 15 figures

Related papers

Scalable Measures of Magic Resource for Quantum Computers

Tobias Haug, M. S. Kim

Nonstabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states.It is a crucial resource for quantum computing and a necessary condition for quantum advantage.However, quantifying magic resource beyond a few qubits has been a major challenge.Here, we introduce efficient measures of magic resource for pure quantum states with a sampling cost that is independent of the number of qubits.Our method uses Bell measurements over two copies of a state, which we implement in experiment together with a cost-free error-mitigation scheme.We show the transition of classically simulable stabilizer states into intractable quantum states on the IonQ quantum computer.For applications, we efficiently distinguish stabilizer and nonstabilizer states with low measurement cost even in the presence of experimental noise.Further, we propose a variational quantum algorithm to maximize our measure via the shift rule.Our algorithm can be free of barren plateaus even for highly expressible variational circuits.Finally, we experimentally demonstrate a Bell-measurement protocol for the stabilizer Rényi entropy as well as the Wallach-Meyer entanglement measure.Our results pave the way to understanding the nonclassical power of quantum computers, quantum simulators, and quantum many-body systems.

arXiv:2204.10061•PRX Quantum•Jan 3, 2023•104 citations

Amortized Stabilizer Rényi Entropy of Quantum Dynamics

Chengkai Zhu, Yu-Ao Chen, Zanqiu Shen +3 more

Unraveling the secrets of how much nonstabilizerness a quantum dynamic can generate is crucial for harnessing the power of magic states, the essential resources for achieving quantum advantage and realizing fault-tolerant quantum computation. In this work, we introduce the amortized $α$-stabilizer Rényi entropy, a magic monotone for unitary operations that quantifies the nonstabilizerness generation capability of quantum dynamics. Amortization is key in quantifying the magic of quantum dynamics, as we reveal that nonstabilizerness generation can be enhanced by prior nonstabilizerness in input states when considering the $α$-stabilizer Rényi entropy, while this is not the case for robustness of magic or stabilizer extent. We demonstrate the versatility of the amortized $α$-stabilizer Rényi entropy in investigating the nonstabilizerness resources of quantum dynamics of computational and fundamental interest. In particular, we establish improved lower bounds on the $T$-count of quantum Fourier transforms and the quantum evolutions of one-dimensional Heisenberg Hamiltonians, showcasing the power of this tool in studying quantum advantages and the corresponding cost in fault-tolerant quantum computation.

arXiv:2409.06659•Sep 10, 2024•0 citations

Testing nonstabilizerness only with stabilizer states

Hyukjoon Kwon

The stabilizer formalism plays a central role in quantum information processing and quantum computing. Since stabilizer states and operations can be efficiently simulated classically and fault-tolerantly implemented in quantum error-correcting codes, quantum states and operations beyond the stabilizer framework, characterized by nonstabilizerness or magic, naturally emerge as resources for quantum computation. Here, we demonstrate that a quantum-information task involving only stabilizer states can reveal a fundamental limitation of stabilizer operations. Specifically, we construct a set of mutually orthogonal stabilizer states that cannot be perfectly distinguished using stabilizer operations and extend this construction to an arbitrary number of qubits. Our results provide an efficient test of nonstabilizerness without requiring the direct use of resourceful states or operations nor relying on computational-hardness assumptions. This nonstabilizerness test could serve as a resource-efficient benchmark for fault-tolerant quantum computers powered by magic-state injection, by providing quantitative bounds on the robustness of magic. More fundamentally, the resulting asymmetry between the preparation and discrimination of free states parallels "nonlocality without entanglement" in entanglement theory, revealing an unexpected connection between these two distinct quantum resource theories.

arXiv:2509.25790•Sep 30, 2025•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

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

Stabilizer Rényi Entropy

Lorenzo Leone, Salvatore F. E. Oliviero, Alioscia Hamma

We introduce a novel measure for the quantum property of "nonstabilizerness"-commonly known as "magic"-by considering the Rényi entropy of the probability distribution associated to a pure quantum state given by the square of the expectation value of Pauli strings in that state. We show that this is a good measure of nonstabilizerness from the point of view of resource theory and show bounds with other known measures. The stabilizer Rényi entropy has the advantage of being easily computable because it does not need a minimization procedure. We present a protocol for an experimental measurement by randomized measurements. We show that the nonstabilizerness is intimately connected to out-of-time-order correlation functions and that maximal levels of nonstabilizerness are necessary for quantum chaos.

arXiv:2106.12587•Physical Review Letters•Feb 4, 2022•283 citations
We consider the costs and benefits of embedding the states of one quantum system within those of another. Such embeddings are ubiquitous, e.g., in error correcting codes and in symmetry-constrained systems. In particular we investigate the impact of embeddings in terms of the resource theory of nonstabilizerness (also known as magic) quantified via the stabilizer entropy (SE). We analytically and numerically study the stabilizer entropy gap or magic gap: the average gap between the SE of a quantum state realized within a subspace of a larger system and the SE of the quantum state considered on its own. We find that while the stabilizer entropy gap is typically positive, requiring the injection of magic, both zero and negative magic gaps are achievable. This suggests that certain choices of embedding subspace provide strong resource advantages over others. We provide formulas for the average nonstabilizerness of a subspace given its corresponding projector and sufficient conditions for realizing zero or negative gaps: in particular, certain classes of stabilizer codes provide paradigmatic examples of the latter. Through numerical optimization, we find subspaces which achieve both minimal and maximal average SE for a variety of dimensions, and compute the magic gap for specific error-correcting codes and symmetry-induced subspaces. Our results suggest that a judicious choice of embedding can lead to greater efficiency in both classical and quantum simulations.
Nonstabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states.It is a crucial resource for quantum computing and a necessary condition for quantum advantage.However, quantifying magic resource beyond a few qubits has been a major challenge.Here, we introduce efficient measures of magic resource for pure quantum states with a sampling cost that is independent of the number of qubits.Our method uses Bell measurements over two copies of a state, which we implement in experiment together with a cost-free error-mitigation scheme.We show the transition of classically simulable stabilizer states into intractable quantum states on the IonQ quantum computer.For applications, we efficiently distinguish stabilizer and nonstabilizer states with low measurement cost even in the presence of experimental noise.Further, we propose a variational quantum algorithm to maximize our measure via the shift rule.Our algorithm can be free of barren plateaus even for highly expressible variational circuits.Finally, we experimentally demonstrate a Bell-measurement protocol for the stabilizer Rényi entropy as well as the Wallach-Meyer entanglement measure.Our results pave the way to understanding the nonclassical power of quantum computers, quantum simulators, and quantum many-body systems.
Unraveling the secrets of how much nonstabilizerness a quantum dynamic can generate is crucial for harnessing the power of magic states, the essential resources for achieving quantum advantage and realizing fault-tolerant quantum computation. In this work, we introduce the amortized ααα-stabilizer Rényi entropy, a magic monotone for unitary operations that quantifies the nonstabilizerness generation capability of quantum dynamics. Amortization is key in quantifying the magic of quantum dynamics, as we reveal that nonstabilizerness generation can be enhanced by prior nonstabilizerness in input states when considering the ααα-stabilizer Rényi entropy, while this is not the case for robustness of magic or stabilizer extent. We demonstrate the versatility of the amortized ααα-stabilizer Rényi entropy in investigating the nonstabilizerness resources of quantum dynamics of computational and fundamental interest. In particular, we establish improved lower bounds on the TTT-count of quantum Fourier transforms and the quantum evolutions of one-dimensional Heisenberg Hamiltonians, showcasing the power of this tool in studying quantum advantages and the corresponding cost in fault-tolerant quantum computation.
The stabilizer formalism plays a central role in quantum information processing and quantum computing. Since stabilizer states and operations can be efficiently simulated classically and fault-tolerantly implemented in quantum error-correcting codes, quantum states and operations beyond the stabilizer framework, characterized by nonstabilizerness or magic, naturally emerge as resources for quantum computation. Here, we demonstrate that a quantum-information task involving only stabilizer states can reveal a fundamental limitation of stabilizer operations. Specifically, we construct a set of mutually orthogonal stabilizer states that cannot be perfectly distinguished using stabilizer operations and extend this construction to an arbitrary number of qubits. Our results provide an efficient test of nonstabilizerness without requiring the direct use of resourceful states or operations nor relying on computational-hardness assumptions. This nonstabilizerness test could serve as a resource-efficient benchmark for fault-tolerant quantum computers powered by magic-state injection, by providing quantitative bounds on the robustness of magic. More fundamentally, the resulting asymmetry between the preparation and discrimination of free states parallels "nonlocality without entanglement" in entanglement theory, revealing an unexpected connection between these two distinct quantum resource theories.
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 444, 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.
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.
We introduce a novel measure for the quantum property of "nonstabilizerness"-commonly known as "magic"-by considering the Rényi entropy of the probability distribution associated to a pure quantum state given by the square of the expectation value of Pauli strings in that state. We show that this is a good measure of nonstabilizerness from the point of view of resource theory and show bounds with other known measures. The stabilizer Rényi entropy has the advantage of being easily computable because it does not need a minimization procedure. We present a protocol for an experimental measurement by randomized measurements. We show that the nonstabilizerness is intimately connected to out-of-time-order correlation functions and that maximal levels of nonstabilizerness are necessary for quantum chaos.