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

Amortized Stabilizer Rényi Entropy of Quantum Dynamics

Chengkai Zhu, Yu-Ao Chen, Zhiping Liu, Zhan Yu, Zanqiu Shen, Xin Wang

quant-phSubmitted Sep 10, 2024• Announced Sep 11, 2024• 5 citations• Revised Nov 2, 2026 (v2)
v1 · Sep 10, 2024v2 · Nov 2, 2026
arXivHTMLPDF

Abstract

Magic states are essential resources for fault-tolerant quantum computation. We introduce the amortized stabilizer Rényi entropy (SRE), which quantifies the largest SRE increase generated by a unitary, including arbitrary pure inputs and reference systems. Initial nonstabilizerness can enhance this increase, whereas analogous amortized logarithmic robustness and extent collapse to stabilizer-input optimizations. We establish structural properties and exact amortized 2-SRE values for the $T$ and $CCZ$ gates. We then derive explicit lower bounds on approximate $T$-state cost, with diamond-distance error, allowing stabilizer ancillary states, Pauli measurements, and classical feedforward. A Choi-state witness gives computable bounds for quantum Fourier transforms, controlled rotations, fractional controlled-SWAP gates, and finite Heisenberg-chain evolutions. We distinguish the unrestricted optimization from its Choi witness and specify the access and precision requirements for estimating Pauli moments. An odd-moment variant yields a confidence-qualified cost witness from ordinary copies.

DOI
10.48550/arxiv.2409.06659
Comments
8 + 3 pages, 3 figures; v2: close to the published version

Related papers

Probing quantum complexity via universal saturation of stabilizer entropies

Tobias Haug, Leandro Aolita, M. S. Kim

