Multipartite Entanglement
Three or more subsystems can share entanglement in several distinct ways. A Bell pair accompanied by an uncorrelated third qubit is entangled, but its entanglement does not involve all three parties. Conversely, a GHZ state involves all three parties even though every two-qubit reduced state is separable. This chapter explains how to distinguish these possibilities and what happens when a party is measured or lost.
Helpful background. Use bipartite entanglement to test a specified cut and partial traces to describe the parties that remain.
Enter this chapter
Section titled “Enter this chapter”| Question | Start here |
|---|---|
| Which groups of subsystems are being compared? | Multipartite systems |
| What does entanglement involving every party mean? | Multipartite separability |
| How does losing a qubit change correlations? | GHZ states and W states |
| How can a large state have a compact description? | Graph states and stabilizer states |
| How much entanglement can different pairs share? | Monogamy and entanglement sharing |
Separability depends on the partition
Section titled “Separability depends on the partition”Consider three finite-dimensional systems with ordered Hilbert space
A pure state is fully product when it is . It is biseparable when it factorizes across at least one of the three cuts , , or . For example, is biseparable: and share a Bell pair, while is independent of them.
A pure state is genuinely multipartite entangled when it is entangled across every nontrivial bipartition. For three parties, this is equivalent to all three single-party reduced states being mixed. For four parties, checking only single-party reductions is insufficient: two independent Bell pairs have mixed single-qubit reductions but factorize across the cut separating the pairs.
Mixed-state separability concerns possible preparations. A fully separable state admits
A biseparable mixed state is a mixture of states separable across bipartitions, and different terms may use different cuts. Thus a preparation may randomly choose to distribute an entangled pair to , , or , leaving the third party separate each time. Such a mixture is biseparable even if no single fixed cut describes all its terms. Genuine multipartite entanglement rules out every such mixture; entanglement across each fixed cut alone is not a sufficient mixed-state test. See multipartite separability for the convex-set definitions and examples.
GHZ and W states behave differently under loss
Section titled “GHZ and W states behave differently under loss”The three-qubit states
are both genuinely tripartite entangled. Discarding nevertheless gives very different states:
where . The first is explicitly a mixture of product states. The second remains entangled, as its partial transpose has a negative eigenvalue (Exercise 2). The loss of a party therefore removes the accessible entanglement in the GHZ example, whereas pair entanglement survives in the W example. It does not make either state universally more useful: the answer depends on the intended task. Dür, Vidal, and Cirac describe their distinct three-qubit entanglement classes.
For , the equal superposition of and , and the equal superposition of the single-excitation basis states, generalize GHZ and W respectively. Both are genuinely multipartite entangled, but their reduced states still carry different correlations.
Measuring a party differs from discarding it
Section titled “Measuring a party differs from discarding it”Rewrite the GHZ state using :
If measures in this basis and communicates the outcome, and know which Bell state they share. A local phase correction converts to . If the outcome is ignored, they still describe their pair by the separable marginal above. This distinction motivates localizable entanglement: measurements by other parties can make entanglement available to a selected pair when their outcomes are used.
Graph states and limits on sharing
Section titled “Graph states and limits on sharing”A graph state gives a compact construction for many qubits. For a finite simple graph, prepare at each vertex and apply a controlled- gate on each edge. Equivalently, the state is the unique simultaneous eigenvector of the independent commuting operators
where denotes the neighbors of vertex . A graph edge specifies a gate in this construction; it is not a claim that the corresponding two-qubit marginal is entangled. The graph-state and stabilizer pages explain the relation.
For a pure three-qubit state, the Coffman–Kundu–Wootters inequality is
Here and are the two-qubit concurrences of the reduced pairs, while measures pure-state entanglement across . It expresses a limit on how these particular pair entanglements can be shared. Other dimensions, mixed global states, and other measures require their own statements; “monogamy” is not a universal inequality for every entanglement measure. Continue to monogamy of entanglement for the definitions and extensions.
Exercises
Section titled “Exercises”Mixed marginals without genuine four-party entanglement
Section titled “Mixed marginals without genuine four-party entanglement”Compute the single-qubit marginals of . Why do they not establish genuine four-party entanglement?
Solution
Each marginal is , since each qubit belongs to a Bell pair. Nevertheless the given state is explicitly product across . For a pure four-party state, the two-versus-two cuts must also be tested.
Entanglement remaining after loss
Section titled “Entanglement remaining after loss”In basis , partially transpose on and find a negative eigenvalue.
Solution
The partial transpose is
Two eigenvalues are ; the remaining block has eigenvalues . The negative value proves that the reduced pair is entangled.
The missing measurement record
Section titled “The missing measurement record”After measures the GHZ state in the basis, suppose and receive no outcome record. Average their two conditional states and explain why this procedure cannot send a message to them instantaneously.
Solution
The mixture cancels the off-diagonal terms. It equals the original . Their joint statistics are unchanged unless they condition on the communicated record.
References
Section titled “References”- V. Coffman, J. Kundu, and W. K. Wootters, “Distributed entanglement,” Physical Review A 61, 052306 (2000). Article and preprint.
- W. Dür, G. Vidal, and J. I. Cirac, “Three qubits can be entangled in two inequivalent ways,” Physical Review A 62, 062314 (2000). Article and preprint.
- O. Gühne and G. Tóth, “Entanglement detection,” Physics Reports 474, 1–75 (2009). DOI.
- M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest, and H.-J. Briegel, “Entanglement in graph states and its applications,” in Quantum Computers, Algorithms and Chaos, edited by G. Casati, D. L. Shepelyansky, P. Zoller, and G. Benenti, IOS Press, 2006, pp. 115–218. Preprint.