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

Entanglement of random hypergraph states

You Zhou, Alioscia Hamma

Published Jul 7, 2022• 14 citations
arXivHTMLPDF

Abstract

Random quantum states and operations are of fundamental and practical interests. In this paper, we investigate the entanglement properties of random hypergraph states, which generalize the notion of graph states by applying generalized controlled-phase gates on an initial reference product state. In particular, we study the two ensembles generated by random controlled-Z (CZ) and controlled-controlled-Z (CCZ) gates, respectively. By applying tensor network representation and combinational counting, we analytically show that the average subsystem purity and entanglement entropy for the two ensembles feature the same volume law but greatly differ in typicality, namely, the purity fluctuation is small and universal for the CCZ ensemble while it is large for the CZ ensemble. We discuss the implications of these results for the onset of entanglement complexity and quantum chaos.

DOI
10.1103/physreva.106.012410

Related papers

Multipartite entanglement sudden death and birth in randomized hypergraph states

Vinícius Salem, Alison A. Silva, Fabiano M. Andrade

We introduce and analyze the entanglement properties of randomized hypergraph (RH) states, as an extended notion of the randomization procedure in the quantum logic gates for the usual graph states, recently proposed in the literature. The probabilities of applying imperfect generalized controlled-$Z$ gates simulate the noisy operations over the qubits. We obtain entanglement measures as negativity, concurrence, and genuine multiparticle negativity, and show that entanglement exhibits a nonmonotonic behavior in terms of the randomness parameters, which is a consequence of the nonuniformity of the associated hypergraphs, reinforcing the claim that the entanglement of randomized graph states is monotonic since they are related to 2-uniform hypergraphs. Moreover, we observed the phenomena of entanglement sudden death and entanglement sudden birth in RH states. This work reveals a connection between the nonuniformity of hypergraphs and loss of entanglement.

arXiv:2310.20418•Physical Review A•Jan 10, 2024•5 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•25 citations

Ensembles of physical states and random quantum circuits on graphs

Alioscia Hamma, Siddhartha Santra, Paolo Zanardi A

In this paper we continue and extend the investigations of the ensembles of random physical states introduced in Hamma et al. [Phys. Rev. Lett. 109, 040502 (2012)]. These ensembles are constructed by finite-length random quantum circuits (RQC) acting on the (hyper)edges of an underlying (hyper)graph structure. The latter encodes for the locality structure associated with finite-time quantum evolutions generated by physical, i.e., local, Hamiltonians. Our goal is to analyze physical properties of typical states in these ensembles; in particular here we focus on proxies of quantum entanglement as purity and $\ensuremath{\alpha}$-Renyi entropies. The problem is formulated in terms of matrix elements of superoperators which depend on the graph structure, choice of probability measure over the local unitaries, and circuit length. In the $\ensuremath{\alpha}=2$ case these superoperators act on a restricted multiqubit space generated by permutation operators associated to the subsets of vertices of the graph. For permutationally invariant interactions the dynamics can be further restricted to an exponentially smaller subspace. We consider different families of RQCs and study their typical entanglement properties for finite time as well as their asymptotic behavior. We find that area law holds in average and that the volume law is a typical property (that is, it holds in average and the fluctuations around the average are vanishing for the large system) of physical states. The area law arises when the evolution time is $O(1)$ with respect to the size $L$ of the system, while the volume law arises as is typical when the evolution time scales like $O(L)$.

arXiv:1204.0288•Physical Review A•Nov 26, 2012•26 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

Statistical mechanics of multipartite entanglement in hypergraph states

Paolo Scarafile, Giorgia Trotta, Paolo Facchi +4 more

We investigate multipartite entanglement in a particular family of pure $n$-qubit hypergraph states through a statistical-mechanics framework, where the average bipartite purity maps onto an effective Hamiltonian of $2^n$ classical binary spins. In this correspondence, each hypergraph state uniquely corresponds to a classical spin configuration, while temperature serves as a control parameter that continuously interpolates between a uniform ensemble of random hypergraph states at high temperature and maximally multipartite entangled states (MMES) at zero temperature. Remarkably, the exponential of the zero-temperature entropy directly gives the number of MMES within the set of hypergraph states. For small system sizes ($n \leq 5$), we perform an exact enumeration, fully characterizing the energy landscape and associated thermodynamic observables, and validating known MMES counts. For larger systems ($n = 6$ and $7$), where exact methods become computationally infeasible, we employ simulated annealing and parallel tempering algorithms to efficiently sample the exponentially large state space. Our analysis yields quantitative predictions of the number of MMES and reveals how entanglement is statistically distributed across the sets of hypergraph states. These results establish hypergraph states as an ideal platform for investigating multipartite entanglement through thermodynamic methods, offering both computational advances and physical insights into the structure of quantum entanglement in restricted families of quantum states.

quant-pharXiv:2609.24508•Sep 22, 2026•0 citations

Randomized Hypergraph States and Their Entanglement Properties

Vinícius Salem, Alison A. Silva, Fabiano M. Andrade