Nonstabilizerness or `magic' is a key resource for quantum computing and a necessary condition for quantum advantage. Non-Clifford operations turn stabilizer states into resourceful states, where the amount of nonstabilizerness is quantified by resource measures such as stabilizer Rényi entropies (SREs). Here, we show that SREs saturate their maximum value at a critical number of non-Clifford operations. Close to the critical point SREs show universal behavior. Remarkably, the derivative of the SRE crosses at the same point independent of the number of qubits and can be rescaled onto a single curve. We find that the critical point depends non-trivially on Rényi index α . For random Clifford circuits doped with T-gates, the critical T-gate density scales independently of α . In contrast, for random Hamiltonian evolution, the critical time scales linearly with qubit number for α > 1 , while it is a constant for α < 1 . This highlights that α -SREs reveal fundamentally different aspects of nonstabilizerness depending on α : α -SREs with α < 1 relate to Clifford simulation complexity, while α > 1 probe the distance to the closest stabilizer state and approximate state certification cost via Pauli measurements. As technical contributions, we observe that the Pauli spectrum of random evolution can be approximated by two highly concentrated peaks which allows us to compute its SRE. Further, we introduce a class of random evolution that can be expressed as random Clifford circuits and rotations, where we provide its exact SRE. Our results opens up new approaches to characterize the complexity of quantum systems.

arXiv:2406.04190•Quantum•Jul 21, 2025•59 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•8 citations

Exact solution of long-range stabilizer Rényi entropy in the dual-unitary XXZ model*

Jordi A. Montana-Lopez, Pavel Kos

Abstract Quantum systems can not be efficiently simulated classically due to the presence of entanglement and nonstabilizerness, also known as quantum magic. Here we study the generation of magic under evolution by a quantum circuit. To be able to provide exact solutions, we focus on the dual-unitary XXZ model and a measure of magic called stabilizer Rényi entropy (SRE). Moreover, we focus also on long-range SRE, which cannot be removed by short-depth quantum circuits. To obtain exact solutions we use a ZX-calculus representation and graphical rules for the evaluation of the required expressions. We obtain exact results for SRE after short-time evolution in the thermodynamic limit and for long-range SRE for all times and all Rényi parameters for a particular partition of the state. Since the numerical evaluation of these quantities is exponentially costly in the Rényi parameter, we verify this numerically for low Rényi parameters and accessible system sizes and provide numerical results for the long-range SRE in other partitions.

arXiv:2405.04448•Journal of Physics A Mathematical and Theoretical•Oct 10, 2024•34 citations

Algorithm for estimating α -stabilizer Rényi entropies via purity

Benjamin Stratton

Nonstabilizerness, or “magic,” is a resource for universal quantum computation in most fault-tolerant architectures; access to states with nonstabilizerness allows for nonclassically simulable quantum computation to be performed. Quantifying this resource for unknown states is therefore essential to assessing their utility in quantum computation. The stabilizer Rényi entropies have emerged as a leading tool for achieving this, having already enabled one efficient algorithm for measuring nonstabilizerness. In addition, the stabilizer Rényi entropies have proven useful in developing connections between nonstabilizerness and other quantum phenomena. In this work, we introduce an alternative algorithm for measuring the stabilizer Rényi entropies of an unknown quantum state. First, we show the existence of a state, produced from the action of a channel on α copies of some state ρ , that encodes the α -stabilizer Rényi entropy of ρ into its purity. We detail several methods of applying this channel, and then, by employing existing purity-measuring algorithms, provide an algorithm for measuring the α -stabilizer Rényi entropies for all integers α > 1 . This algorithm is benchmarked for qubits and the resource requirements compared to other known algorithms. Finally, a nonstabilizerness-entanglement relationship is shown to exist in the algorithm, demonstrating a relationship between the two resources, before an instance of resource hiding is found.

arXiv:2507.02540•Physical Review A•Jan 23, 2026•4 citations

Stabilizer Rényi entropy of 3-uniform hypergraph states

Daichi Kagamihara, Shunji Tsuchiya

Nonstabilizerness, also known as magic, plays a central role in universal quantum computation. Hypergraph states are nonstabilizer generalizations of graph states and constitute a key class of quantum states in various areas of quantum physics, such as the demonstration of quantum advantage, measurement-based quantum computation, and the study of topological phases. In this work, we investigate nonstabilizerness of 3-uniform hypergraph states, which are solely generated by controlled-controlled-Z gates, in terms of the stabilizer Rényi entropy (SRE). We find that the SRE of 3-uniform hypergraph states can be expressed using the matrix rank, which reduces computational cost from $\mathcal{O}(2^{3N})$ to $\mathcal{O}(N^3 2^{N})$ for $N$-qubit states. Based on this result, we exactly evaluate SREs of one-dimensional hypergraph states. We also present numerical results of SREs of several large-scale 3-uniform hypergraph states. Our results would contribute to an understanding of the role of nonstabilizerness in a wide range of physical settings where hypergraph states are employed.

quant-pharXiv:2602.23687•Mar 2, 2026•0 citations

Magic Is in the Eye of the Measure

Shen Zhi-Heng, Zhewei Yin, Hao-Lin Zhang

Magic, or nonstabilizerness, is the quantum resource behind universal quantum computation. Its applications in high-energy and nuclear physics rely almost exclusively on the stabilizer Rényi entropy (SRE), although magic has no unique measure. For two qubits, we compare the SRE with three measures defined through optimizations over stabilizer states: the min- and max-relative entropies of magic and the logarithmic free robustness. We determine the maximal-magic states of all four measures, with exact proofs, and find that they depend on the measure. In the determination of the weak mixing angle from minimal magic in Møller scattering, the min-relative entropy gives an energy-dependent value that differs from that of the SRE, whereas the max-relative entropy and the logarithmic free robustness give $\sin^2θ_W=1/4$ at all energies. We trace this difference to the non-analytic structure of the optimization-based measures. Physical conclusions drawn from extremizing magic can thus depend on the measure.

arXiv:2611.08586•Nov 5, 2026•0 citations
Magic states are essential resources for fault-tolerant quantum computation. We introduce the amortized stabilizer Rényi entropy (SRE), which quantifies the largest SRE increase generated by a unitary, including arbitrary pure inputs and reference systems. Initial nonstabilizerness can enhance this increase, whereas analogous amortized logarithmic robustness and extent collapse to stabilizer-input optimizations. We establish structural properties and exact amortized 2-SRE values for the TTT and CCZCCZCCZ gates. We then derive explicit lower bounds on approximate TTT-state cost, with diamond-distance error, allowing stabilizer ancillary states, Pauli measurements, and classical feedforward. A Choi-state witness gives computable bounds for quantum Fourier transforms, controlled rotations, fractional controlled-SWAP gates, and finite Heisenberg-chain evolutions. We distinguish the unrestricted optimization from its Choi witness and specify the access and precision requirements for estimating Pauli moments. An odd-moment variant yields a confidence-qualified cost witness from ordinary copies.
Nonstabilizerness or `magic' is a key resource for quantum computing and a necessary condition for quantum advantage. Non-Clifford operations turn stabilizer states into resourceful states, where the amount of nonstabilizerness is quantified by resource measures such as stabilizer Rényi entropies (SREs). Here, we show that SREs saturate their maximum value at a critical number of non-Clifford operations. Close to the critical point SREs show universal behavior. Remarkably, the derivative of the SRE crosses at the same point independent of the number of qubits and can be rescaled onto a single curve. We find that the critical point depends non-trivially on Rényi index α . For random Clifford circuits doped with T-gates, the critical T-gate density scales independently of α . In contrast, for random Hamiltonian evolution, the critical time scales linearly with qubit number for α > 1 , while it is a constant for α < 1 . This highlights that α -SREs reveal fundamentally different aspects of nonstabilizerness depending on α : α -SREs with α < 1 relate to Clifford simulation complexity, while α > 1 probe the distance to the closest stabilizer state and approximate state certification cost via Pauli measurements. As technical contributions, we observe that the Pauli spectrum of random evolution can be approximated by two highly concentrated peaks which allows us to compute its SRE. Further, we introduce a class of random evolution that can be expressed as random Clifford circuits and rotations, where we provide its exact SRE. Our results opens up new approaches to characterize the complexity of quantum systems.
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.
Abstract Quantum systems can not be efficiently simulated classically due to the presence of entanglement and nonstabilizerness, also known as quantum magic. Here we study the generation of magic under evolution by a quantum circuit. To be able to provide exact solutions, we focus on the dual-unitary XXZ model and a measure of magic called stabilizer Rényi entropy (SRE). Moreover, we focus also on long-range SRE, which cannot be removed by short-depth quantum circuits. To obtain exact solutions we use a ZX-calculus representation and graphical rules for the evaluation of the required expressions. We obtain exact results for SRE after short-time evolution in the thermodynamic limit and for long-range SRE for all times and all Rényi parameters for a particular partition of the state. Since the numerical evaluation of these quantities is exponentially costly in the Rényi parameter, we verify this numerically for low Rényi parameters and accessible system sizes and provide numerical results for the long-range SRE in other partitions.
Nonstabilizerness, or “magic,” is a resource for universal quantum computation in most fault-tolerant architectures; access to states with nonstabilizerness allows for nonclassically simulable quantum computation to be performed. Quantifying this resource for unknown states is therefore essential to assessing their utility in quantum computation. The stabilizer Rényi entropies have emerged as a leading tool for achieving this, having already enabled one efficient algorithm for measuring nonstabilizerness. In addition, the stabilizer Rényi entropies have proven useful in developing connections between nonstabilizerness and other quantum phenomena. In this work, we introduce an alternative algorithm for measuring the stabilizer Rényi entropies of an unknown quantum state. First, we show the existence of a state, produced from the action of a channel on α copies of some state ρ , that encodes the α -stabilizer Rényi entropy of ρ into its purity. We detail several methods of applying this channel, and then, by employing existing purity-measuring algorithms, provide an algorithm for measuring the α -stabilizer Rényi entropies for all integers α > 1 . This algorithm is benchmarked for qubits and the resource requirements compared to other known algorithms. Finally, a nonstabilizerness-entanglement relationship is shown to exist in the algorithm, demonstrating a relationship between the two resources, before an instance of resource hiding is found.
Nonstabilizerness, also known as magic, plays a central role in universal quantum computation. Hypergraph states are nonstabilizer generalizations of graph states and constitute a key class of quantum states in various areas of quantum physics, such as the demonstration of quantum advantage, measurement-based quantum computation, and the study of topological phases. In this work, we investigate nonstabilizerness of 3-uniform hypergraph states, which are solely generated by controlled-controlled-Z gates, in terms of the stabilizer Rényi entropy (SRE). We find that the SRE of 3-uniform hypergraph states can be expressed using the matrix rank, which reduces computational cost from O(23N)\mathcal{O}(2^{3N})O(23N) to O(N32N)\mathcal{O}(N^3 2^{N})O(N32N) for NNN-qubit states. Based on this result, we exactly evaluate SREs of one-dimensional hypergraph states. We also present numerical results of SREs of several large-scale 3-uniform hypergraph states. Our results would contribute to an understanding of the role of nonstabilizerness in a wide range of physical settings where hypergraph states are employed.
Magic, or nonstabilizerness, is the quantum resource behind universal quantum computation. Its applications in high-energy and nuclear physics rely almost exclusively on the stabilizer Rényi entropy (SRE), although magic has no unique measure. For two qubits, we compare the SRE with three measures defined through optimizations over stabilizer states: the min- and max-relative entropies of magic and the logarithmic free robustness. We determine the maximal-magic states of all four measures, with exact proofs, and find that they depend on the measure. In the determination of the weak mixing angle from minimal magic in Møller scattering, the min-relative entropy gives an energy-dependent value that differs from that of the SRE, whereas the max-relative entropy and the logarithmic free robustness give sin⁡2θW=1/4\sin^2θ_W=1/4sin2θW​=1/4 at all energies. We trace this difference to the non-analytic structure of the optimization-based measures. Physical conclusions drawn from extremizing magic can thus depend on the measure.