1 Introduction

Entanglement is a fundamental feature of quantum mechanics and a central resource in quantum information, enabling relevant applications such as quantum teleportation [1–3], quantum computation [4], quantum communication [5] and quantum cryptography [6–9]. While the bipartite entanglement of pure states is unambiguously quantified in terms of the entropy of either single-party reduced state [10–12], the quantification of multipartite entanglement remains more intricate and less unified [13–15]. This has led to multiple approaches being developed, each focusing on different aspects of the problem, for instance the invariance under permutation of the parties [16, 17], the scalability of the measure with the system size [18], the structural analogy with the bipartite von Neumann entropy [13] or the mutual exclusivity of single-partite and bipartite properties of subsystems [19]. These different characterizations of multipartite entanglement often yield distinct and, in some cases, incompatible classifications.

Various studies have shown that multipartite entanglement exhibits frustration, i.e., the impossibility of simultaneously maximizing entanglement across all bipartitions [20–24], making statistical methods from complex systems particularly suitable for its characterization.

In this context, analyzing the statistical distribution of entanglement measures, such as the purity over all balanced bipartitions and related quantities like the average linear entropy [13, 22, 25], has emerged as a powerful tool for characterizing multipartite entanglement [26]. This approach has been effectively applied to typical pure states sampled according to the Haar measure in qubit systems [27–30].

A particularly significant class of states is that of maximally multipartite entangled states (MMES), which are defined as those that maximize entanglement across all balanced bipartitions [25]. The presence of quantum frustration makes the identification of these maximally entangled states particularly demanding and significant. In addition, the number of free parameters in quantum states and the number of bipartitions of the total system both grow exponentially with system size, making the investigation of multipartite entanglement and the search for MMES analytically and computationally very challenging [24, 28].

In this framework, Hadamard states, so named as they corresponds to a single row (or column) of a complex Hadamard matrix of the Butson class [31, 32], and characterized by equal weights in the computational basis, have been identified as compatible with MMES requirements, providing a structured class for theoretical and computational analysis [29]. Their intriguing properties, in terms of frustration and symmetries, make them promising candidates for investigating multipartite entanglement in qubit systems.

In this work, we characterize the entanglement properties of Hadamard states of n qubits using a statistical approach. We analyze different ensembles of Hadamard states, having equal weights in the computational basis and phases independently and uniformly distributed over the q-th roots of unity, with q = 2,3,…: hypergraph states (q = 2), introduced in ref. [33], whose phases are the square roots of unity, either 1 or − 1 and which correspond to a row (or column) of a real Hadamard matrix of the Butson class; the Hadamard-Butson Pq-states (q = 3,4,…), whose possible phases are the vertices of a regular q-polygon, namely, ei2πr q , with r = 0,…q − 1; and Hadamard-typical states (q = ∞), whose phases are uniformly distributed over the unit circle. Notice that Hadamard-typical states are locally maximally entanglable states (LMEs), as showed in ref. [34].

Through analytical calculations and numerical simulations, we demonstrate that Hadamard ensembles exhibit, on average, a higher degree of entanglement than the Haar ensemble. Moreover, we show that the class of hypergraph states exhibits distinctive statistical properties that make them particularly promising for identifying MMES. In addition, hypergraph states occur naturally in the analysis of quantum algorithms such as the Deutsch-Jozsa algorithm and the Grover algorithm [33, 35] and, can be complex in the sense of Kolmogorov complexity, so they could, for instance, be used for quantum fingerprinting protocols [36]. Nonetheless, identifying MMES, even in the class of hypergraph states remains challenging, particularly as the system size increases.

The Article is structured as follows. In section 2, we introduce the necessary background and notation, review key results on Haar-typical states, and define the classes of Hadamard states under investigation. Section 3 is devoted to the evaluation of the first two cumulants of the purity distribution associated to a fixed bipartition, while section 4 extends the analysis to the purity averaged over all balanced bipartitions. Throughout, particular emphasis is placed on comparing the statistical entanglement features of Hadamard and Haar ensembles. Lastly, in section 5, we analyze the large-system limit of the purity distributions for Hadamard states and compare it with that of Haar-typical states.

2 Preliminaries and definitions

We consider a system 𝒮 = {1,…,n}of n qubits, described by a Hilbert space of dimension N = 2n,

H𝒮 = ⊗ i∈𝒮ℂi2 ≃ℂN. (2.1)

A pure state of the system can be expressed in the computational basis as

|ψ⟩ = ∑ k∈𝔹nzk|k⟩, (2.2)

where 𝔹 = {0,1}, k = (k1,…,kn) with ki ∈ 𝔹, |k⟩ = ⊗ i∈𝒮|ki⟩i, |ki⟩i ∈ ℂi2, and the normalization condition ∑ k|zk|2 = 1 holds.

A bipartition of the system is defined by a pair (A,A¯), where A ⊂ 𝒮, A¯ = 𝒮 ∖ A, and 1 ≤ nA ≤ nA¯, with nA = |A|. A bipartition is said to be balanced if nA = ⌊n∕2⌋.

Given a bipartition (A,A¯) and a pure state |ψ⟩, the purity of subsystem A is defined as

πA = Tr(ρA2),ρ A = TrA¯(|ψ⟩⟨ψ|). (2.3)

The purity quantifies the degree of entanglement between the two subsystems: lower values of πA indicate stronger entanglement. For a subsystem of nA qubits, the purity is bounded as

1 2nA ≤πA ≤ 1. (2.4)

The purity of a fixed bipartition (A,A¯) has the following expression [26]:

πA(𝐳) = ∑ k∈𝔹n ∑ l∈𝔹A ∑ m∈𝔹A¯zkzk⊕l∗z k⊕l⊕mzk⊕m∗, (2.5)

where ⊕ is the bitwise XOR operation. This quantity describes the entanglement of the single bipartition (A,A¯), and fails in capturing the entanglement properties of the system as a whole.

A quantification of global multipartite entanglement for pure states is provided by the potential of multipartite entanglement, defined as the average purity over all balanced bipartitions [25],

πME =( n ⌊n 2 ⌋)−1 ∑ |A|=⌊n 2 ⌋πA. (2.6)

This quantity can be expressed as follows in terms of the state’s Fourier coefficients 𝐳 = (z1,…,zN) [25, 29]:

πME(𝐳) = ∑ k,l,m∈𝔹ng(l,m)zkzk⊕l∗z k⊕l⊕mzk⊕m∗, (2.7)

where

g(l,m) = δl∧m,0ĝ(|l|,|m|), (2.8a) ĝ(s,t) = 1 2( n ⌊n 2 ⌋)−1 [(n −s −t ⌊n 2 ⌋−s) +( n −s −t ⌊n 2 ⌋−t) ]. (2.8b)

