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

Stabilizer Rényi entropy of 3-uniform hypergraph states

Daichi Kagamihara, Shunji Tsuchiya

quant-phSubmitted Feb 27, 2026• Announced Mar 2, 2026• 0 citations• Revised May 14, 2026 (v2)
v1 · Feb 27, 2026v2 · May 14, 2026
arXivHTMLPDF

Abstract

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.

Comments
11 pages, 3 figures

Related papers

Magic of quantum hypergraph states

Junjie Chen, Yuxuan Yan, You Zhou

Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing. However, analytical and numerical characterizations of magic are very challenging, especially for multi-qubit systems, even with a moderate qubit number. Here, we systemically and analytically investigate the magic resource of archetypal multipartite quantum states—quantum hypergraph states, which can be generated by multi-qubit controlled-phase gates encoded by hypergraphs. We first derive the magic formula in terms of the stabilizer Rényi- α entropies for general quantum hypergraph states. If the average degree of the corresponding hypergraph is constant, we show that magic cannot reach the maximal value, i.e., the number of qubits n . Then, we investigate the statistical behaviors of random hypergraph states' magic and prove a concentration result, indicating that random hypergraph states typically reach the maximum magic. This also suggests an efficient way to generate maximal magic states with random diagonal circuits. Finally, we study hypergraph states with permutation symmetry, such as 3 -complete hypergraph states, where any three vertices are connected by a hyperedge. Counterintuitively, such states can only possess constant or even exponentially small magic for α≥2 . Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.

arXiv:2308.01886•Quantum•May 21, 2024•25 citations

A fast and exact approach for stabilizer Rényi entropy via the XOR-FWHT algorithm

Xuyang Huang, Han-Ze Li, Ching Hua Lee +1 more

Quantum advantage is widely understood to rely on key quantum resources beyond entanglement, among which nonstabilizerness (quantum ``magic'') plays a central role in enabling universal quantum computation. However, the exact evaluation of the second-order stabilizer Rényi entropy for generic many-body quantum states remains computationally challenging, with brute-force methods scaling as $\mathcal O(8^N)$ for an $N$-qubit state. Here we develop a deterministic and exact algorithm that reduces this cost to $\mathcal{O}(N4^N)$ while retaining natural parallelism. This advance enables high-precision exact calculations for generic state vectors at medium system sizes, and provides a practical tool for investigating the scaling, phase structure, and nonequilibrium dynamics of quantum magic in many-body systems.

quant-pharXiv:2512.24685•Physical Review Research•Jan 1, 2026•0 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

Stabilizer Rényi Entropy and Conformal Field Theory

Masahiro Hoshino, Masaki Oshikawa, Yuto Ashida

Understanding universal aspects of many-body systems is one of the central themes in modern physics. Recently, the stabilizer Rényi entropy (SRE) has emerged as a computationally tractable measure of nonstabilizerness, a crucial resource for fault-tolerant universal quantum computation. While numerical results suggested that the SRE in critical states can exhibit universal behavior, its comprehensive theoretical understanding has remained elusive. In this work, we develop a field-theoretical framework for the SRE in a ( 1 + 1 )-dimensional many-body system and elucidate its universal aspects by using boundary conformal field theory. We demonstrate that the SRE is equivalent to a participation entropy in the Bell basis of a doubled Hilbert space, which can be calculated from the partition function of a replicated field theory with the interlayer line defect created by the Bell-state measurements. This identification allows us to characterize the universal contributions to the SRE on the basis of the data of conformal boundary conditions imposed on the replicated theory. We find that the SRE of the entire system contains a universal size-independent term determined by the noninteger ground-state degeneracy known as the g factor. In contrast, we show that the mutual SRE exhibits the logarithmic scaling with a universal coefficient given by the scaling dimension of a boundary-condition-changing operator, which elucidates the origin of universality previously observed in numerical results. As a concrete demonstration, we present a detailed analysis of the Ising criticality, where we analytically derive the universal quantities at arbitrary Rényi indices and numerically validate them with high accuracy by employing tensor-network methods. These results establish a field-theoretical approach to understanding the universal features of nonstabilizerness in quantum many-body systems.

