Distributed Monogamy of Entanglement

• Distributed monogamy of entanglement is a framework that restricts how bipartite entanglement is shared across multiple quantum parties using recursive n‐party inequalities and partition-dependent trade-offs.
• It builds on foundational formulations like the CKW inequality, employing equality conditions that ensure a subsystem’s entanglement with one set precludes nonzero entanglement with another.
• Recent advances extend these concepts with operational limits on extracting EPR pairs and refined hierarchies for entanglement measures such as EOF and concurrence in multiqubit systems.

Distributed monogamy of entanglement denotes the family of constraints that govern how bipartite entanglement can be allocated across multipartite quantum systems. In its standard form, monogamy compares the entanglement between a distinguished subsystem and the remainder with the sum of its pairwise entanglements to individual parties; in its distributed form, the notion is sharpened by recursive $n$-party inequalities, partition-dependent trade-offs, and, in recent work, operational limits on extracting EPR pairs from subsets of parties in a network (Zong et al., 2022). A complementary review perspective emphasizes that distributed monogamy also includes partition-sensitive relations such as “entanglement polygon” or “triangle” inequalities, which track entanglement across many bipartitions rather than only node-to-node marginals (Guo et al., 26 Dec 2025).

1. Foundational formulations

The prototypical monogamy relation is the Coffman–Kundu–Wootters inequality for three qubits,

$C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$

where $C$ is Wootters’ concurrence and the square $C^2$ is the tangle. In generalized CKW form, for a bipartite entanglement measure $E$ and an $n$-partite state $\rho_{A_1A_2\cdots A_n}$, one writes

$$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$

or, more commonly in the qubit literature, one studies powered variants $E^\alpha$ for a suitable exponent (Zong et al., 2022).

Distributed monogamy extends this perspective in two directions. First, it includes recursive network inequalities such as

$$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$

which are obtained by iterating a tripartite monogamy relation. Second, it includes partition-aware constraints: in a four-partite pure state $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$0 one may compare $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$1 not only with $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$2 but also with quantities such as $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$3, thereby tracking the full sharing structure across bipartitions (Guo et al., 26 Dec 2025).

A related unifying concept is the monogamy power. Guo defined the monogamy power $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$4 of an entanglement measure as the infimum of exponents for which $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$5 satisfies the exact $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$6-party monogamy inequality for all multipartite states, and similarly introduced the polygamy power for assisted entanglement. In that framework, once a given power makes the tripartite inequality hold, larger powers inherit monogamy for arbitrary $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$7 (Guo, 2017).

2. Equality-based monogamy and the disentangling condition

A major conceptual shift came from the equality-based definition of monogamy. Instead of beginning with a fixed additive inequality, one says that a bipartite entanglement measure $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$8 is monogamous if, for every tripartite state $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$9,

$C$0

This “disentangling condition” captures the idea that if all of $C$1’s entanglement with $C$2 is already exhausted by $C$3, then no entanglement remains across $C$4 (Guo et al., 2018).

For continuous measures, this condition is equivalent to the existence of a dimension-dependent exponent $C$5 such that

$C$6

for all tripartite states in bounded dimension. The exponent is generally non-universal and dimension-dependent, but the equivalence shows that equality-based monogamy and powered CKW-type inequalities are two formulations of the same underlying constraint (Guo et al., 2018).

The structural content of the disentangling condition is strongest for measures that, on pure bipartite states, are given by a strictly concave function of the reduced density matrix. If

$C$7

with $C$8 unitary-invariant and strictly concave, then for a pure tripartite state $C$9 satisfying $C^2$0, subsystem $C^2$1 factorizes as $C^2$2 up to a local unitary, and one can write

$C^2$3

Consequently, $C^2$4 is product and $C^2$5. The same strict-concavity hypothesis also yields monogamy for convex-roof extensions on mixed tripartite states: if $C^2$6, then $C^2$7 is separable and $C^2$8 (Guo et al., 2018).

This immediately produces a distributed version. By iterating the tripartite inequality over $C^2$9, one arrives at

$E$0

which is precisely a distributed monogamy inequality over an $E$1-party network (Guo et al., 2018).

3. Entanglement of formation and the rehabilitation of monogamy

The entanglement of formation (EOF) has been central to debates on monogamy because the unsquared quantity does not generally satisfy the naive three-party inequality

$E$2

For pure tripartite states, Fanchini and collaborators expressed the failure of this linear inequality through the EOF-tangle

$E$3