Here, |l| = ∑ i∈𝒮li, while ∧ denotes the bitwise AND operation.

The average purity πME inherits the bounds (2.4) of the purity πA of a fixed balanced bipartition, with nA = ⌊n∕2⌋, namely,

1 2⌊n 2 ⌋ ≤πME ≤ 1. (2.9)

Correspondingly, maximally multipartite entangled states (MMES) are defined as those minimizing the potential of multipartite entanglement (2.6).

In the case of a system of n qubits the minimal possible value of the potential of multipartite entanglement πME equals 2−⌊n∕2⌋. This theoretical bound for the minimum is saturated if perfect MMES or Absolutely Maximally Entangled (AME) states [37–41] exist. For n = 2 AME states are Bell states up to local unitary transformations, while for n = 3 they include the GHZ states [25, 38]. For n = 5 and n = 6, numerous examples of AME states have been identified [25]. Conversely, it has been proven that AME states do not exist for n = 4 [21], n = 7 [20, 22, 23], and n ≥ 8 [20, 22], due to quantum frustration [24]. Frustration arises due to competing requirements among different bipartitions.

In the following we introduce Haar-typical and Hadamard states and review the main properties of the former.

2.1 Statistical properties of Haar-typical states

The unit sphere of states (2.2) of n qubits in H𝒮,

𝕊2N−1 ={𝐳 = (z 1,…,zN) ∈ℂN : ∑ k|zk|2 = 1}, (2.10)

is invariant under the action of the unitary group U(H𝒮) ≃ U(N), with N = 2n, and Haar-typical pure states are sampled uniformly on 𝕊2N, according to the Haar measure of U(N) [42].

The properties of Haar-typical pure states have been extensively studied [26, 27, 30, 42–47], and such states can be efficiently generated through chaotic dynamics [48] and experimentally realized with different approaches [49–51]. The distribution of the purity referred to a fixed bipartition (A,A¯) has mean and variance given by [26, 27, 44]

μA = ⟨πA⟩ = 2nA + 2nA¯ 2n + 1 , (2.11) σA2 = ⟨(π A −μA)2⟩ = 2 (22nA − 1) (22nA¯ − 1) (2n + 1)2(2n + 2)(2n + 3), (2.12)

where nA = |A|is the number of qubits in subsystem A, nA¯ = n −nA, and ⟨⋯⟩ denotes the ensemble average over pure states uniformly distributed on 𝕊2N−1,

𝐳 ∼Unif(𝕊2N−1). (2.13)

The mean of πME is

μME = ⟨πME⟩ = μA, (2.14)

with (A,A¯) being any balanced bipartition, and thus it is given by (2.11) for nA = ⌊n∕2⌋,

μME = 2⌊n 2 ⌋ + 2⌈n 2 ⌉ 2n + 1 . (2.15)

The variance, σME2 = ⟨(πME −μME) 2⟩, is given by [30]

σME2 = (2n + 1)f2(n) − 2 (2⌊n 2 ⌋ + 2⌈n 2 ⌉) 2 (2n + 1)2(2n + 2)(2n + 3) , (2.16)

where

f2(n) = 4∑ k,l∈𝔹ng(k,l)2 = ∑ s,t=0⌈n 2 ⌉ ( n s,t)−1 [(⌊n 2 ⌋ s)( ⌈n 2 ⌉ t) +( ⌊n 2 ⌋ t)( ⌈n 2 ⌉ s) ]2 (2.17)

with ( n s,t) = n! s!t!(n−s−t)! being the trinomial coefficient.

2.2 Hadamard states

For any pure state expressed in the computational basis, one can define the population probability vector (PS(k))k∈𝔹n = (|zk|2)k∈𝔹n, whose components represent the probability of observing the computational basis state |k⟩. The population probability vector of Haar-typical states (2.13) is uniformly distributed on the (N − 1)-dimensional probability simplex ΔN−1, namely PS ∼ Uniform(ΔN−1) [52].

A necessary condition for a state to qualify as an AME state, and hence to saturate the theoretical minimum in (2.9), is that all the marginals over nA ≤ n∕2 variables of its population probability vector, PS(k), are completely random [29].

A notable class of states satisfying this condition is the class of Hadamard states, defined by the property

|zk|2 = 1 2n,∀k ∈𝔹n, (2.18)

which fixes the population probability vector at the center of the simplex ΔN−1. Thus, for Hadamard states, the Fourier coefficients take the form,

zk = sk 2n,sk = eiϕk ∈𝕊,∀k ∈𝔹n, (2.19)

with 𝕊 = {z ∈ ℂ : |z| = 1} being the unit circle of complex numbers of unit modulus.

A central objective in the study of multipartite entanglement is the characterization of MMES, particularly in the context of frustrated systems, where AME states do not exist. However, MMES states are highly atypical and occur with vanishing probability under Haar measure [25]. In the case of n qubits, a generic pure state is described by N = 2n complex amplitudes 𝐳 = (z1,…,zN), that correspond to a point on the (2N − 1)-dimensional sphere (2.10). This results in a high-dimensional optimization problem when attempting to minimize the average purity.

To address this challenge, it is useful to investigate classes of quantum states characterized by a reduced number of parameters, while still satisfying the necessary condition for perfect MMES. It is known that Haar-typical states have Fourier coefficients with independently and uniformly distributed phases sk = zk∕|zk| ∼ Unif(𝕊) [28, 52]. The approach adopted in this work retains this statistical feature while restricting the number of free parameters.

This motivates the study of the statistical properties of Hadamard states, particularly those whose phases sk are in a finite number and symmetrically distributed on the unit circle 𝕊. We refer to these as Hadamard-Butson Pq-states, for q = 2,3,…, and they are listed in table 1. They are classified according to the allowed phases sk ∈ Pq, taken to be the vertices of the regular polygon

Pq = {ei2πr q : r = 0,…,q − 1} (2.20)

of the q-th roots of unity. In particular, the Butson P2-states coincide with the hypergraph states, whose phases are restricted to ± 1.

In the following analysis we will consider, as ensembles of random states, Hadamard-Buston Pq-states with phases independently and uniformly distributed over the polygon,

sk ∼Unif(Pq),k ∈𝔹n, (2.21)

together with the limiting case q = ∞, corresponding to Hadamard-typical states, whose phases are independently and uniformly distributed over the entire unit circle,

sk ∼Unif(𝕊),k ∈𝔹n. (2.22)

We will compare their statistical properties with those of the Haar-typical states discussed in the previous section.

Let us highlight that hypergraph states can already be experimentally realized [53], while an experimental protocol for the generation of generic Hadamard states is still missing.