arXiv:2503.13599•Physical Review X•Jan 22, 2026•14 citations

Real-Space Renormalization of Stabilizer Rényi Entropies in Spin Chains

Sonja Gombar, Petar Mali, Slobodan Radošević +3 more

Stabilizer states constitute an important class of quantum states that can be generated from computational-basis states using Pauli operators and Clifford gates. Although they may exhibit substantial multipartite entanglement, quantum circuits restricted to stabilizer operations can be efficiently simulated classically and therefore cannot, by themselves, provide a quantum computational advantage. Such an advantage requires non-stabilizer resources, commonly referred to as quantum magic. In this paper, we investigate the non-stabilizerness of quantum states arising in a class of spin Hamiltonians by computing their stabilizer Rényi entropies. Using real-space renormalization-group techniques, we obtain a closed-form expression valid in the low-energy, large-distance regime. We analyze how quantum magic evolves under coarse-graining and explore its behavior across different parameter regimes and quantum phases.

quant-pharXiv:2609.17188•Sep 16, 2026•0 citations

Computing quantum magic of state vectors

Piotr Sierant, Jofre Vallès-Muns, Artur Garcia-Saez

Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful probe of the complexity of quantum many-body states. Yet standard magic quantifiers, such as the stabilizer Rényi entropy (SRE) for qubits and the mana for qutrits, are costly to evaluate numerically, with the computational complexity growing rapidly with the number $N$ of qudits. Here we introduce efficient, numerically exact algorithms that exploit the fast Hadamard transform to compute the SRE for qubits ($d=2$) and the mana for qutrits ($d=3$) for pure states given as state vectors. Our methods compute SRE and mana at cost $O(N d^{2N})$, providing an exponential improvement over the naive $O(d^{3N})$ scaling, with substantial parallelism and straightforward GPU acceleration. We further show how to combine the fast Hadamard transform with Monte Carlo sampling to estimate the SRE of state vectors, and we extend the approach to compute the mana of mixed states. All algorithms are implemented in the open-source Julia package HadaMAG ( https://github.com/bsc-quantic/HadaMAG.jl/ ), which provides a high-performance toolbox for computing SRE and mana with built-in support for multithreading, MPI-based distributed parallelism, and GPU acceleration. The package, together with the methods developed in this work, offers a practical route to large-scale numerical studies of magic in quantum many-body systems.

quant-pharXiv:2601.07824•Quantum•Jan 13, 2026•7 citations
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, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing. However, analytical and numerical characterizations of magic are very challenging, especially for multi-qubit systems, even with a moderate qubit number. Here, we systemically and analytically investigate the magic resource of archetypal multipartite quantum states—quantum hypergraph states, which can be generated by multi-qubit controlled-phase gates encoded by hypergraphs. We first derive the magic formula in terms of the stabilizer Rényi- α entropies for general quantum hypergraph states. If the average degree of the corresponding hypergraph is constant, we show that magic cannot reach the maximal value, i.e., the number of qubits n . Then, we investigate the statistical behaviors of random hypergraph states' magic and prove a concentration result, indicating that random hypergraph states typically reach the maximum magic. This also suggests an efficient way to generate maximal magic states with random diagonal circuits. Finally, we study hypergraph states with permutation symmetry, such as 3 -complete hypergraph states, where any three vertices are connected by a hyperedge. Counterintuitively, such states can only possess constant or even exponentially small magic for α≥2 . Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.
Quantum advantage is widely understood to rely on key quantum resources beyond entanglement, among which nonstabilizerness (quantum ``magic'') plays a central role in enabling universal quantum computation. However, the exact evaluation of the second-order stabilizer Rényi entropy for generic many-body quantum states remains computationally challenging, with brute-force methods scaling as O(8N)\mathcal O(8^N)O(8N) for an NNN-qubit state. Here we develop a deterministic and exact algorithm that reduces this cost to O(N4N)\mathcal{O}(N4^N)O(N4N) while retaining natural parallelism. This advance enables high-precision exact calculations for generic state vectors at medium system sizes, and provides a practical tool for investigating the scaling, phase structure, and nonequilibrium dynamics of quantum magic in 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.
Understanding universal aspects of many-body systems is one of the central themes in modern physics. Recently, the stabilizer Rényi entropy (SRE) has emerged as a computationally tractable measure of nonstabilizerness, a crucial resource for fault-tolerant universal quantum computation. While numerical results suggested that the SRE in critical states can exhibit universal behavior, its comprehensive theoretical understanding has remained elusive. In this work, we develop a field-theoretical framework for the SRE in a ( 1 + 1 )-dimensional many-body system and elucidate its universal aspects by using boundary conformal field theory. We demonstrate that the SRE is equivalent to a participation entropy in the Bell basis of a doubled Hilbert space, which can be calculated from the partition function of a replicated field theory with the interlayer line defect created by the Bell-state measurements. This identification allows us to characterize the universal contributions to the SRE on the basis of the data of conformal boundary conditions imposed on the replicated theory. We find that the SRE of the entire system contains a universal size-independent term determined by the noninteger ground-state degeneracy known as the g factor. In contrast, we show that the mutual SRE exhibits the logarithmic scaling with a universal coefficient given by the scaling dimension of a boundary-condition-changing operator, which elucidates the origin of universality previously observed in numerical results. As a concrete demonstration, we present a detailed analysis of the Ising criticality, where we analytically derive the universal quantities at arbitrary Rényi indices and numerically validate them with high accuracy by employing tensor-network methods. These results establish a field-theoretical approach to understanding the universal features of nonstabilizerness in quantum many-body systems.
Stabilizer states constitute an important class of quantum states that can be generated from computational-basis states using Pauli operators and Clifford gates. Although they may exhibit substantial multipartite entanglement, quantum circuits restricted to stabilizer operations can be efficiently simulated classically and therefore cannot, by themselves, provide a quantum computational advantage. Such an advantage requires non-stabilizer resources, commonly referred to as quantum magic. In this paper, we investigate the non-stabilizerness of quantum states arising in a class of spin Hamiltonians by computing their stabilizer Rényi entropies. Using real-space renormalization-group techniques, we obtain a closed-form expression valid in the low-energy, large-distance regime. We analyze how quantum magic evolves under coarse-graining and explore its behavior across different parameter regimes and quantum phases.
Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful probe of the complexity of quantum many-body states. Yet standard magic quantifiers, such as the stabilizer Rényi entropy (SRE) for qubits and the mana for qutrits, are costly to evaluate numerically, with the computational complexity growing rapidly with the number NNN of qudits. Here we introduce efficient, numerically exact algorithms that exploit the fast Hadamard transform to compute the SRE for qubits (d=2d=2d=2) and the mana for qutrits (d=3d=3d=3) for pure states given as state vectors. Our methods compute SRE and mana at cost O(Nd2N)O(N d^{2N})O(Nd2N), providing an exponential improvement over the naive O(d3N)O(d^{3N})O(d3N) scaling, with substantial parallelism and straightforward GPU acceleration. We further show how to combine the fast Hadamard transform with Monte Carlo sampling to estimate the SRE of state vectors, and we extend the approach to compute the mana of mixed states. All algorithms are implemented in the open-source Julia package HadaMAG ( https://github.com/bsc-quantic/HadaMAG.jl/ ), which provides a high-performance toolbox for computing SRE and mana with built-in support for multithreading, MPI-based distributed parallelism, and GPU acceleration. The package, together with the methods developed in this work, offers a practical route to large-scale numerical studies of magic in quantum many-body systems.