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

The most entangled states of four and seven qubits

Antony Lewis

Published Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

Pure states of four and seven qubits cannot be maximally entangled across every balanced bipartition; we determine how entangled they can be on average. For four qubits we prove the conjecture of Higuchi and Sudbery: the mean von Neumann entropy of the three $2|2$ cuts is at most $1+\tfrac12\log_2 3$ bits, with equality exactly on the local-unitary orbits of their state $M_4$ and its complex conjugate. For seven qubits the mean purity of the 35 balanced $3|4$ cuts is at least $121/917$ and their mean entropy is at most $2.965356029\ldots$ bits, each with a unique optimiser up to local unitaries and qubit permutations. The two optimisers are distinct members of one icosahedral family, so minimum purity and maximum entropy select different states. The proofs bound moments of the marginal spectra by positive identities on several copies of the state, some of them spin flipped, and bound the entropy by a polynomial in those moments. The four-qubit maximum has an analytic proof; the seven-qubit proofs, and some of the four-qubit refinements below, are computer-assisted, with exact arithmetic and rigorous error bounds. We also prove the Gour--Wallach conjecture for Rényi entropies of all orders, with the maximiser changing from $M_4$ to cluster states at $q_*\approx1.588$, and obtain sharp Tsallis bounds, mixed-state bounds and quantitative stability.

DOI
10.48550/arxiv.2611.05757

Related papers

All maximally entangled four-qubit states

Gilad Gour, Nolan R. Wallach

We find an operational interpretation for the 4-tangle as a type of residual entanglement, somewhat similar to the interpretation of the 3-tangle. Using this remarkable interpretation, we are able to find the class of maximally entangled four-qubits states which is characterized by four real parameters. The states in the class are maximally entangled in the sense that their average bipartite entanglement with respect to all possible bipartite cuts is maximal. We show that while all the states in the class maximize the average tangle, there are only a few states in the class that maximize the average Tsillas or Renyi α-entropy of entanglement. Quite remarkably, we find that up to local unitaries, there exists two unique states, one maximizing the average α-Tsallis entropy of entanglement for all α ⩾ 2, while the other maximizing it for all 0 < α ⩽ 2 (including the von-Neumann case of α = 1). Furthermore, among the maximally entangled four qubits states, there are only three maximally entangled states that have the property that for two, out of the three bipartite cuts consisting of two-qubits verses two-qubits, the entanglement is 2 ebits and for the remaining bipartite cut the entanglement between the two groups of two qubits is 1 ebit. The unique three maximally entangled states are the three cluster states that are related by a swap operator. We also show that the cluster states are the only states (up to local unitaries) that maximize the average α-Renyi entropy of entanglement for all α ⩾ 2.

arXiv:1006.0036•Journal of Mathematical Physics•Nov 1, 2010•149 citations

A maximally entangled seven-qubit state

Xin-Wei Zha, Haiyang Song, Jianxia Qi +2 more

A highly entangled seven-qubit state is reported that sheds some new light on a recent conjecture by Borras et al (2007 J. Phys. A: Math. Theor. 40 13407). The seven-qubit state given in this paper has 32 balanced purities equal to 1/8 and the remaining three purities equal to 1/4, whose marginal density matrices for subsystems of one and two qubits are all completely mixed.

arXiv:1110.5011•Journal of Physics A Mathematical and Theoretical•May 29, 2012•30 citations

On maximal entanglement between two pairs in four-qubit pure states

Shirley Brierley, Atsushi Higuchi

We show that the state with the highest known average two-particle von Neumann entanglement entropy proposed by Sudbery and one of the authors gives a local maximum of this entropy. We also show that this is not the case for an alternative highly entangled state proposed by Brown et al .

arXiv:0704.2961•Journal of Physics A Mathematical and Theoretical•Jul 3, 2007•51 citations

Construct maximally seven-qubit entangled state via Brown state

Yazhou Yue, Erdun Minze, Yuanzheng Liu +1 more