Table 1: Classification of Hadamard-Butson Pq-states (q = 2,3,…) based on the possible values of the phases sk ∈𝕊 of their Fourier coefficients (2.19) in the computational basis.
Fourier coefficients zk = sk 2n Notation
sk ∈P2 = {+1,−1} Hypergraph states (q = 2)
sk ∈Pq = {ei2πr q } r=0,…,q−1 Butson Pq-states (q ≥ 3)
sk ∈𝕊 = {eiϕ} ϕ∈[0,2π] Hadamard states (q = ∞)

3 First two cumulants of the purity at fixed bipartition

PIC
(a)
PIC
(b)
PIC
(c)
PIC
(d)
PIC
(e)
PIC
(f)
Figure 1: Histograms of the purity distribution for the balanced bipartition (A,A¯) with A = {1,…,⌊n∕2⌋}, based on 2.3 × 106 samplings of systems of n = 6 qubits (first row) and n = 8 qubits (second row) for Hadamard-Butson Pq-states: ((a),(d)) hypergraph states (q = 2); ((b),(e)) Butson P4-states and ((c),(f)) Hadamard-typical states (q = ∞). In all the plots, the horizontal axis starts from the minimum value of πA. Red lines indicate the theoretical value of the mean purity (3.2), while the (almost coinciding) dotted blue lines correspond to the numerically computed one. In (c),(f) we have also plotted the Gaussians having mean and variance corresponding to the ones in eqs. (3.2) and (3.4). We observe that the Gaussian approximation already provides an accurate description for n = 8. Notice that for n = 6 qubits, in the first line, there exist AME Hadamard states, with all purities of balanced bipartitions at the minimal value 1∕8 = 0.125, while for n = 8 qubits, in the second line, there exist no AME state, with all πA having the minimal value 1∕16 = 0.0625, as highlighted by the full and empty dots on the horizontal axis, respectively.

In this section, we investigate the first two cumulants of the purity distribution associated with the classes of random Hadamard states listed in table 1.

As shown in ref. [29], the purity corresponding to a fixed bipartition (A,A¯) of a Hadamard state can be expressed as

πA(𝐬) = 2nA + 2nA¯ − 1 2n + 1 22n ∑ k∈𝔹n ∑ l∈𝔹∗A ∑ m∈𝔹∗A¯sksk⊕l∗s k⊕l⊕msk⊕m∗, (3.1)

where 𝔹∗m = 𝔹m ∖{0} denotes the set of all nonzero m-bit binary strings. Importantly, since their indexes are all distinct, each term in the sum of eq. (3.1) consists of four independent random variables of zero mean (2.21), and thus has zero average. Therefore, the mean of the purity distribution is given by the first term in (2.5), i.e.

μA = ⟨πA⟩ = 2nA + 2nA¯ − 1 2n . (3.2)

This allows us to write the purity as a sum of its average and a fluctuation term,

πA(𝐬) = μA + π~A(𝐬), (3.3)

with π~A being given by the second term in (3.1).

Consequently, the variance of the purity distribution is σA2 = ⟨π~A2⟩ and is explicitly evaluated in appendix A, yielding

σA2 = 2c q(2nA − 1)(2nA¯ − 1) 23n , (3.4)

where

cq = (1 + δq,2), (3.5)

for all Butson Pq-states (2.21) with q ≥ 2, including Hadamard-typical states (2.22) (q = ∞).

Comparing the mean purities of Hadamard (3.2) and Haar ensembles (2.11), one finds that, for every bipartition (A,A¯),

(μA)Hadamard < (μA)Haar. (3.6)

Thus, Hadamard states exhibit, on average, a higher degree of entanglement than Haar states: imposing the condition (2.18) selects a subset of more entangled states.

Incidentally, observe that eq. (3.2) generalizes to the full class of hypergraph states the results previously obtained in [54] via a tensor-network approach. In particular, it shows that the mean bipartite purity for hypergraph states coincides with that of graph states. Furthermore, eq. (3.4) reveals that the fluctuations of bipartite entanglement across the ensemble of random hypergraph states exhibit the same scaling behavior identified in ref. [54] for a specific subclass of this ensemble composed by purely hypergraph states, while scaling significantly faster than the fluctuations associated exclusively with graph states.

We benchmark the analytical results through extensive numerical simulations performed as described in appendix B. The numerical data are shown in figures 1(a) and 1(d) for hypergraph states, in figures 1(b) and 1(e) for Butson P4-states, and in figures 1(c) and 1(f) for Hadamard-typical states. The results are in close agreement with the theoretical predictions given by eqs. (3.2) and (3.4). Figure 1 also highlights the discreteness of the purity spectra associated with the Butson Pq-states. However, as the qubit number increases, the purity distribution approximates a continuous one.

4 First two cumulants of the average purity

We now extend the previous analysis to the distribution of the average purity over all balanced bipartitions (2.6). Using the approach of ref. [29], the average purity for Hadamard Pq-states can be expressed as

πME(𝐬) = 2⌊n 2 ⌋ + 2⌈n 2 ⌉ − 1 2n + 1 22n ∑ k∈𝔹n ∑ l,m∈𝔹∗ng(l,m)sksk⊕l∗s k⊕l⊕msk⊕m∗, (4.1)

where g(l,m) is the coupling function (2.8a). From this expression, and proceeding analogously to that in section 3, we obtain

μME = ⟨πME⟩ = 2⌊n 2 ⌋ + 2⌈n 2 ⌉ − 1 2n , (4.2)

and

πME(𝐬) = μME + π~ME(𝐬), (4.3)

where π~ME(𝐬) denotes the second term in eq. (4.1).

By comparing (2.15) and (4.2), we get that

(μME) Hadamard < (μME) Haar, (4.4)

which confirms that Hadamard states exhibit, on average, a higher degree of entanglement than Haar-distributed states.

It follows from (4.1) that the variance of the average purity distribution is given by σME2 = ⟨π~ME2⟩. This quantity is explicitly evaluated in appendix A, yielding

σME2 = cq 23nf2∗(n), (4.5)

where cq = (1 + δq,2), for q = 2,3,…, and

f2∗(n) = 4∑ k,l∈𝔹∗ng(k,l)2 = ∑ s,t=1⌈n 2 ⌉ ( n s,t)−1 [(⌊n 2 ⌋ s)( ⌈n 2 ⌉ t) +( ⌊n 2 ⌋ t)( ⌈n 2 ⌉ s) ]2. (4.6)

Since f2∗(n) < f2(n), one also gets

(σME) Hadamard < (σME) Haar, (4.7)

for all n ≥ 4 and all Pq-states with q≠2. Interestingly, the inequality is reversed for hypergraph states, q = 2.