ABSTRACT We study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph‐based quantum states. In our model, imperfect generalized multi‐qubit gates are applied probabilistically, simulating experimentally realistic noisy gate operations where gate fidelity decreases with increasing hyperedge order. We analyze bipartite and genuine multipartite entanglement of these mixed multi‐qubit states. Numerical results for various hypergraph configurations with up to four qubits reveal rich, sometimes nonmonotonic entanglement behavior stemming from the interplay between hyperedge structure and gate imperfections. We derive analytical expressions for entanglement witnesses based on randomization overlap for new hypergraph families. Our findings contribute to understanding entanglement resilience under gate imperfections, providing insight into the experimental implementation of hypergraph states in noisy quantum devices.

arXiv:2506.20075•Annalen der Physik•Jan 1, 2026•2 citations
Random quantum states and operations are of fundamental and practical interests. In this paper, we investigate the entanglement properties of random hypergraph states, which generalize the notion of graph states by applying generalized controlled-phase gates on an initial reference product state. In particular, we study the two ensembles generated by random controlled-Z (CZ) and controlled-controlled-Z (CCZ) gates, respectively. By applying tensor network representation and combinational counting, we analytically show that the average subsystem purity and entanglement entropy for the two ensembles feature the same volume law but greatly differ in typicality, namely, the purity fluctuation is small and universal for the CCZ ensemble while it is large for the CZ ensemble. We discuss the implications of these results for the onset of entanglement complexity and quantum chaos.
We introduce and analyze the entanglement properties of randomized hypergraph (RH) states, as an extended notion of the randomization procedure in the quantum logic gates for the usual graph states, recently proposed in the literature. The probabilities of applying imperfect generalized controlled-ZZZ gates simulate the noisy operations over the qubits. We obtain entanglement measures as negativity, concurrence, and genuine multiparticle negativity, and show that entanglement exhibits a nonmonotonic behavior in terms of the randomness parameters, which is a consequence of the nonuniformity of the associated hypergraphs, reinforcing the claim that the entanglement of randomized graph states is monotonic since they are related to 2-uniform hypergraphs. Moreover, we observed the phenomena of entanglement sudden death and entanglement sudden birth in RH states. This work reveals a connection between the nonuniformity of hypergraphs and loss of entanglement.
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.
In this paper we continue and extend the investigations of the ensembles of random physical states introduced in Hamma et al. [Phys. Rev. Lett. 109, 040502 (2012)]. These ensembles are constructed by finite-length random quantum circuits (RQC) acting on the (hyper)edges of an underlying (hyper)graph structure. The latter encodes for the locality structure associated with finite-time quantum evolutions generated by physical, i.e., local, Hamiltonians. Our goal is to analyze physical properties of typical states in these ensembles; in particular here we focus on proxies of quantum entanglement as purity and $\ensuremath{\alpha}$-Renyi entropies. The problem is formulated in terms of matrix elements of superoperators which depend on the graph structure, choice of probability measure over the local unitaries, and circuit length. In the $\ensuremath{\alpha}=2$ case these superoperators act on a restricted multiqubit space generated by permutation operators associated to the subsets of vertices of the graph. For permutationally invariant interactions the dynamics can be further restricted to an exponentially smaller subspace. We consider different families of RQCs and study their typical entanglement properties for finite time as well as their asymptotic behavior. We find that area law holds in average and that the volume law is a typical property (that is, it holds in average and the fluctuations around the average are vanishing for the large system) of physical states. The area law arises when the evolution time is O(1)O(1)O(1) with respect to the size LLL of the system, while the volume law arises as is typical when the evolution time scales like O(L)O(L)O(L).
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.
We investigate multipartite entanglement in a particular family of pure nnn-qubit hypergraph states through a statistical-mechanics framework, where the average bipartite purity maps onto an effective Hamiltonian of 2n2^n2n classical binary spins. In this correspondence, each hypergraph state uniquely corresponds to a classical spin configuration, while temperature serves as a control parameter that continuously interpolates between a uniform ensemble of random hypergraph states at high temperature and maximally multipartite entangled states (MMES) at zero temperature. Remarkably, the exponential of the zero-temperature entropy directly gives the number of MMES within the set of hypergraph states. For small system sizes (n≤5n \leq 5n≤5), we perform an exact enumeration, fully characterizing the energy landscape and associated thermodynamic observables, and validating known MMES counts. For larger systems (n=6n = 6n=6 and 777), where exact methods become computationally infeasible, we employ simulated annealing and parallel tempering algorithms to efficiently sample the exponentially large state space. Our analysis yields quantitative predictions of the number of MMES and reveals how entanglement is statistically distributed across the sets of hypergraph states. These results establish hypergraph states as an ideal platform for investigating multipartite entanglement through thermodynamic methods, offering both computational advances and physical insights into the structure of quantum entanglement in restricted families of quantum states.
ABSTRACT We study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph‐based quantum states. In our model, imperfect generalized multi‐qubit gates are applied probabilistically, simulating experimentally realistic noisy gate operations where gate fidelity decreases with increasing hyperedge order. We analyze bipartite and genuine multipartite entanglement of these mixed multi‐qubit states. Numerical results for various hypergraph configurations with up to four qubits reveal rich, sometimes nonmonotonic entanglement behavior stemming from the interplay between hyperedge structure and gate imperfections. We derive analytical expressions for entanglement witnesses based on randomization overlap for new hypergraph families. Our findings contribute to understanding entanglement resilience under gate imperfections, providing insight into the experimental implementation of hypergraph states in noisy quantum devices.