Entanglement Polytopes: Multiparticle Entanglement from Single-Particle Information
Michael Walter, Brent Doran, David Gross, Matthias Christandl
References
Supplementary Text
In this supplement, we will give rigorous proofs of the main properties of entanglement polytopes (subsection .3) and describe an algorithmic method for their computation, which we illustrate with several worked examples (subsection .5). Moreover, we elaborate on the properties of the linear entropy of entanglement and derive the gradient flow procedure for entanglement distillation that has been sketched in the main body of the article (subsection .4). Our main technical tools are Brion’s invariant-theoretic description of moment polytopes (15) seen through the lens of non-reductive group actions (17), and Kirwan’s analysis of the equivariant Morse gradient flow for the norm square of a moment map (27).
For clarity of exposition, we will describe our results for a system composed of distinguishable subsystems with degrees of freedom, respectively, and Hilbert space
In the context of multi-particle entanglement, we will think of each of the subsystems as corresponding to an individual particle. However, the subsystems can be of more general nature and, e.g., describe different degrees of freedom such as position and spin. All results can be adapted to systems composed of bosons or fermions by replacing with the (anti)symmetric subspace (subsection .5). We shall denote by
the projective space of pure states; the expectation value of an observable in a pure state is given by . The effective state of the -th particle is described by the (one-body) reduced density matrix , which by definition reproduces the expectation values of all one-body observables ,
The one-body reduced density matrices are in general mixed states, i.e., convex mixtures of pure states. Formally, they are positive semidefinite Hermitian operators of trace one. By the spectral theorem, each can be diagonalized, and the local eigenvalues are vectors of non-negative numbers summing to one (which we assume by convention to be weakly decreasing).
.2 Multi-Particle Entanglement and Stochastic Local Operations and Classical Communication (SLOCC)
A pure quantum state of a multi-particle system is called entangled if it cannot be written as a tensor product (28)
It is easy to see that is unentangled, or separable, if and only if all its one-body reduced density matrices are pure states, that is, if and only if for .
In order to classify the entanglement present in a given multipartite quantum state , it is useful to compare its capability for quantum information processing tasks with that of other quantum states. Specifically, we shall think of to be at least as entangled as any other quantum state that can be produced from a single copy of by performing a sequence of stochastic local operations (i.e., local operations which succeed with some positive probability, e.g., by post-selecting on a certain measurement outcome) and classical communication (SLOCC) (5, 6). If, conversely, can also be produced from then we can think of the two states as possessing the same kind of multi-particle entanglement. In this way the set of quantum states is partitioned into equivalence classes. For pure states and , it has been shown that they are equivalent under SLOCC if and only if there exist invertible operators such that
Indeed, the operators can be defined by following a successful branch of a conversion protocol. Conversely, given operators it suffices to perform successive local POVM measurements with Kraus operators
where . Then the result of (6) states that two pure states and are equivalent under SLOCC if and only if . In other words, the SLOCC entanglement class containing is just the orbit . Clearly, the unentangled states form a single SLOCC class.
The closure of an entanglement class contains in addition those quantum states which can be arbitrarily well approximated by a state in the class. In this way, the closure of an entanglement class can be given a similar operational interpretation as the class itself. While the entanglement classes partition the set of multi-particle quantum states, their closures naturally form a hierarchy. This is because they are stable under SLOCC operations; indeed, it is immediate that implies . In particular, every entanglement class contains in its closure the class of unentangled states.
In summary, stochastic local operations and classical communication provide a systematic way of studying multi-particle entanglement. However, it is immediate from the fact that the dimension of grows only linearly with that there is generically an infinite number of distinct SLOCC entanglement classes labeled by an exponential number of continuous parameters (cf. subsection .5). It is therefore necessary to coarsen the classification in a systematic way in order to arrive at a tractable way of witnessing multi-particle entanglement.
We note that an extraordinary amount of research has been devoted to the task of classifying SLOCC entanglement and identifying it experimentally. The field is far too large to allow for an exhaustive bibliography. For reviews on the general theory, see (4, 29); a review focussing on detection is (30). Methods from algebraic geometry and classical invariant theory have long been used to analyze entanglement classes, see, e.g., (8, 31, 32, 33, 34, 35, 18, 36, 37, 38, 39, 40, 41, 42, 43, 44) and references therein.
.3 Entanglement Polytopes
The entanglement polytope of an entanglement class is by definition
the set of tuples of local eigenvalues of the quantum states in the closure of the entanglement class. We will show below that this set is in fact a convex polytope. The set of entanglement polytopes forms a hierarchy which coarsens the hierarchy of the closures of entanglement classes described above. Namely,
In particular, if a pure quantum state is contained in an entanglement class then its collection of local eigenvalues is contained in the corresponding entanglement polytope . That is,
Equivalently, if the collection of local eigenvalues is not contained in the entanglement polytope then the quantum state is necessarily in a different entanglement class:
This establishes our main criterion for witnessing multi-particle entanglement.
.3.2 Invariant-Theoretic Description
In order to analyze the properties of entanglement polytopes, it is useful to introduce the map
which assigns to a quantum state the collection of its one-body reduced density matrices. Given a product of local unitaries , it follows from (S1) that
We can therefore jointly diagonalize the reduced density matrices by applying suitable local unitaries. On the other hand, we observe that the action is simply the restriction of (S3) to the subgroup of local unitaries of the group introduced in subsection .2 (the denominator is equal to unity since any unitary is norm-preserving), so that the entanglement class is left unchanged. We conclude that for every quantum state there exists a quantum state in the same entanglement class whose reduced density matrices are diagonal in the computational basis. As we may identify diagonal density matrices with their collection of eigenvalues (for definiteness, we shall require the diagonal entries to be arranged in weakly decreasing order), each entanglement polytope can be written as an intersection
where we denote by the set of tuples of diagonal density matrices with weakly decreasing entries.
where and are Hermitian operators on and where \widehat{Z}_{\rho}=\left.\frac{d}{dt}\vphantom{\big{|}}\right|_{t=0}e^{tZ}\cdot\rho=\left.\frac{d}{dt}\vphantom{\big{|}}\right|_{t=0}e^{tZ}\lvert\psi\rangle\langle\psi\rvert e^{tZ^{\dagger}}/\,\lVert e^{tZ}\ket{\psi}\rVert_{2}^{2} is the tangent vector generated by the infinitesimal action of an arbitrary operator ; in particular, and . Formally, the above equation should be restricted to local observables of trace zero, since only these correspond to elements in the Lie algebra of the group .
The entanglement polytope of an entanglement class is equal to
By the above discussion and (S6), we have seen that is equal to the moment polytope of the -orbit closure . In (15) it is shown that this moment polytope can be described as the closure of the set of points for which there exists a non-zero -equivariant morphism
which is homogeneous of degree (i.e., whose components are homogeneous polynomial functions of degree ). Here, we denote by the affine cone over . Evidently, every covariant which is non-zero at restricts to a map on which does not vanish completely; this shows one inclusion. For the converse, we first observe that every non-zero map as above is automatically non-zero at , for it is -equivariant and the affine cone over is an open subset of . It remains to show that it can be extended to a -equivariant map on all of . This can be seen as follows by using some basic algebraic geometry and representation theory (48, 49):
Since the map is -equivariant and its range an irreducible representation, it is completely equivalent to consider instead of its component evaluated at a highest weight vector with respect to some maximal unipotent subgroup . The function is a -invariant homogeneous polynomial function of degree , i.e., a -invariant element of the degree- piece of the homogeneous coordinate ring
is a -isomorphism, and it can be used to find a -invariant extension of to all of . By reversing the above procedure, we obtain a corresponding covariant which -equivariantly extends to all of . ∎
.3.3 Properties and Computation
The set of covariants of fixed degree and weight form a vector space. Moreover, given any two covariants , of degree , and weights , , we can form their product by defining
where denotes the projection onto the unique irreducible representation in the tensor product of two irreducible representations whose highest weight is the sum of the highest weights of the factors. The function is a covariant of degree and weights . Note that the point corresponding to ,
The entanglement polytope of an entanglement class is given by the convex hull
where we denote by the degree and by the weights of a generator (). In particular, is a compact convex polytope.
Consider a monomial which does not vanish on . Its degree is and its weights are given by . Since necessarily for all , the corresponding point
is contained in the convex hull displayed in the statement of the corollary.
If is an arbitrary covariant of degree and weights which does not vanish on , we can write it as a linear combination of monomials. If the linear combination is chosen minimally then every monomial has the same degree and weights as . Since at least one of the monomials must not vanish on , the claim follows from what we have proved above. ∎
By virtue of Theorem 2, the computation of entanglement polytopes is a finite problem that can be completely algorithmized. Indeed, by using the relation (52, §4.2) (cf. (17))
the problem of computing a set of generating covariants is transformed into a problem of computing invariants for a complex reductive group, for which there exist algorithms in computational invariant theory (16). Once a set of generators has been found, Theorem 2 can be used to compute the entanglement polytope both for specific states as well as for families of states. We use this method to compute all examples in subsection .5.
Finite generation also implies other desirable properties. It is clear that there are only finitely many entanglement polytopes, since by Theorem 2 any entanglement polytopes is the convex hull of some subset of the finite set of points
Moreover, as similarly observed in (15), the set of quantum states for which all generators are non-zero,
is a finite intersection of Zariski-open sets, hence itself Zariski-open. It follows that the entanglement polytope of a generic quantum state is maximal, i.e., equal to the convex hull of the finite set .
Let us briefly digress to discuss this generic entanglement polytope, which we shall denote by . Clearly,
the set of possible local eigenvalues of an arbitrary pure quantum state (not restricted to any particular entanglement class). The problem of computing this polytope is known as the one-body quantum marginal problem in quantum information theory and as the one-body -representability problem in quantum chemistry (12). Its convexity has been noted in (9, 11, 10), and it has been solved by combining the invariant-theoretic characterization of with some Schubert calculus and geometric invariant theory (10, 11, 13); see also (53) for a different approach relying solely on symplectic geometry. In the case of qubits, a complete solution has been obtained in (54). More generally, the way in which properties of the global state manifest in local correlations has also been studied in the literature (55, 56).
.3.4 Experimental Noise
A quantum state prepared in the laboratory will always be a mixed state and it is a priori unclear what statements can be inferred about its entanglement from its local eigenvalues. Here, we give two slightly different ways for leveraging the results discussed for pure states to the more realistic scenario of small noise.
For both approaches, we will assume that a lower bound on the purity is available. One natural way of obtaining such an estimate is the well-known swap test (22) which directly estimates using two-particle measurements on two copies of . We sketch an alternative procedure which may be simpler to implement in some platforms. It is rigorous up to an assumption on the prevailing noise mechanism: namely that it does not increase purity. This does hold, e.g., for dephasing and depolarizing noise—two models applicable to the majority of experiments. Now suppose that has been prepared by acting on an initial product state with a quantum operation approximating an entangling unitary gate (e.g., a spin squeezing operation). Let be a channel approximating , and . Under said assumption, we have that , i.e., the purity has decreased under the noisy “disentangling operation” . But is still approximately a product, so that the lower bound (57)
for the global purity in terms of the local eigenvalue spectra is likely not to be too lose (it is tight for product states). The following bounds will produce non-vacuous results only if the purity exceeds , which will from now on be assumed.
The first way of dealing with noise is to realize that there is a pure state with fidelity whose vector of local eigenvalues differs from the vector of local eigenvalues of by at most .
To see this, expand the mixed state in its eigenbasis with eigenvalues ordered non-increasingly, . Our assumption on the purity implies immediately that the maximal eigenvalue is also lower-bounded by ,
On the other hand, using that for all , we find that
We solve the quadratic relation and obtain two possible solutions,
Only the right-hand side solution is compatible with . From now on we will employ the convention that , when applied to matrices, denotes the (Schatten) -norm (in particular: is the trace norm). Set . Then clearly, by (S10). On the other hand, by using a version of Weyl’s perturbation theorem for the -norm (28, (11.46)), the vector of local eigenvalues only changes by
For the case of qubits, a further improvement can be made. Here, we are only concerned with the largest eigenvalue in each system. Due to normalization , every deviation in the maximum eigenvalue has to be accompanied by a deviation of equal magnitude of the minimum eigenvalue. Thus, the 1-norm difference of the maximum eigenvalues is exactly half the quantity estimated above:
For small noise, , the right-hand side is given by to first order in
We now illustrate this approach with a numerical example. Suppose that is an experimentally prepared quantum state of four qubits with purity . Then by the above there exists a pure state with fidelity for which (S12) reads
At this resolution, the differences between the various four-qubit entanglement polytopes are already well visible. For concreteness, suppose that we would like to use the inequality
to deduce that is not entangled of W-type (compare main text). For this, it would suffice by (S13) to verify that the single-particle eigenvalues of the experimentally realized state satisfy the relation
For comparison, for the symmetric Dicke state the left-hand side of the inequality is equal to .
The second, alternative approach for treating noise consists in realizing that there exists a function such that if the local eigenvalues are more than away from an entanglement polytope , then cannot be written as a convex combination of pure states . More precisely, define the distance between an experimentally obtained collection of eigenvalues and an entanglement polytope by
Then the desired function is characterized by the property that
A simple estimate can be derived along the lines of the previous paragraph. Indeed, assume that for some value that is yet to be determined. Let be as above, and let be arbitrary. Then
where the first step is the triangle inequality, and the second step mimics (S11). Borrowing another estimate from (58), this implies that for all . Now assume for the sake of reaching a contradiction that can in fact be written as a convex combination of pure states from .
On the other hand, , which is a contradiction whenever . A short calculations proves that this is certainly the case if we choose .
.4 Linear Entropy of Entanglement and its Distillation
Pure quantum states , whose one-body reduced density matrices are maximally mixed, i.e., , play a special role in entanglement theory. First, any such state maximizes the total uncertainty of any orthonormal basis of local observables (38). Second, any entanglement monotone defined in terms of a -invariant homogeneous polynomial attains on its maximal value over all the states in the same entanglement class (38, 33). To see this, observe that
where is the degree of ; the inequality follows from a result by Kempf and Ness which states that for all if the are maximally mixed (59).
The point in the entanglement polytopes corresponding to quantum states with maximally mixed one-body reduced density matrices will be called the origin and denoted by ; it satisfies for all . Clearly, cannot be expressed as a proper convex combination of any two other points in the entanglement polytope, for we have arranged each vector of eigenvalues in weakly decreasing order. Therefore, Theorem 1 implies that the origin is contained in the entanglement polytope if and only if there exists a covariant with weights . Such a covariant is of course nothing but a -invariant homogeneous polynomial; hence,
In particular, any entanglement monotone defined via polynomial invariants necessarily vanishes on those quantum states whose entanglement polytopes do not include the origin (these states are also called unstable in geometric invariant theory (60); their complement being the semi-stable states). This observation has lead to the suggestion that unstable states should be considered “unentangled” (38) or “not genuinely multipartite entangled” (36, 37), even though they might be entangled according to the standard notion of entanglement that we have adopted in this work.
.4.2 Linear Entropy of Entanglement
The linear entropy of entanglement admits an operational interpretation (63); in the case of multiple qubits, it reduces to the Meyer–Wallach measure of entanglement, and to the concurrence in the case of two qubits (64, 65, 66).
The following result then follows immediately from convexity. It naturally generalizes the properties satisfied by states with maximally mixed one-body reduced density matrix.
Any entanglement polytope contains a unique point of minimal Euclidean distance to the origin . The corresponding quantum states maximize the linear entropy of entanglement over all states in .
The maximal entropy of entanglement that can be obtained from states in the closure of the entanglement class ,
is in view of (S14) a simple function of the Euclidean distance of the entanglement polytope to the origin and can thus be computed easily.
.4.3 Entanglement Distillation
Given the linear entropy of entanglement as a means of quantifying multi-particle entanglement, it is natural to ask for a corresponding distillation procedure, i.e., a protocol for transforming the quantum state by SLOCC operations to a state with maximal linear entropy of entanglement. This might only be possible asymptotically, as the maximum might be contained in the boundary of .
The function is smooth and can therefore be maximized locally by following its gradient flow in . By (S7),
which factors over the action (S3) of the Lie algebra of . Therefore, any solution to the gradient flow equation remains in the entanglement class of the initial value at all times .
In mathematical terms, the Euclidean distance to the origin and hence are closely related to the norm square of the moment map (cf. subsubsection .3.2), and the latter is a minimally degenerate Morse function in the sense of Kirwan (27). The corresponding analog of (S16) had already been noticed in (27). Moreover, it was established that while the solution of the gradient flow equation might not necessarily converge to a unique limit point, is sufficiently well-behaved so that always converges to the global maximum as . We summarize:
By following the gradient flow of , which at any point is given by the infinitesimal action of the reduced density matrices (S16), the global maximum of the linear entropy of entanglement in the closure of the entanglement class of is reached (possibly asymptotically).
In practice, the gradient flow in Theorem 3 would need to be implemented with finite time steps. That is, after preparing the quantum state one measures its one-body reduced density matrices, re-prepares and performs local POVM measurements with Kraus operators , for sufficiently small but finite (cf. (S2)). If the outcomes of these measurements are , …, then entanglement has been distilled. By successively repeating this procedure and concatenating the SLOCC operations, one asymptotically arrives at a quantum state with maximal entropy of entanglement. Notably, this method of entanglement distillation only requires local tomography and works on a single copy of the state at a time.
From a theoretical perspective, the limit point of the gradient flow can also be seen as a normal form of the state in its entanglement class (in case this limit exists). This is the point of view taken in (33), where a similar numerical algorithm has been given for the special case where is contained in the entanglement polytope.
.5 Examples
By associating to every entanglement class its entanglement polytopes, we have obtained a finite yet systematic classification of multi-particle entanglement. In this section, we will illustrate their computation and application by a series of examples for systems of several qubits.
Mathematically, the covariants of a multi-qubit system are in one-to-one correspondence with the covariants of binary multilinear forms, whose study is a prominent topic in classical invariant theory (67, 68). Before we proceed, we introduce some notational simplifications. It will be convenient to represent the local eigenvalues of a system of qubits by the tuple of maximal local eigenvalues. This is of course without loss of information, since the sum of the two eigenvalues of any qubit density matrix, which is a positive semidefinite Hermitian matrix of trace one, is equal to unity. Similarly, we may label the weights of a covariant by the tuple , since the sum of the components of each weight has been fixed to be equal to the degree of the covariant.
three classes that correspond to EPR states shared between any two of the three subsystems,
and the separable class represented by .
We shall now compute the corresponding entanglement polytopes by following the general method of covariants described in subsubsection .3.3. Using techniques crafted towards the special situation of three qubits, the same polytopes have already been computed in (18, 69); the corresponding quantum marginal problem, which as we have explained amounts to computing the maximal entanglement polytope, has been solved in (54). A minimal set of generators of the covariants of a three-qubit system (in fact, of the equivalent question for binary three-linear forms), has been determined in late 19th century invariant theory (70): There are six generators, and we have summarized their properties in Table S1. By Theorem 2, computing the entanglement polytopes is now a mechanical task: for any quantum state representing the entanglement class, we merely need to collect those covariants which do not vanish on the state, and take the convex hull of their normalized weights.
The resulting entanglement polytopes are illustrated in Fig. S1. They are in one-to-one correspondence to the six entanglement classes described above; that is, in this particular case there is no coarse-graining. As explained before, one polytope is contained in the other if quantum states in the former class can be approximated arbitrarily well by states in the latter class. In this case, this is also a necessary condition, since there is no coarse-graining. Since the GHZ-class polytope is maximal, it follows that all states can be approximated arbitrarily well by states of GHZ type. In mathematical terms, the GHZ class is dense; this is of course well-known (6). Similarly, the polytope of the W class (upper pyramid) contains all entanglement polytopes except the GHZ one, so that by states in the W class one can approximate all states except those of GHZ class.
We now illustrate our method of entanglement witnessing:
If the point corresponding to the collection of local eigenvalues is contained in the lower part of the GHZ entanglement polytope (Fig. S1, (A)),
then it is by (S4) not contained in any other entanglement polytope, and therefore the quantum state at hand must be entangled of GHZ type.
More generally, if the point is not contained in any of the polytopes corresponding to an EPR state shared between two of the three particles (Fig. S1, (c), which includes (d)), i.e., if
then by (S4) the quantum state at hand must be entangled of either GHZ or W classes. These classes of states are the ones that possess genuine three-qubit entanglement.
As a final example, we consider the quantum state , where
It is easy to verify by the method of covariants that the entanglement polytope of is full-dimensional, and by the above classification it follows that is of GHZ type. However, its collection of local eigenvalues, , is contained in the interior of the upper pyramid. As we have just discussed, the entanglement criterion (S4) in this case only allows us to conclude that is of either GHZ or W type. By using the entanglement distillation procedure described in subsubsection .4.3 we can however transform by into another state whose local eigenvalues are arbitrarily closed to the origin (Fig. S2). In this way, we arrive at quantum states which are both more entangled and for which our entanglement criterion (S4) is maximally informative.
.5.2 Four Qubits
The case of three qubits was rather special, since there the entanglement polytopes represent faithfully the hierarchy of closures of the corresponding entanglement classes—no coarse graining takes place. In contrast, for four qubits the situation is the generic one: There are infinitely many entanglement classes. According to the classification of (8), they can be partitioned into nine families with up to four complex continuous parameters each. Neither the families themselves, nor the complex parameters within these families are directly experimentally accessible.
Here, we sketch a proof showing that the polytopal view strikes an attractive balance between reducing the complexity sufficiently to allow for simple experimental criteria on the one hand, and preserving a non-trivial structure on the other hand. Indeed, following the tradition established in (6) and continued in (8), we may state that through the polytopal lense, four qubits can be entangled in seven different ways.
We have determined all entanglement polytopes of four qubits using the general method (subsubsection .3.3) applied to a minimal generating set of 170 covariants found in (32). More precisely, for every family in (8), we have analytically computed the covariants using a computer algebra system. Deciding whether a normalized weight is included in then amounts to solving the explicit polynomial equation . The algebra system can readily perform such calculations analytically.
The polytope formed by the marginal eigenvalues of all possible pure states is the convex hull of vertices. These can be easily described as follows: One vertex, , corresponds to product states; six vertices
belong to two-partite entangled states; four vertices
to three-partite entangled states, and one vertex which is the image of a four-partite entangled state (not necessarily genuinely four-partite entangled—see subsubsection .5.3). This latter vertex is the origin as defined in subsubsection .4.1.
As in the three-qubit case, there are several lower-dimensional subpolytopes corresponding to bi-separable states. These are obtained by embedding the entanglement polytopes found in the previous section into the full four-qubit polytope in the obvious way. All possibilities are listed in Table S2.
We turn to the genuinely four-body entangled states. There are seven such polytopes, all full-dimensional. Their definitions and some of their properties are listed in Table S3 and Fig. S3. The four-qubit -state (or Dicke state) corresponds to polytope 5. As is the case for three qubits, the polytope is an “upper pyramid”, i.e., it is the intersection of the full polytope with the half-space defined by
Again in analogy to the three-qubit case, we can take any violation of (S17) as an indication of “high entanglement”. One way to make this precise is to read off Table S3 that violations imply that the state can be converted into one with entropy of entanglement at least (which might be much higher than as obtained from the measured data!). The entanglement classes of the four-qubit GHZ state and of the cluster states (71) are associated with the full polytope (number 7).
There is a numerical coincidence between our findings and the ones in (39), where also seven non-biseparable entanglement classes have been identified on four qubits. The two classifications are, however, not identical. Indeed, (39) is based purely on invariants, as opposed to the more general covariant-theoretic description of our polytopes. As mentioned in subsection .4, invariants cannot differentiate unstable entangled states from product states. Hence, the 7 classes of (39) must all be semi-stable. However the same is true only for our polytopes 4, 6 and 7. In this sense, the polytope methods yields a finer classification for unstable vectors, whereas (39) provides a better resolution of the stable case.
In summary, up to permutations, there are 12 entanglement polytopes for four qubits, 7 of which belong to genuinely four-partite entangled classes. The numbers increase to 41 and 22, respectively, if distinct permutations are counted separately.
.5.3 N𝑁N Qubits and Genuine Multipartite Entanglement
In the examples so far, bi-separable states mapped onto polytopes of lower dimension. This is no longer true for particles (for , the entanglement polytope associated with is clearly 6-dimensional). However, it remains true that spectral information alone can be used to witness genuine -qubit entanglement for any . A general theory of genuine entanglement detection from spectral information will be presented elsewhere. Here, we merely give one example valid for any number of qubits. The result is stated in the language of (19); see also (72, 4, 30, 73, 74, 75) and references therein. Call a vector producible using -partite entanglement if it is of the form , where every is contained in the tensor product of at most sites—otherwise, is said to contain genuine -partite entangled. In particular, the states that contain genuine -partite entanglement are precisely those which are not biseparable, i.e., those which do not factorize with respect to any non-trivial (bi)partition of the subsystems. The reader should not be confused by the fact that some authors use the term “genuine -partite entanglement” in a different sense; c.f. (36, 37), where semi-stability (in the sense of subsection .4) is additionally required for “genuine” entanglement.
Recall first that for a system of qubits the solution of the quantum marginal problem (i.e., the maximal entanglement polytope) is given by the inequalities
for the smallest local eigenvalues (54). Therefore, the polytope for the class of states that factorize with respect to a given partition is defined by the constraints
The following lemma shows that information on the local eigenvalues can serve as a witness for genuine -qubit entanglement (cf. Fig. 3):
Let and . For every the local eigenvalues
can originate only from genuinely -partite entangled (pure) quantum states of qubits. Conversely, if then there exists a realization in terms of a state producible using -partite entanglement.
Consider any bipartition . Without loss of generality, assume that . Then (S19) for reads
This immediately proves that any with the advertised local spectra is genuinely -partite entangled. For if such a factorizes with respect to some partition, then by (S20) at least one factor must comprise at least sites.
To show that the local eigenvalues can indeed be realized using -partite entanglement, consider the bipartition , . Then (S20) is satisfied, and so are all other inequalities in (S19) for . The constraints for are satisfied if and only if , which is true by assumption. ∎
In other words, certain correlations between the one-particle reduced density matrices can only be explained by the presence of genuine -partite entanglement. This result holds in fact for all choices of local dimensions, since we can always reduce to the qubit situation by considering local eigenvalue spectra of rank at most two.
.5.4 Bosons and Fermions
The reduced density matrices can be diagonalized by the coherent action of the group , and the corresponding group of SLOCC operations is (76). Using these definitions, the theory can be developed in precisely the same way as above.
The entanglement polytopes can be computed as above using covariants, which in this case correspond formally to the covariants of binary forms in mathematics; these are again well-studied and explicitly known for small (77, 67). As a convenient shortcut, we will however use a geometric argument which immediately gives the entanglement polytopes for arbitrary :
For a system of bosonic qubits, the entanglement polytopes are given by intervals with
Since the unentangled states are contained in the closure of every entanglement class, every entanglement polytope contains the point . The other end point of the interval, which we denote by , is by (S14) directly related to the maximal entropy of entanglement , and we need to determine the possible values of . First, we observe that since the generalized GHZ state is locally maximally mixed, can always be achieved for arbitrary . Let us now suppose that , i.e., the spectrum of the one-body reduced density matrix is non-degenerate and hence contained in the interior of the set . Let be a quantum state whose one-body reduced density matrix is a diagonal matrix with first diagonal entry . By (S6), can only be a vertex of the entanglement polytope if the range of the differential of at is orthogonal to the space of diagonal observables spanned by (otherwise, could be changed infinitesimally, hence would not be a vertex). By (S7), this is the case if and only if vanishes—in other words, is fixed by the infinitesimal action of (and hence of any diagonal local operator) and thus is an eigenvector of the -operator. Such states are known as occupation number basis states, or Dicke states (78). It is easy to see that the one-body reduced density matrix of a Dicke state with spins pointing upward and spins pointing downward is equal to ; therefore it is mapped into if . Finally, we observe that since the one-body reduced density matrix is diagonal and the global state fixed by diagonal local operators, every Dicke state is a maximum of the entanglement distillation procedure from subsubsection .4.3. It follows that is indeed minimal, hence a vertex of the entanglement polytope. ∎
By associating with each of the entanglement polytopes the set of corresponding quantum states, we obtain families of quantum states. Each family generically consists of infinitely many entanglement classes, except for the unentangled one (), and it can be characterized operationally by the maximal linear entropy of entanglement that can be achieved by states in the family. Furthermore, it follows from the proof of subsubsection .5.4 that the Dicke states for are (up to local unitaries) uniquely characterized by the property that they attain the maximal entropy of entanglement in their entanglement polytope. In contrast, there are generically infinitely many entanglement classes that contain quantum states which are locally maximally mixed (i.e., sent to the origin, corresponding to ); this follows because for there is more than a single invariant. For example, the four qubit GHZ state and the Dicke state with are both locally maximally mixed, but in a different entanglement class.
Here we write for the -th eigenvalue of the one-body reduced density matrix , which—following usual conventions in quantum chemistry—is normalized to . This is the solution to the quantum marginal problem, which in this context is also known as the pure-state -representability problem. Notably, (S22) describes a three-dimensional convex polytope in six-dimensional Euclidean space (due to the three equality constraints). We may therefore without loss of information work in three-dimensional space by consider its projection onto the largest three eigenvalues, .
In the Borland–Dennis system there are four distinct entanglement classes (79); see also (80, 81). They can represented by the following states:
Observe that is the antisymmetrization of a biseparable pure state, while the class of is equal to set of Slater determinants—the fermionic equivalent of a product state. The states and are reminiscent of genuinely entangled GHZ and W states for three qubits (cf. subsubsection .5.1). This remarkable correspondence between the entanglement classification of the Borland–Dennis setup and the classification of the three-qubit system can be explained precisely in a group-theoretical way (79).
We now describe the corresponding entanglement polytopes (Fig. S4): The polytope of the first class is given by the solution of the quantum marginal problem, (S22), since the class is dense in the set of pure states. The polytope of the second class is obtained by replacing the vertex (the origin) with (the local eigenvalues of the state ). This can be established geometrically by generalizing the argument used in the proof of subsubsection .5.4, cf. (27). The entanglement polytope of the third class is given by a line segment, and the polytope of the class of Slater determinants is given by single point. Thus the correspondence between the Borland–Dennis system and the three-qubit system is also manifest on the level of entanglement polytopes: the fermionic entanglement polytopes appear as the “anti-symmetrization” of the three-qubit polytopes (cf. Fig. S1).