PIC
Figure 2: Histograms of the average purity density for n = 7 qubits obtained from 2.3 × 106 samples of different ensembles of states. The horizontal axis starts from πME = 1∕8 = 0.125, which corresponds to the theoretical bound for the minimum, which would be saturated, if seven-qubit AME states existed. Using eq. (4.8), we observe that this value, is approximately 8.4 standard deviations from the mean value of the Hadamard-typical distribution.

In figure 2, we compare the distributions of the average purity across different classes of seven-qubit states obtained through numerical simulations (details in appendix B). The Pq-states exhibit statistical behavior similar to Hadamard-typical states up to the second cumulant. In contrast, hypergraph states (q = 2) display significantly broader distributions, as predicted by eq. (4.5). All considered Hadamard states exhibit, on average, a higher degree of entanglement than Haar-typical pure states, consistently with eq. (4.2) and eq. (2.15).

The broader distribution of hypergraph states increases the probability of sampling low average purity states, making them promising candidates in the search for MMES, as highlighted by the inset of figure 2. Nevertheless, finding such states remains a formidable challenge, as indicated by the location of the theoretical bound for the minimum of the average purity (from which the horizontal axis in figure 2 starts). Specifically, we observe that, since

k = μME − 2−⌊n 2 ⌋ σME = (2⌊n 2 ⌋ − 1)2n 2 (cqf2∗(n))1 2 , (4.8)

the theoretical minima, even in the case of hypergraph states, lie k standard deviations below the average value, with k ≃ 2.9,3.2,7.5,8.4, and 19 for n = 4,5,6,7, and 8, respectively.

We further extend our analysis to different system sizes by numerically simulating systems up to 12 qubits. In figure 3, we show analytical (solid lines) and numerical (scattered points) values of the mean and standard deviation of the average purity distribution for all classes of states. Analytical results are given by: eq. (2.15) and the square root of eq. (2.16) for Haar-typical ensembles; eq. (4.2) and the square root of eq. (4.5) for all Hadamard ensembles. All the numerical results are in strong agreement with the analytical predictions, confirming the distinctive properties of hypergraph states (P2-states).

PIC
Figure 3: Mean and standard deviation of the average purity distribution as a function of system size, showing theoretical predictions (solid lines) and numerical results (scattered points) for Haar-typical states (red), hypergraph states (blue), Butson P3-, P4-, P8-states and Hadamard-typical states (black).

5 Large-system limit

As shown in section 3, the fluctuating part π~A(𝐬) of the purity of a fixed bipartition of a Hadamard state (3.1) consists of O(22n) terms of order O(1∕22n). For a large number n of qubits, the purity distribution of Hadamard states referred to a fixed bipartition is close to a Gaussian distribution with mean given by eq. (3.2) and variance given by eq. (3.4).

The asymptotic mean of the purity distributions of Hadamard states (3.2) coincides with that of Haar-typical states (2.11),

μA ∼ 1 2nA + 1 2nA¯, (5.1)

as n → ∞. This occurs because the fluctuations in the moduli of the components a unit random vector become relatively small as the vector length increases, so a generic random vector effectively behaves like one with equal moduli.

Similarly, the asymptotic behavior of the variance (3.4) of the purity distribution for the Hadamard ensembles is

σA2 ∼c q 2 22n, (5.2)

as n → ∞, where cq = 1 + δq,2. Thus, it is asymptotically equivalent to the variance (2.12) of the Haar ensemble, except in the special case q = 2, corresponding to hypergraph states, where it is twice as large.

For large n, the distribution of the average purity πME of Haar-typical states is also approximately Gaussian [28]. Its mean (2.15) behaves as

