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+21log23 bits, with equality exactly on the local-unitary orbits of their state
M4 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… 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
M4 to cluster states at
q∗≈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.
We propose an alternative evaluation of quantum entanglement by measuring the maximum violation of the Bell’s inequality without information of the reduced density matrix of a system. This proposal is demonstrated by bridging the maximum violation of the Bell’s inequality and a concurrence of a pure state in an n-qubit system, in which one subsystem only contains one qubit and the state is a linear combination of two product states. We apply this relation to the ground states of four qubits in the Wen-Plaquette model and show that they are maximally entangled. A topological entanglement entropy of the Wen-Plaquette model could be obtained by relating the upper bound of the maximum violation of the Bell’s inequality to the generalized concurrence of a pure state with respect to different bipartitions.
A pure multipartite quantum state is called absolutely maximally entangled if all reductions of no more than half of the parties are maximally mixed. However, an
n-qubit absolutely maximally entangled state exists only when
n equals 2, 3, 5, and 6. A natural question arises when it does not exist: Which
n-qubit pure state has the largest number of maximally mixed $\ensuremath{\lfloor}n/2\ensuremath{\rfloor}$-party reductions? We denote this number by
Qex(n). It was shown that
Qex(4)=4 by Higuchi and Sudbery [Phys. Lett. A 273, 213 (2000)] and
Qex(7)=32 by Huber et al. [Phys. Rev. Lett. 118, 200502 (2017)]. In this paper, we give a general upper bound of
Qex(n) by linking the well-known Tur\'an problem in graph theory and provide lower bounds using constructive and probabilistic methods. In particular, we show that
Qex(8)=56, which is the third known value for this problem.