It is worth studying recurrence relation of multi-qubit states due to its benefits to the criterion and measurement of quantum entanglement. Recently, Huang et al. presented an expand recurrence relation of multi-qubit state. Using this expand recurrence relation and Brown state, we construct a new seven-qubit maximally entangled states of 32 and 3 balanced purities equal to 1/8 and 1/4, whose averaged subsystem purity is equal to 19/140. We found that the marginal density matrices for subsystems of 1 and 2 qubits all completely mixed in these states.

International Journal of Modern Physics B•Sep 22, 2022•1 citation

The Failure of Simultaneous Quantum Typicality

Benoit Collins

We establish exact thresholds for the failure of simultaneous quantum typicality: three parties for mixed states and four for pure states. For the four-qubit Higuchi--Sudbery state, every sequence satisfying the expected purity bounds on three overlapping marginals, with sufficiently small fixed positive entropy slack, is asymptotically perfectly distinguishable from the tensor powers of the input: its trace distance from them tends to the maximum value $2$. This maximal separation persists, with a common positive slack, throughout an open neighborhood in the full four-qubit state space. Tracing out one party yields a mixed tripartite example. The proof connects simultaneous quantum smoothing with polynomial concentration on $\CP^1$. Symmetry reduces the problem to a frame inequality on $\Sym^n(\mathbb C^2)$, where a linear entropy deficit competes with a quadratic cost of polynomial concentration. Bernstein--Markov estimates and a subharmonic barrier control this cost, yielding an exponential obstruction to simultaneous typicality. These results disprove Dutil's multiparty quantum typicality conjecture, formulated in 2011, and the one-shot simultaneous min-entropy-smoothing conjectures of Drescher--Fawzi and Colomer--Winter. Together with the positive results for smaller systems, they determine the smallest numbers of parties at which simultaneous typicality can fail.

quant-pharXiv:2609.25726•Sep 23, 2026•0 citations

Exact entanglement trade-offs in qutrit and composite-dimensional stabilizer states

Zakaria Dahbi

When absolute maximal entanglement is unavailable in a state family, different objectives can select different distributions of residual entanglement. We determine exact trade-offs for qutrit stabilizer states and binary--ternary product states. For eight qutrits, evaluation of the complete published classification gives three nondominated balanced-cut entanglement profiles, characterized by the probabilities of obtaining three or four maximally entangled qutrit pairs. We relate the squared entropy-deficit objective to code weight enumerators and use a uniformity-forcing bound to prove that its eleven-qutrit minimum is six. The unique minimizing Clifford class is an already classified code, whose entropy profile also attains a sharp bound on average reference--erasure mutual information among four-uniform eleven-qutrit stabilizer states. In local dimension six, explicit sector alignments attain 56 maximally mixed four-party reductions, the maximum for arbitrary binary--ternary product states. Within the stabilizer product family, the exact cost--count Pareto boundary consists of $(44,48)$ and $(48,56)$. These results identify when aggregate optimization determines operational entanglement properties and when it does not. Published classifications supply coverage; analytical bounds, explicit witnesses, and independent arithmetic checks establish the stated consequences.