μME ∼ 1 2n 2 { 2 if n even 3 2if n odd , (5.3)

as n → ∞. Moreover, the function in (2.17) has the following asymptotics [30]:

f2(n) ∼ 32 (3 2 )n = 322αn, (5.4)

as n → ∞, where

α = log⁡2 (3 2 ) ≃ 0.58. (5.5)

Therefore, the variance σME2 given by (2.16), behaves as

σME2 ∼ 32 ( 3 16 )n = 32 1 2(3−α)n. (5.6)

Analogous considerations apply to the average purity of ensembles of Hadamard states, expressed by eq. (4.1), which also consists of at most 22n terms of order O(1∕22n), and for large n is close to a Gaussian with mean being given by eq. (4.2), and variance being provided by eq. (4.5) for all the ensembles of Hadamard Pq-states.

For large n, the mean (4.2) of the Hadamard ensembles has the same asymptotics (2.14) of the Haar ensemble. Moreover, as derived in appendix C, the function f2∗ has the same asymptotic behavior (2.17) of f2, namely,

f2∗(n) ∼ 32 (3 2 )n = 322αn, (5.7)

as n → ∞. Therefore, in this limit, the variance of the average purity distribution becomes

σME2 ∼ 32c q ( 3 16 )n = 32c q 1 2(3−α)n, (5.8)

with cq = (1 + δq,2), for all ensembles of Hadamard states in table 1.

Thus, in the large-system limit, all Hadamard states, except the hypergraph states, exhibit the same asymptotic purity distribution as Haar states.

However, notice that Hadamard states retain an entanglement advantage: the distance between the averages scales as

ΔμME = (μME)Haar − (μME)Hadamard ∼ 1 2n, (5.9)

while the variances scale as in eqs. (5.6) and (5.8), that is σME = O((3∕16)n∕2). Thus,

σME ΔμME = O((3 8)n 2 ) (5.10)

and the distributions of Hadamard states and Haar-typical states remain statistically distinct even for large systems. Furthermore, the hypergraph states retain a particular feature in the high-entanglement regime, showing increased probabilities even in the large-system limit. This distinctive scaling behavior, also highlighted by the inset of figure 3, makes hypergraph states uniquely valuable for exploring extreme entanglement even in large qubit systems.

6 Concluding remarks and outlook

We systematically investigated the statistical properties of the purity and average purity for various ensembles of Hadamard states of qubits. By extending the approach pioneered in refs. [28, 30, 47], we derived exact analytical expressions for the first and second cumulants of these distributions. We also performed extensive numerical simulations to validate these analytical results. We showed that all considered Hadamard states exhibit on average a higher degree of entanglement than typical (Haar-distributed) states.

Our analysis also revealed the unique properties of hypergraph states, whose purity fluctuations are significantly larger than those of the other ensembles of Hadamard Pq-states. The increased variance in the purity distribution of the hypergraph states suggests a higher probability of sampling states that approach the theoretical minimum of the average purity, even for large systems. This makes the hypergraph states promising candidates in the ongoing search for MMES.

An interesting future direction would be the extension of our cumulant analysis to higher-order moments, which could deepen the statistical characterization of purity distribution and potentially unveil additional features of Hadamard states compared to typical ones. Moreover, while MMES have been extensively studied among typical states [24], an extensive numerical and analytical analysis of MMES among Hadamard states, and particularly among hypergraph states, is still missing.

The identification and characterization of highly entangled multipartite states have implications beyond fundamental physics. Such states are crucial resources for quantum algorithms, particularly in quantum optimization protocols and certain quantum machine learning schemes where entanglement enables the efficient exploration of large solution spaces [55–61]. Additionally, understanding multipartite entanglement is relevant for developing and analyzing quantum error correcting codes [22, 62, 63].

In summary, this work deepens our understanding of multipartite entanglement through statistical lens, revealing distinctive properties of Hadamard quantum states that suggest promising directions for future research.

Acknowledgments

We thank Chiara Macchiavello and Flavio Baccari for useful discussions and feedback on our work.

We acknowledge support from INFN through the project “QUANTUM” and from the Italian funding within the “Budget MUR — Dipartimenti di Eccellenza 2023-2027” — Quantum Sensing and Modelling for One-Health (QuaSiModO). PF acknowledges support from the Italian National Group of Mathematical Physics (GNFM-INdAM) and from PNRR MUR project CN00000013-“Italian National Centre on HPC, Big Data and Quantum Computing“. GM acknowledges support from the University of Bari via the 2023-UNBACLE- 0244025 grant and from INFN through the project “NPQCD”. SP acknowledges support from PNRR MUR project PE0000023-NQSTI. KŻ acknowledges funding by the European Union under ERC 722 Advanced Grant TAtypic, Project No. 101142236. We acknowledge computational resources provided by the University of Bari and the INFN cluster ReCaS [64].

Appendix

A Computation of the variances

As shown in section 3, the variance of the purity distribution associated with Hadamard states and referred to a fixed bipartition is σA2 = ⟨π~A2⟩, where π~A is given in the second line of (3.1). Explicitly,

σA2 = 1 24n⟨(∑ k∈𝔹n ∑ l∈𝔹∗A ∑ m∈𝔹∗A¯sksk⊕l∗s k⊕l⊕msk⊕m∗)(∑ p∈𝔹n ∑ v∈𝔹∗A ∑ r∈𝔹∗A¯spsp⊕v∗s p⊕v⊕rsp⊕r∗)⟩, (A.1)

that is

σA2 = 1 24n ∑ k,p∈𝔹n ∑ l,v∈𝔹∗A ∑ m,r∈𝔹∗A¯⟨(sksk⊕l∗s k⊕l⊕msk⊕m∗)(s psp⊕v∗s p⊕v⊕rsp⊕r∗)⟩. (A.2)

For the Hadamard ensembles considered here, the variables sk are independent random phases, uniformly distributed on the regular polygon Pq, and |sk|2 = 1. Hence, the expectation value of any product of such phases is non-zero only if, for each index k ∈ 𝔹n, the number of occurrences of sk equals the number of occurrences of sk∗. Equivalently, the set of four indices carried by the unconjugated phase factors must coincide with the set of four indices carried by the conjugated phase factors.

In the present case, since l,m (and v,r) are non-zero and have support on complementary subsystems, no cancellation can occur within a single 4-phase factor. Therefore, the only non-vanishing contributions arise when the indices of the unconjugated phases in one factor are paired with the indices of the conjugated phases in the other one, and vice versa. This can happen in two ways, namely when k = p ⊕ v or when k = p ⊕ r, which then fixes the remaining indices.

Let us illustrate this with the case k = p ⊕ v. Then one unconjugated phase factor from the first parenthesis in (A.2) is paired with one conjugated phase factor from the second parenthesis. For the remaining phase factors to give a non-zero expectation value, their indices must also match, which imposes l ⊕m = v ⊕r. The remaining product is therefore sk⊕l∗sk⊕m∗sk⊕vsk⊕v⊕l⊕m. A non-vanishing contribution is obtained only when either l = v or m = v. However, since v ∈ 𝔹∗A, whereas m ∈ 𝔹∗A¯, the latter possibility is excluded. Thus the only admissible solution in this case is l = v, and consequently m = r. The case k = p ⊕ r is analogous.

Accordingly, the variance reads

σA2 = 1 24n ∑ k,p∈𝔹n ∑ l,v∈𝔹∗A ∑ m,r∈𝔹∗A¯(δk,p⊕v + δk,p⊕r)δl,vδm,r = 1 24n ∑ p∈𝔹n ∑ v∈𝔹∗A ∑ r∈𝔹∗A¯2 = 2(2nA − 1)(2nA¯ − 1) 23n . (A.3)

For hypergraph states (q = 2), whose coefficients are real, one has sk2 = sk∗2 = 1. As a result, additional non-zero contributions arise from direct pairings of the phases s across the two parentheses. This happens when k = p or k = p ⊕v ⊕r which, similarly to the previously discussed cases, fix all other indices. Together with the conditions originating from the pairing between phase factors s and conjugated phase factors s∗, these yield four distinct matching configurations, leading to the contribution

(δk,p⊕v + δk,p⊕r + δk,p + δk,p⊕v⊕r)δl,vδm,r. (A.4)

This effectively doubles the number of contributing configurations with respect to the other Hadamard ensembles.

As a result, the variance of the purity distribution for Hadamard Pq-states and referred to a fixed bipartition is given by

σA2 = 2c q(2nA − 1)(2nA¯ − 1) 23n , (A.5)

with

cq = (1 + δq,2), (A.6)

for all q ≥ 2, including Hadamard-typical states (q = ∞).

A similar analysis applies to the computation of the variance of the average purity distribution. As showed in section 4, this quantity is given by σME2 = ⟨(π~ME) 2⟩, which explicitly reads

σME2 = 1 24n ∑ k,p∈𝔹n ∑ l,m,v,r∈𝔹∗ng(l,m)g(q,r)⟨sksk⊕l∗s k⊕l⊕msk⊕m∗s psp⊕v∗s p⊕q⊕rsp⊕r∗⟩. (A.7)

As in the fixed bipartition case, the non-vanishing contributions to the variance arise from matching index configurations between the s-terms and their conjugates. However, in this case, the conditions k = p ⊕ v or k = p ⊕ r do not fully fix the remaining indices. For instance, if k = p ⊕ v, then the relevant term becomes sk⊕l∗sk⊕m∗sk⊕vsk⊕v⊕l⊕m, which contributes non-trivially when either l = v or m = v. Since l,m,v,r ∈ 𝔹∗n, both configurations are admissible, resulting in four valid matchings for all Pq-states with q ≥ 3. In contrast, for q = 2, non-vanishing contributions also arise from configurations in which the s-terms of both factors are directly matched. This leads to eight distinct non-vanishing terms, thereby doubling the number of contributing terms compared to the other ensembles.

Summarizing the above, we find that

σME2 = 4cq 23n ∑ l,m∈𝔹∗ng(l,m)2, (A.8)

with cq = (1 + δq,2). We get

f2∗(n) = 4∑ k,l∈𝔹∗ng(k,l)2 = 4∑ k,l∈𝔹∗nδk∧l,0ĝ(|k|,|l|)2 = ∑ 1≤s,t≤n4ĝ(s,t)2 ∑ k,l∈𝔹∗nδk∧l,0δ|k|,sδ|l|,t = ∑ 1≤s,t≤n4ĝ(s,t)2( n s,t) = ∑ s,t=1⌈n 2 ⌉( n s,t)−1 [(⌊n 2 ⌋ s)( ⌈n 2 ⌉ t) +( ⌊n 2 ⌋ t)( ⌈n 2 ⌉ s) ]2, (A.9)

where we used the straightforward identity

ĝ(s,t) = 1 2( n ⌊n 2 ⌋)−1 [(n −s −t ⌊n 2 ⌋−s) +( n −s −t ⌊n 2 ⌋−t) ] = 1 2( n s,t)−1 [(⌊n 2 ⌋ s)( ⌈n 2 ⌉ t) +( ⌊n 2 ⌋ t)( ⌈n 2 ⌉ s) ] (A.10)

on the function ĝ(s,t) defined in (2.8b). By plugging (A.9) into (A.8) we obtain the result (4.5)–(4.6) of the main text.

B Numerical simulations

A Haar-typical pure quantum state of n-qubits can be obtained by acting with a random unitary operator, sampled according to the Haar measure, on a generic reference state. In other words, a typical state corresponds to a single row (or column) of a unitary matrix sampled according to the Haar measure [42]. Based on this observation, we simulated typical states by generating full unitary matrices sampled from the Haar distribution using the algorithm presented in [65].

Hadamard states, in contrast, are characterized by a reduced number of parameters compared to Haar states, which makes their numerical simulation significantly simpler.

To simulate a Hadamard pure state of an n-qubits system, we constructed an ordered list of N = 2n phases (sk = eiϕk), uniformly sampled from the regular polygon defining the chosen class of Hadamard states, as reported in table 1. The vector of Fourier coefficient (z1,…,zN) was then obtained using eq. (2.19). This procedure is computationally less demanding than generating a random unitary matrix. We performed simulations for P2,P3,P4,P8-states and Hadamard-typical states.

For all mentioned ensembles of Hadamard states, as well ad for the Haar ensemble, we generated 2.3 ⋅ 106 states for system sizes ranging from n = 3 to n = 12 qubits. In addition, due to the reduced dimension of the states space, we were able to generate all possible hypergraph states with n = 3,4 and P3- and P4-states with n = 3.

For both Hadamard and Haar states, we first computed the purity referred to the bipartition A = {1,…,⌊n∕2⌋}. Then, we generated the list of all the possible balanced bipartitions, computed the purity for each case and evaluated the average purity as their arithmetic mean. Although the simulations of the purity referred to a fixed bipartition are specific to A = {1,…,⌊n∕2⌋}, the results are independent of this choice as the purity distributions are statistically independent of the specific bipartition [26].

All numerical simulations were performed on the RECAS computing cluster [64], utilizing up to 64 cores and 32 GB of memory per job.

C Asymptotic behavior of f2∗(n)

The summation in the expression (4.6) of f2∗ can be split as

4 (∑ l,m∈𝔹ng(l,m)2 − 2∑ l∈𝔹ng(l,0)2 + 1), (C.1)

where we have used the fact that g(0,0) = 1. Therefore, we have

f2∗(n) = f2(n) − 2h2(n) + 4, (C.2)

where f2(n) is defined in eq. (2.17) and

h2(n) = 4∑ l∈𝔹ng(l,0)2. (C.3)

This is the contribution with t = 0 of the sum in the second line of (2.17), namely,

h2(n) = ∑ s=0⌈n 2 ⌉(n s)−1 [(⌊n 2 ⌋ s) +( ⌈n 2 ⌉ s) ]2. (C.4)
PIC
Figure 4: Comparison between the terms appearing in the sums defining f2(n) in (C.13) and h2(n) in (C.14) versus the distance d (C.12) between pairs of bipartitions, in logarithmic scale. We set n = 100. The maxima of the terms of both sums, expressed as fractions of n, are highlighted.

We derive the asymptotic behavior of the function h2(n) defined in eq. (C.4). Let us consider the case of even n:

h2(n) = 4∑ 0≤s≤n 2 (n s)−1( n 2 s) 2. (C.5)

This summation depends on the ratio s∕n, which we can define as a new variable

x = s n. (C.6)

By Stirling approximation n! ∼ (n∕e)n2πn we obtain

h2(n) ∼ 4 2πn∑ 0≤s≤n 2 1 − x x 1 1 − 2xen[H(2x)−H(x)] ∼ 4 n 2π∫ 01 2 dx1 − x x 1 1 − 2xen[H(2x)−H(x)], (C.7)

where

H(x) = −xln⁡x − (1 −x)ln⁡(1 −x) (C.8)

is the Shannon entropy of x. It is easy to see that the exponent H(2x) −H(x) takes its maximum at x0 = (2 −2)∕4, and using the saddle point approximation we get

h2(n) ∼ 4 n 2π1 − x0 x0 1 1 − 2x0en[H(2x0)−H(x0)] ∫ 01∕2dxen 2 [4H″(2x0)−H″(x0)](x−x0)2 ∼ 4 n 2π(2 + 2)enlog⁡(1+2 2 ) ∫ ℝdxe−42nx2 = 21∕4(2 + 2) (1 + 2 2 )n = 21∕4(2 + 2)2γn, (C.9)

where

γ = log⁡2 (1 + 2 2 ) ≃ 0.27. (C.10)

For odd n, the asymptotic expression (C.9) acquires the additional factor (4 + 32)∕8.

Therefore, the function h2(n) is asymptotically negligible with respect to the asymptotic behavior (5.4) of f2(n), since α > 2γ. It follows that, for large n, f2∗(n) is asymptotically equivalent to f2(n), namely,

f2∗(n) ∼ 32 (3 2 )n = 322αn, (C.11)

as n → ∞.

In ref. [30], it was shown that the sum (2.17) defining f2(n) can be expressed in terms of the distance

d = |A ∩B¯| (C.12)

between two bipartitions (A,Ā) and (B,B¯), as

f2(n) = ( n ⌊n 2 ⌋)−1 ∑ d=0⌊n 2 ⌋(⌊n 2 ⌋ d)( ⌈n 2 ⌉ d) 2n 2 +1 [2n 2 −2d + 2−(n 2 −2d)] . (C.13)

The corresponding expression for h2(n) reads

h2(n) = ( n ⌊n 2 ⌋)−1 ∑ d=0⌊n 2 ⌋(⌊n 2 ⌋ d)( ⌈n 2 ⌉ d) [(2⌊n 2 ⌋ + 2⌈n 2 ⌉)2−d + 2d+1] . (C.14)

The comparison between the terms in the sums (C.13) and (C.14) is shown in figure 4 in the deep asymptotic regime, at n = 100, confirming the asymptotic dominance of f2 over h2.

Funding Statement. This paper has been funded by the following grants/awards. Ministero dell’Università e della Ricerca (MUR): CN00000013; Ministero dell’Università e della Ricerca (MUR): PE0000023-NQSTI; European Research Council (ERC): 101142236; University of Bari: 2023-UNBACLE-0244025; European Research Council (ERC): 722.

Data Availability Statement. The data that support the findings of this study are available from the corresponding author upon request.

Code Availability Statement. The code used in this study is available from the corresponding author upon request.

Open Access. This article is distributed under the terms of the Creative Commons Attribution License (CC-BY4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) and source are credited.

References

[1]
C.H. Bennett et al., Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels, Phys. Rev. Lett. 70 (1993) 1895 [INSPIRE].
[2]
D. Bouwmeester et al., Experimental quantum teleportation, Nature 390 (1997) 575 [arXiv:1901.11004] [INSPIRE].
[3]
D. Boschi et al., Experimental realization of teleporting an unknown pure quantum state via dual classical and Einstein-Podolski-Rosen channels, Phys. Rev. Lett. 80 (1998) 1121 [quant-ph/9710013] [INSPIRE].
[4]
M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press (2012) [DOI:10.1017/cbo9780511976667] [INSPIRE].
[5]
G. Alber et al., Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments, Springer Berlin Heidelberg (2001) [DOI:10.1007/3-540-44678-8].
[6]
C.H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Theor. Comput. Sci. 560 (2014) 7 [arXiv:2003.06557] [INSPIRE].
[7]
A.K. Ekert, Quantum cryptography based on Bell’s theorem, Phys. Rev. Lett. 67 (1991) 661 [INSPIRE].
[8]
D. Deutsch et al., Quantum privacy amplification and the security of quantum cryptography over noisy channels, Phys. Rev. Lett. 77 (1996) 2818 [quant-ph/9604039] [INSPIRE].
[9]
C.A. Fuchs et al., Optimal eavesdropping in quantum cryptography. I. Information bound and optimal strategy, Phys. Rev. A 56 (1997) 1163 [INSPIRE].
[10]
C.H. Bennett, D.P. DiVincenzo, J.A. Smolin and W.K. Wootters, Mixed state entanglement and quantum error correction, Phys. Rev. A 54 (1996) 3824 [quant-ph/9604024] [INSPIRE].
[11]
W.K. Wootters, Entanglement of formation of an arbitrary state of two qubits, Phys. Rev. Lett. 80 (1998) 2245 [quant-ph/9709029] [INSPIRE].
[12]
W.K. Wootters, Entanglement of formation and concurrence, Quant. Inf. Comput. 1 (2001) 27 [INSPIRE].
[13]
D. Bruss, Characterizing entanglement, J. Math. Phys. 43 (2002) 4237 [quant-ph/0110078] [INSPIRE].
[14]
L. Amico, R. Fazio, A. Osterloh and V. Vedral, Entanglement in many-body systems, Rev. Mod. Phys. 80 (2008) 517 [quant-ph/0703044] [INSPIRE].
[15]
R. Horodecki, P. Horodecki, M. Horodecki and K. Horodecki, Quantum entanglement, Rev. Mod. Phys. 81 (2009) 865 [quant-ph/0702225] [INSPIRE].
[16]
V. Coffman, J. Kundu and W.K. Wootters, Distributed entanglement, Phys. Rev. A 61 (2000) 052306 [quant-ph/9907047] [INSPIRE].
[17]
A. Wong and N. Christensen, Potential multiparticle entanglement measure, Phys. Rev. A 63 (2001) 044301 [quant-ph/0010052] [INSPIRE].
[18]
D.A. Meyer and N.R. Wallach, Global entanglement in multiparticle systems, J. Math. Phys. 43 (2002) 4273 [quant-ph/0108104] [INSPIRE].
[19]
M. Jakob and J.A. Bergou, Complementarity and entanglement in bipartite qudit systems, Phys. Rev. A 76 (2007) 052107 [INSPIRE].
[20]
E. Rains, Quantum shadow enumerators, IEEE Trans. Info. Theor. 45 (1999) 2361 [quant-ph/9611001] [INSPIRE].
[21]
A. Higuchi and A. Sudbery, How entangled can two couples get?, Phys. Lett. A 273 (2000) 213 [quant-ph/0005013] [INSPIRE].
[22]
A.J. Scott, Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions, Phys. Rev. A 69 (2004) 052330 [quant-ph/0310137] [INSPIRE].
[23]
F. Huber, O. Gühne and J. Siewert, Absolutely Maximally Entangled States of Seven Qubits Do Not Exist, Phys. Rev. Lett. 118 (2017) 200502 [arXiv:1608.06228] [INSPIRE].
[24]
P. Facchi et al., Multipartite Entanglement and Frustration, New J. Phys. 12 (2010) 025015 [arXiv:0910.3134] [INSPIRE].
[25]
P. Facchi, G. Florio, G. Parisi and S. Pascazio, Maximally multipartite entangled states, Phys. Rev. A 77 (2008) 060304 [arXiv:0710.2868] [INSPIRE].
[26]
P. Facchi, G. Florio and S. Pascazio, Probability density function characterization of multipartite entanglement, Phys. Rev. A 74 (2006) 042331 [quant-ph/0603281] [INSPIRE].
[27]
O. Giraud, Distribution of bipartite entanglement for random pure states, quant-ph/0611285 [DOI:10.1088/1751-8113/40/11/014] [INSPIRE].
[28]
P. Facchi et al., Statistical mechanics of multipartite entanglement, J. Phys. A 42 (2009) 055304 [arXiv:0803.4498] [INSPIRE].
[29]
P. Facchi, Multipartite entanglement in qubit systems, arXiv:0811.0702 [DOI:10.4171/RLM/532] [INSPIRE].
[30]
P. Facchi et al., Classical Statistical Mechanics Approach to Multipartite Entanglement, J. Phys. A 43 (2010) 225303 [arXiv:1002.2592] [INSPIRE].
[31]
A.T. Butson, Generalized Hadamard matrices, Proc. Am. Math. Soc. 13 (1962) 894.
[32]
W. Tadej and K. Zyczkowski, A Concise Guide to Complex Hadamard Matrices, Open Syst. Info. Dyn. 13 (2006) 133 [quant-ph/0512154] [INSPIRE].
[33]
M. Rossi, M. Huber, D. Bruß and C. Macchiavello, Quantum hypergraph states, New J. Phys. 15 (2013) 113022 [arXiv:1211.5554] [INSPIRE].
[34]
C. Kruszynska and B. Kraus, Local entanglability and multipartite entanglement, Phys. Rev. A 79 (2009) 052304 [arXiv:0808.3862] [INSPIRE].
[35]
M. Rossi, D. Bruß and C. Macchiavello, Hypergraph states in Grover’s quantum search algorithm, Phys. Scripta T 160 (2014) 014036 [arXiv:1404.1285] [INSPIRE].
[36]
C.E. Mora, H.J. Briegel and B. Kraus, Quantum Kolmogorov Complexity and its Applications, Int. J. Quant. Inf. 05 (2007) 729 [quant-ph/0610109] [INSPIRE].
[37]
D. Goyeneche et al., Absolutely maximally entangled states, combinatorial designs, and multiunitary matrices, Phys. Rev. A 92 (2015) 032316 [arXiv:1506.08857] [INSPIRE].
[38]
D. Goyeneche, Z. Raissi, S.D. Martino and K. Życzkowski, Entanglement and quantum combinatorial designs, Phys. Rev. A 97 (2018) 062326 [arXiv:1708.05946] [INSPIRE].
[39]
J. Paczos et al., Genuinely quantum SudoQ and its cardinality, Phys. Rev. A 104 (2021) 042423 [arXiv:2106.02967] [INSPIRE].
[40]
S.A. Rather et al., Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem, Phys. Rev. Lett. 128 (2022) 080507 [arXiv:2104.05122] [INSPIRE].
[41]
K. Życzkowski et al., 9 × 4 = 6 × 6: Understanding the Quantum Solution to Euler’s Problem of 36 Officers, J. Phys. Conf. Ser. 2448 (2023) 012003 [arXiv:2204.06800] [INSPIRE].
[42]
K. Zyczkowski and H.-J. Sommers, Induced measures in the space of mixed quantum states, J. Phys. A 34 (2001) 7111 [quant-ph/0012101] [INSPIRE].
[43]
E. Lubkin, Entropy of an n-system from its correlation with a k-reservoir, J. Math. Phys. 19 (1978) 1028 [INSPIRE].
[44]
S. Lloyd and H. Pagels, Complexity as thermodynamic depth, Annals Phys. 188 (1988) 186 [INSPIRE].
[45]
D.N. Page, Average entropy of a subsystem, Phys. Rev. Lett. 71 (1993) 1291 [gr-qc/9305007] [INSPIRE].
[46]
A.J. Scott and C.M. Caves, Entangling power of the quantum baker’s map, J. Phys. A 36 (2003) 9553 [quant-ph/0305046] [INSPIRE].
[47]
P. Facchi, G. Florio and S. Pascazio, Characterizing and Measuring Multipartite Entanglement, Int. J. Quant. Inf. 05 (2007) 97 [quant-ph/0610108] [INSPIRE].
[48]
G. Cenedese, M. Bondani, D. Rosa and G. Benenti, Generation of Pseudo-Random Quantum States on Actual Quantum Processors, Entropy 25 (2023) 607 [arXiv:2302.04101] [INSPIRE].
[49]
J. Choi et al., Preparing random states and benchmarking with many-body quantum chaos, Nature 613 (2023) 468 [arXiv:2103.03535] [INSPIRE].
[50]
J.S. Cotler et al., Emergent Quantum State Designs from Individual Many-Body Wave Functions, PRX Quantum 4 (2023) 010311 [arXiv:2103.03536] [INSPIRE].
[51]
J.-N. Yang et al., Probing Entanglement and Symmetries in Random States Using a Superconducting Quantum Processor, arXiv:2601.22224 [INSPIRE].
[52]
I. Bengtsson and K. Życzkowski, Geometry of Quantum States: An Introduction to Quantum Entanglement, Cambridge University Press (2017) [DOI:10.1017/9781139207010].
[53]
J. Huang et al., Demonstration of hypergraph-state quantum information processing, Nature Commun. 15 (2024) 2601 [INSPIRE].
[54]
Y. Zhou and A. Hamma, Entanglement of random hypergraph states, Phys. Rev. A 106 (2022) 012410 [arXiv:2110.07158] [INSPIRE].
[55]
D. Bruß and C. Macchiavello, Multipartite entanglement in quantum algorithms, Phys. Rev. A 83 (2011) 052313 [arXiv:1007.4179] [INSPIRE].
[56]
Y. Liu, W.-J. Li, X. Zhang, M. Lewenstein, G. Su and S.-J. Ran, Entanglement-based feature extraction by tensor network machine learning, Front. Appl. Math. Stat. 7 (2021) 716044 [arXiv:1803.09111] [INSPIRE].
[57]
G.C. Santra, S.S. Roy, D.J. Egger and P. Hauke, Genuine multipartite entanglement in quantum optimization, Phys. Rev. A 111 (2025) 022434 [arXiv:2411.08119] [INSPIRE].
[58]
X. Yuan et al., Quantum Simulation with Hybrid Tensor Networks, Phys. Rev. Lett. 127 (2021) 040501 [arXiv:2007.00958] [INSPIRE].
[59]
J. Schuhmacher et al., Hybrid Tree Tensor Networks for Quantum Simulation, PRX Quantum 6 (2025) 010320 [arXiv:2404.05784] [INSPIRE].
[60]
X.-D. Cai et al., Entanglement-Based Machine Learning on a Quantum Computer, Phys. Rev. Lett. 114 (2015) 110504 [arXiv:1409.7770] [INSPIRE].
[61]
F. El Ayachi and M. El Baz, Enhancing quantum support vector machines using multipartite entanglement, Phys. Lett. A 551 (2025) 130666 [INSPIRE].
[62]
Z. Raissi, C. Gogolin, A. Riera and A. Acín, Optimal quantum error correcting codes from absolutely maximally entangled states, J. Phys. A 51 (2018) 075301 [arXiv:1701.03359] [INSPIRE].
[63]
P. Mazurek et al., Quantum error correction codes and absolutely maximally entangled states, Phys. Rev. A 101 (2020) 042305 [arXiv:1910.07427] [INSPIRE].
[64]
ReCaS-Bari, Il data center ReCaS-Bari, https://www.recas-bari.it/.
[65]
F. Mezzadri, How to generate random matrices from the classical compact groups, Electron. Res. Announ. AMS 54 (2007) 592 [math-ph/0609050] [INSPIRE].