where $E$4 is quantum discord and $E$5 is the discrepancy between classical and quantum correlations. In this formulation, $E$6 exactly when the total quantum-correlation share exceeds the total classical share. For the GHZ family, $E$7, whereas for the W family one has $E$8 for all nontrivial parameters; the symmetric W state gives $E$9 (Fanchini et al., 2011).

The later resolution was that the apparent non-monogamy of EOF is specific to the unsquared quantity. Oliveira, de Oliveira, and collaborators showed that the square of EOF obeys exactly the same CKW-type inequality as squared concurrence: $n$0 They further extended this to arbitrary $n$1-qubit states,

$n$2

by combining generalized CKW monogamy for $n$3 with the fact that $n$4 is a strictly increasing convex function of $n$5 on two-qubit states (Oliveira et al., 2013).

This result changed the status of EOF in the monogamy literature. The unsquared measure fails the naive additive inequality, but the squared measure satisfies the full CKW-style distributed constraint on multiqubit systems. At the same time, even linear EOF cannot be freely shared: for pure three-qubit states one numerically finds the strict upper bound

$n$6

with the maximal value nearly attained by a W-type state that also maximizes the single-qubit entropy $n$7 (Oliveira et al., 2013).

EOF is also tightly linked to classical correlations through the Koashi–Winter identity,

$n$8

which implies, for pure three-qubit states,

$n$9

States approaching the EOF-sum bound have nearly maximal $\rho_{A_1A_2\cdots A_n}$0 and reduced classical correlation (Oliveira et al., 2013).

A broader multipartite picture emerges from monogamy-like relations between EOF and discord. For pure tripartite states one has

$\rho_{A_1A_2\cdots A_n}$1

and for arbitrary pure $\rho_{A_1A_2\cdots A_n}$2-partite states there are cyclic equalities in which sums of EOF terms across selected bipartitions exactly match sums of discord terms after the conditional-entropy contributions cancel telescopically (Ferreira et al., 2018).

4. Strict concavity, non-monogamous monotones, and common misconceptions

The strict-concavity criterion also clarifies why some LOCC-monotones fail monogamy. Guo’s partial-norm family comprises the partial-norm of entanglement $\rho_{A_1A_2\cdots A_n}$3, minimal partial-norm $\rho_{A_1A_2\cdots A_n}$4, reinforced minimal partial-norm $\rho_{A_1A_2\cdots A_n}$5, and partial negativity $\rho_{A_1A_2\cdots A_n}$6. On pure states, their reduced-state functions are concave but not strictly concave; after convex-roof extension they remain bona fide LOCC-monotones, yet they are not monogamous (Guo, 2022).

The mechanism of failure is explicit. For $\rho_{A_1A_2\cdots A_n}$7 one can construct a tripartite state with

$\rho_{A_1A_2\cdots A_n}$8

while $\rho_{A_1A_2\cdots A_n}$9 has nonzero partial-transpose negativity, so $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$0. Analogous constructions show that $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$1 and $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$2 are likewise non-monogamous for $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$3, and that $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$4 can hold simultaneously with $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$5 (Guo, 2022).

This establishes a sharp distinction between concavity and strict concavity. With strict concavity, equality in the Jensen-type step forces all reduced states in an optimal decomposition to coincide, which in turn yields factorization and disentangling. With mere concavity, equality can be saturated by distinct spectra, and residual entanglement on the unused cut can survive. From the perspective of quantum networks, the paper states that any entanglement measure intended to control or bound the sharing of bipartite links must be informationally complete, i.e. must have a strictly concave reduced-state function, if one wants guaranteed monogamy (Guo, 2022).

A related misconception concerns quantum correlations beyond entanglement. Streltsov, Adesso, Piani, and Bruss proved that any measure of correlations that is monogamous on all states and satisfies positivity, local-unitary invariance, and no increase under attaching an uncorrelated ancilla must vanish on all separable states. In that sense, only entanglement measures can be strictly monogamous on all states. Their restricted positive example is the geometric discord, which satisfies the monogamy inequality on all pure states of three qubits but not on general mixed states (Streltsov et al., 2011).

5. Dimension dependence and weighted hierarchies

Distributed monogamy is not dimension-universal for all entanglement measures. Lancien, Di Plinio, Price, and Winter formalized general quantitative monogamy as the existence of a continuous trade-off function

$$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$6

with $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$7 and strict inequality on some region. They showed that every additive and suitably normalized entanglement measure that faithfully captures the fully antisymmetric state fails any nontrivial dimension-independent monogamy relation; this includes the regularized entanglement of formation $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$8 and the regularized relative entropy of entanglement $$E(\rho_{A_1\mid A_2\cdots A_n})\ge \sum_{i=2}^n E(\rho_{A_1A_i}),$$9. They also proved that non-regularized $E^\alpha$0 and $E^\alpha$1 generically violate any dimension-independent monogamy on random induced states in large dimension (Lancien et al., 2016).