quant-pharXiv:2605.05167•May 7, 2026•0 citations
Pure states of four and seven qubits cannot be maximally entangled across every balanced bipartition; we determine how entangled they can be on average. For four qubits we prove the conjecture of Higuchi and Sudbery: the mean von Neumann entropy of the three 2∣22|22∣2 cuts is at most 1+12log⁡231+\tfrac12\log_2 31+21​log2​3 bits, with equality exactly on the local-unitary orbits of their state M4M_4M4​ and its complex conjugate. For seven qubits the mean purity of the 35 balanced 3∣43|43∣4 cuts is at least 121/917121/917121/917 and their mean entropy is at most 2.965356029…2.965356029\ldots2.965356029… bits, each with a unique optimiser up to local unitaries and qubit permutations. The two optimisers are distinct members of one icosahedral family, so minimum purity and maximum entropy select different states. The proofs bound moments of the marginal spectra by positive identities on several copies of the state, some of them spin flipped, and bound the entropy by a polynomial in those moments. The four-qubit maximum has an analytic proof; the seven-qubit proofs, and some of the four-qubit refinements below, are computer-assisted, with exact arithmetic and rigorous error bounds. We also prove the Gour--Wallach conjecture for Rényi entropies of all orders, with the maximiser changing from M4M_4M4​ to cluster states at q∗≈1.588q_*\approx1.588q∗​≈1.588, and obtain sharp Tsallis bounds, mixed-state bounds and quantitative stability.
We find an operational interpretation for the 4-tangle as a type of residual entanglement, somewhat similar to the interpretation of the 3-tangle. Using this remarkable interpretation, we are able to find the class of maximally entangled four-qubits states which is characterized by four real parameters. The states in the class are maximally entangled in the sense that their average bipartite entanglement with respect to all possible bipartite cuts is maximal. We show that while all the states in the class maximize the average tangle, there are only a few states in the class that maximize the average Tsillas or Renyi α-entropy of entanglement. Quite remarkably, we find that up to local unitaries, there exists two unique states, one maximizing the average α-Tsallis entropy of entanglement for all α ⩾ 2, while the other maximizing it for all 0 < α ⩽ 2 (including the von-Neumann case of α = 1). Furthermore, among the maximally entangled four qubits states, there are only three maximally entangled states that have the property that for two, out of the three bipartite cuts consisting of two-qubits verses two-qubits, the entanglement is 2 ebits and for the remaining bipartite cut the entanglement between the two groups of two qubits is 1 ebit. The unique three maximally entangled states are the three cluster states that are related by a swap operator. We also show that the cluster states are the only states (up to local unitaries) that maximize the average α-Renyi entropy of entanglement for all α ⩾ 2.
It is worth studying recurrence relation of multi-qubit states due to its benefits to the criterion and measurement of quantum entanglement. Recently, Huang et al. presented an expand recurrence relation of multi-qubit state. Using this expand recurrence relation and Brown state, we construct a new seven-qubit maximally entangled states of 32 and 3 balanced purities equal to 1/8 and 1/4, whose averaged subsystem purity is equal to 19/140. We found that the marginal density matrices for subsystems of 1 and 2 qubits all completely mixed in these states.
We establish exact thresholds for the failure of simultaneous quantum typicality: three parties for mixed states and four for pure states. For the four-qubit Higuchi--Sudbery state, every sequence satisfying the expected purity bounds on three overlapping marginals, with sufficiently small fixed positive entropy slack, is asymptotically perfectly distinguishable from the tensor powers of the input: its trace distance from them tends to the maximum value 222. This maximal separation persists, with a common positive slack, throughout an open neighborhood in the full four-qubit state space. Tracing out one party yields a mixed tripartite example. The proof connects simultaneous quantum smoothing with polynomial concentration on $\CP^1$. Symmetry reduces the problem to a frame inequality on $\Sym^n(\mathbb C^2)$, where a linear entropy deficit competes with a quadratic cost of polynomial concentration. Bernstein--Markov estimates and a subharmonic barrier control this cost, yielding an exponential obstruction to simultaneous typicality. These results disprove Dutil's multiparty quantum typicality conjecture, formulated in 2011, and the one-shot simultaneous min-entropy-smoothing conjectures of Drescher--Fawzi and Colomer--Winter. Together with the positive results for smaller systems, they determine the smallest numbers of parties at which simultaneous typicality can fail.
When absolute maximal entanglement is unavailable in a state family, different objectives can select different distributions of residual entanglement. We determine exact trade-offs for qutrit stabilizer states and binary--ternary product states. For eight qutrits, evaluation of the complete published classification gives three nondominated balanced-cut entanglement profiles, characterized by the probabilities of obtaining three or four maximally entangled qutrit pairs. We relate the squared entropy-deficit objective to code weight enumerators and use a uniformity-forcing bound to prove that its eleven-qutrit minimum is six. The unique minimizing Clifford class is an already classified code, whose entropy profile also attains a sharp bound on average reference--erasure mutual information among four-uniform eleven-qutrit stabilizer states. In local dimension six, explicit sector alignments attain 56 maximally mixed four-party reductions, the maximum for arbitrary binary--ternary product states. Within the stabilizer product family, the exact cost--count Pareto boundary consists of (44,48)(44,48)(44,48) and (48,56)(48,56)(48,56). These results identify when aggregate optimization determines operational entanglement properties and when it does not. Published classifications supply coverage; analytical bounds, explicit witnesses, and independent arithmetic checks establish the stated consequences.