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

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

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

Nonstabilizerness Dynamics in Many-Body Localized Systems

Pedro R. Nicácio Falcão, Piotr Sierant, Jakub Zakrzewski +1 more

Nonstabilizerness, also known as "magic," quantifies the deviation of quantum states from stabilizer states, capturing the complexity necessary for quantum computational advantage. In this Letter, we investigate the dynamics of nonstabilizerness in disordered many-body localized (MBL) systems using the stabilizer Rényi entropy (SRE). Leveraging a phenomenological description based on the ℓ-bit model, we analytically and numerically demonstrate that interactions profoundly influence nonstabilizerness spreading, inducing a power-law growth of SRE that markedly contrasts with the rapid saturation observed in ergodic systems. We validate our theoretical predictions through numerical simulations of the disordered transverse-field Ising model, showing excellent agreement across various disorder strengths, system sizes, and initial states. Additionally, we uncover a universal relationship between SRE and entanglement entropy, revealing their common scaling in the MBL regime independent of disorder strength and system size. Our results offer critical insights into the interplay of disorder, interactions, and complexity in quantum many-body systems.

arXiv:2503.07468•Physical Review Letters•Nov 19, 2025•30 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

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
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.
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.
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.
Nonstabilizerness, also known as "magic," quantifies the deviation of quantum states from stabilizer states, capturing the complexity necessary for quantum computational advantage. In this Letter, we investigate the dynamics of nonstabilizerness in disordered many-body localized (MBL) systems using the stabilizer Rényi entropy (SRE). Leveraging a phenomenological description based on the ℓ-bit model, we analytically and numerically demonstrate that interactions profoundly influence nonstabilizerness spreading, inducing a power-law growth of SRE that markedly contrasts with the rapid saturation observed in ergodic systems. We validate our theoretical predictions through numerical simulations of the disordered transverse-field Ising model, showing excellent agreement across various disorder strengths, system sizes, and initial states. Additionally, we uncover a universal relationship between SRE and entanglement entropy, revealing their common scaling in the MBL regime independent of disorder strength and system size. Our results offer critical insights into the interplay of disorder, interactions, and complexity 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.
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.