What survives is dimension-dependent monogamy. For any fixed finite dimensions $E^\alpha$2, explicit inequalities restore strict trade-offs. For EOF one such bound is

$E^\alpha$3

for universal constant $E^\alpha$4 and $E^\alpha$5, $E^\alpha$6 (Lancien et al., 2016).

Within multiqubit systems, a separate development produced hierarchies of tighter distributed inequalities. A unified framework identifies the smallest monogamy exponent $E^\alpha$7 for several measures on qubit systems: $E^\alpha$8 for concurrence, $E^\alpha$9 for entanglement of formation, and $$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$0 for Tsallis–$$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$1, Rényi–$$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$2, and unified-$$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$3 entanglement in the parameter ranges stated in the original theorem (Yang et al., 2020). Under ordering assumptions on pairwise entanglements, later works replaced the unit coefficients in CKW-type sums by larger weights, first $$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$4 and $$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$5 for concurrence and EOF, and then the strictly larger factors $$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$6 and $$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$7 (Jin et al., 2017). Further refinements introduced parameter-dependent prefactors, Hamming-weight constructions, and additional cross-terms for concurrence, negativity, CREN, and general powered entanglement measures, always with the stated goal of obtaining tighter lower bounds than earlier CKW-type estimates in multiqubit systems (Jin et al., 2018).

These hierarchies do not replace the equality-based picture; rather, they quantify how much slack remains once monogamy is already known to hold for a powered measure. They are therefore a quantitative refinement of distributed monogamy, not an alternative definition.

6. Multipartite geometry, operational limits, and recent extensions

Distributed monogamy also appears in geometric constraints involving genuine multipartite entanglement. For an $$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$8-qubit pure state and a nodal qubit $$E^\alpha(\rho_{A\mid B_1\cdots B_{n-1}})\ge \sum_{i=1}^{n-1}E^\alpha(\rho_{AB_i}),$$9, the monogamy score

$C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$00

is bounded above by a function of the generalized geometric measure $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$01 whenever the largest Schmidt coefficient arises from a $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$02 bipartition. For entropic measures such as EOF, discord, squashed entanglement, work-deficit, and relative-entropy entanglement, the bound is

$C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$03

while for squared concurrence it is

$C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$04

For pure three-qubit states this upper bound is universal (Kumar et al., 2015).

A related three-qubit program uses genuine multipartite source entanglement $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$05 as an upper bound for the sum of pairwise EOF squares. For GHZ-class states, the square of source entanglement serves as an upper bound for $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$06, with some exceptions for specific non-generic GHZ states. Numerical evidence supports the same inequality for W-class states. By contrast, accessible entanglement $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$07 is generally too weak: the analogous bound with $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$08 is almost always violated once any reduced pair carries entanglement (Char et al., 2024).

The most explicitly operational formulation to date is based on extendibility. For integer $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$09, $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$10-extendibility quantifies how many copies of one subsystem can be simulated by the environment. A finer notion, fractional or $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$11-extendibility, is invariant under tensor products and monotonic under local processing. Using it, a recent theorem establishes that for any state on $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$12, the maximum average probability of extracting an EPR pair from a random subset of $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$13 systems among the $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$14’s is exactly the fraction $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$15 in the ideal case, and at most $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$16 under $C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$17-approximate extraction (Ahmed et al., 9 Jul 2026). In formula form,

$C^2(A\mid BC)\ge C^2(A\mid B)+C^2(A\mid C),$18

when the decoders recover a perfect maximally entangled pair from each chosen subset (Ahmed et al., 9 Jul 2026).

This operational distributed monogamy has a direct channel-theoretic consequence: any quantum erasure channel with erasure probability more than a half cannot simulate a less noisy erasure channel, even with asymptotically many uses of the noisier channel (Ahmed et al., 9 Jul 2026). A plausible implication is that distributed monogamy is no longer only a property of static multipartite states; it also functions as an obstruction in asymptotic channel simulation.

A complementary qualitative dual is converse monogamy. For a tripartite pure state, if one reduced pair is entangled and non-distillable, then the other two reduced pairs are distillable; in the terminology of Chen and Hayashi, weak entanglement on one cut forces strong distillable entanglement on the remaining cuts (Chen et al., 2011). Together with the equality-based, powered, geometric, and operational formulations, this suggests that distributed monogamy is best understood not as a single inequality but as a layered principle governing which multipartite entanglement configurations are kinematically, geometrically, and operationally compatible.