Entanglement of Formation
A pure bipartite state carries an unambiguous entanglement measure — the von Neumann entropy of either reduced density operator, the entropy of entanglement. Mixed states break that clarity, because a single density operator ρ can be assembled from pure states in infinitely many ways, and the correlations inside ρ may be quantum, classical, or a blend of the two. The entanglement of formation resolves the ambiguity operationally: of all the recipes that synthesize ρ from pure entangled ingredients, which one spends the least entanglement? That minimum-over-recipes is the convex-roof construction, the canonical way to lift a pure-state measure to the mixed-state world, and it sits at the centre of the resource theory of entanglement alongside its siblings the distillable entanglement and the entanglement cost. Introduced by Bennett, DiVincenzo, Smolin and Wootters in 1996, the entanglement of formation was conceived as a formation cost — the entangled resource, in ebits, needed to build one copy of ρ by local operations and classical communication (LOCC) given a supply of singlets. Computing it is in general a hard convex optimization with no efficient algorithm known in arbitrary dimension. The triumph of the theory is Wootters' 1998 exact solution for two qubits, where collapses to an algebraic function of the concurrence — one of the very few entanglement measures with a closed form for an entire class of states. This article assembles the definition, proves the properties that make faithful, derives the two-qubit formula, and works the numbers, so the reader can compute for a real density matrix and know what it means.
- The entanglement of formation is the minimal average pure-state entanglement — measured by the entropy of entanglement — needed to build a bipartite mixed state ρ from pure states.
- It is defined by the convex roof: minimize over every pure-state ensemble that reconstructs .
- is a faithful entanglement monotone: it vanishes exactly on separable states and never increases under LOCC.
- For two qubits, Wootters' formula gives the closed form in terms of the concurrence — the only class where the convex roof is solved exactly.
- generally differs from the distillable entanglement and the entanglement cost ; the regularization recovers the true asymptotic cost.
- Additivity of was a landmark open problem; Hastings' 2009 counterexample to additivity of minimum output entropy showed is not additive in general.
- Key idea: Lift the pure-state entropy of entanglement to mixed states by the convex roof — is the minimum, over all pure-state decompositions of ρ, of the average entanglement entropy. The minimization strips away classical correlation and leaves only the genuinely quantum part.
Lift the pure-state entropy of entanglement to mixed states by the convex roof — is the minimum, over all pure-state decompositions of ρ, of the average entanglement entropy, a minimization that separates the genuinely quantum correlations from the merely classical ones.
Where this lives today
The entanglement of formation is the number a laboratory actually reports when it claims to have made an entangled pair. In photonic, trapped-ion and superconducting-qubit experiments the standard pipeline is tomography to reconstruct the two-qubit density matrix, then Wootters' formula: compute the spin-flip eigenvalues, extract the concurrence, and read off in ebits as the certified figure of merit. Beyond two qubits the problem is genuinely hard — computing for arbitrary bipartite states is believed to be intractable, and the practical frontier is semidefinite-programming lower bounds and symmetry-reduced special cases (isotropic and highly symmetric states) where the convex roof can be pinned down. Two deep open questions still hang on . The regularization gap — how far single-copy overshoots the asymptotic cost — is only partly understood, and Hastings' 2009 disproof of additivity showed the gap is real rather than an artifact. And the irreversibility it quantifies — that PPT bound entangled states cost entanglement to make () yet yield none back () — continues to drive the search for a "second law" of entanglement thermodynamics.
The physical picture
Think of a mixed state ρ as a probabilistic recipe for preparing quantum systems. Many recipes — many pure-state ensembles — produce exactly the same ρ, yet they differ enormously in how much genuine entanglement they pour in. A clumsy recipe uses highly entangled ingredients whose entanglement partly cancels into mere classical correlation once you average; a smart recipe uses the least entanglement that still rebuilds ρ. The entanglement of formation is the price tag on the smartest recipe. The first figure makes this concrete with a state whose correlations are entirely classical, yet which can be dressed up in a wasteful entangled disguise.
Mixedness has two origins a naive measure fatally conflates: classical ignorance of which pure state was prepared, and genuine quantum entanglement inside each pure state. The reduced-state entropy sees both at once and overcounts — the classically correlated state above has bit yet zero entanglement. The convex roof cures this by handing you the freedom to choose the decomposition, and the optimal choice pours away every drop of avoidable entanglement, leaving only what is truly irreducible. Geometrically, is the largest convex function on density operators that agrees with the entropy of entanglement on the pure states — the "floor" obtained by draping a convex sheet beneath the pure-state values. For two qubits that floor depends on the state only through a single algebraic number, the concurrence, and the second figure plots the resulting universal curve.
The core equations
The definition is a minimization. A mixed state ρ has infinitely many pure-state decompositions; the entanglement of formation is the smallest average entanglement any of them can achieve. This single optimization is the object everything else in the article computes, bounds, or interprets.
where: — bipartite density operator on ; — a pure-state ensemble realizing ρ, with and ; — the entropy of entanglement of the pure state . Read it as: the cheapest recipe wins, and its cost defines . The ingredient being averaged is the pure-state entanglement, which is unambiguous: the von Neumann entropy of the reduced state. This is the quantity the convex roof lifts, and it is why reduces to the entropy of entanglement whenever ρ is itself pure.
where: — reduced state on subsystem ; — von Neumann entropy in bits (base-2 logarithm), so that one Bell pair carries exactly one ebit. For a Schmidt decomposition this is just . The binary entropy function packages the two-qubit case. It is the Shannon entropy of a biased coin, and it is the exact shape into which Wootters' formula pours the concurrence.
where: — probability argument, ; — binary Shannon entropy, with and maximum . It is symmetric about and concave. For two qubits the whole optimization collapses onto a single scalar, the concurrence, built from the antiunitary spin flip. This is the algebraic miracle that makes computable in closed form for a qubit pair.
where: — the decreasingly ordered square roots of the eigenvalues of (equivalently the eigenvalues of ); — the spin-flipped state, with the complex conjugate in the computational basis. The concurrence runs from (separable) to (maximally entangled). Wootters' formula is the payoff: the entanglement of formation of any two-qubit state is a fixed, monotonically increasing function of its concurrence. Compute from the eigenvalues above, feed it in, and read off in ebits.
where: — concurrence of the mixed two-qubit state; — the increasing, convex map from concurrence to formation plotted in the second figure. At , ; at , ebit. The single-copy is not the last word on cost. The true asymptotic price of preparing ρ is the regularized formation, obtained by amortizing over many copies — and it can be strictly smaller because is generally superadditive.
where: — asymptotic entanglement cost, the ebits per copy needed to prepare ρ by LOCC; — independent copies. Equality would hold if were additive, which in general it is not. Finally, (an upper bound on cost) sits above the distillable entanglement (what LOCC can extract), and the strict gap for many mixed states is the signature of irreversibility.
where: — distillable entanglement, ebits recoverable per copy by LOCC. For pure states all three coincide; for mixed states the chain can be strict, and PPT bound entangled states realize the extreme case .
The goal is to establish the two properties that qualify as a bona fide entanglement measure rather than an arbitrary functional: it is faithful, vanishing precisely on the separable states and strictly positive otherwise, and it is an LOCC monotone, never increasing under local operations and classical communication. Both follow directly from the convex-roof definition together with the corresponding facts about the pure-state entropy of entanglement. We take non-negativity, the two directions of faithfulness, and monotonicity in turn.
Step 1. Non-negativity is immediate: every term in the average of equation (1) is a von Neumann entropy , so every candidate average is non-negative, and therefore so is their minimum, giving . Why: the roof inherits the sign of its ingredient — an average of non-negative numbers cannot dip below zero, and minimizing over such averages cannot either.
Step 2. A separable state has, by definition, a product-state decomposition . Each ingredient is a product pure state with , so this particular ensemble has average entanglement ; since is the minimum over ensembles and cannot be negative, . Why: separability literally hands you a zero-cost recipe, and zero is already the floor from Step 1.
Step 3. Conversely suppose , achieved by some optimal ensemble . Then with every term non-negative, forcing for each with . A pure state with zero entropy of entanglement is a product state, so ρ is a mixture of product states — separable. Why: a sum of non-negative terms vanishes only if each vanishes, and vanishing pure-state entanglement means the ingredient factorizes, which is exactly separability.
Step 4. For monotonicity, any LOCC protocol can be written as a collection of local operations that, conditioned on classical outcomes , map ρ to with probability . Because the pure-state entropy of entanglement is non-increasing under local operations, and because the convex roof is itself convex, averaging over outcomes gives . In particular no LOCC protocol raises the expected entanglement of formation. Why: local maps can only degrade entanglement of the pure ingredients, and convexity guarantees that classical mixing of the outcomes cannot conjure it back. *As a concrete check: the classically correlated state ρ = ½|00⟩⟨00| + ½|11⟩⟨11| gives despite — the product-state recipe costs nothing, confirming that the roof correctly returns zero for a separable state.*
Go deeper · Derivation B · 1 minWhy the convex roof is convex
The goal is to prove that is a convex function of the density operator — mixing two states can never cost more than the average of their formation costs — the property that gives the convex roof its name and its meaning as the largest convex function agreeing with the entropy of entanglement on pure states. The proof is short and general: take the optimal ensembles of the two states, glue them into one ensemble of the mixture, and observe that the minimum defining cannot exceed the cost of that glued recipe.
Step 1. Let be an optimal ensemble for , achieving , and an optimal ensemble for , achieving . These exist because the minimization in equation (1) is over a compact set and the objective is continuous. Why: we need concrete cheapest recipes for each state before we can combine them.
Step 2. Form the mixture with . The combined ensemble has non-negative weights summing to one and reconstructs ρ exactly, so it is a valid — though generally non-optimal — decomposition of ρ. Why: probabilistically mixing the two recipes with weights λ and 1−λ produces exactly the mixed state, providing one admissible way to build it.
Step 3. Because is the minimum over all decompositions, it is bounded above by the average entanglement of this specific one: . The two sums are precisely and , so . Why: a minimum is never larger than the value of any particular candidate, and the candidate's cost splits cleanly into the two optimal costs — that inequality is convexity.
Go deeper · Derivation C · 1 minWootters' formula applied to the Werner state
The goal is to carry Wootters' closed form from a physically natural mixed state to an explicit number, exhibiting the full pipeline — identify the eigenstructure, compute the concurrence, feed it through — on the one-parameter Werner family , which runs from a Bell state at to the maximally mixed, separable state at . Along the way the separability threshold emerges from the concurrence and matches the independent PPT criterion, a strong internal check.
Step 1. The state is Bell-diagonal. Since , the weight on is , and each of the other three Bell states carries weight . These are the eigenvalues of . Why: writing the identity in the Bell basis makes ρ_W diagonal there, so its spectrum is read off with no diagonalization.
Step 2. For a Bell-diagonal state the concurrence is , where is the largest Bell weight. Here , so . The concurrence is positive precisely when . Why: the spin-flip eigenvalues of a Bell-diagonal state are just its Bell weights, so the max-formula of equation (4) reduces to twice the dominant weight minus one.
Step 3. At this gives and hence ebit, the pure Bell state; at it gives and , a separable state. The crossover at coincides exactly with the Peres–Horodecki PPT threshold for Werner states, confirming that the concurrence sees separability correctly. Why: the two extremes and the threshold are known independently, so their agreement validates the whole calculation.
Step 4. For the explicit curve is , a smooth, monotonically increasing function of . At , and ebit — the amber point in the second figure. Why: plugging the concurrence into turns the abstract measure into a number a tomographer can compare against data. *As a direct check: ebit, confirming the value at .*
Limiting cases
The behaviour of across the canonical regimes fixes the meaning of the number and exposes the pitfall it avoids.
| Case | Result | Meaning |
|---|---|---|
| Separable state | Vanishes exactly on the separable set; a product-state recipe costs no entanglement. | |
| Pure state | Reduces to the entropy of entanglement; the only decomposition is the state itself, so the roof is trivial. | |
| Maximally entangled qubits | ebit | Concurrence gives , the maximum for a qubit pair. |
| Maximally mixed qubits | Separable despite ; the reduced entropy is large but the entanglement is zero — the pitfall made vivid. | |
| Werner state, | Rises smoothly from at threshold to ebit at . |
Worked examples
1 · Entanglement of formation of a pure state (confidence builder)
Compute for the pure state , and confirm it agrees with Wootters' formula via the concurrence.
Step 1. For a pure state the convex roof is trivial — the only decomposition is the state itself — so . Trace out : the state is already in Schmidt form with Schmidt coefficients , , giving .
Step 2. Evaluate the entropy: ebit.
Step 3. Cross-check through the concurrence. For a two-qubit pure state . Feed into Wootters: ebit — identical, as it must be. E_F = 0.722 ebit, whether computed as S(ρ_A) or as ℰ(C) with C = 0.8.
2 · A Werner state (fully worked, mixed)
Find for the Werner state , i.e. .
Step 1. Bell weights: for , and for each of the other three. The spectrum is , which sums to as required.
Step 2. Concurrence: . Positive, so the state is entangled — consistent with .
Step 3. Wootters' formula: , so the argument is . Then ebit.
Step 4. Sanity: ebit is far below the ebit of a pure Bell pair — the classical noise in the term has diluted most of the entanglement. E_F(ρ_W, p = ½) = 0.118 ebit at concurrence C = 0.25.
3 · The pitfall in numbers
Contrast with the reduced entropy for the classically correlated state .
Step 1. Reduced state: tracing out gives , so bit — as large as a Bell state's.
Step 2. Concurrence: in the Bell basis , Bell-diagonal with , so and .
Step 3. The gap is the whole lesson: a coin-flip between and is perfectly correlated, entirely classical, zero entanglement. S(ρ_A) = 1 bit, yet E_F = 0 — reduced entropy is not entanglement.
Physics of the portrait
The entanglement of formation is inseparable from one physicist who twice bent the field — first proving you cannot copy a quantum state, then proving you can, for two qubits, put an exact number on how entangled a density matrix is.
Origins · 1 minWilliam Wootters and how this was discovered
William Kent Wootters took his doctorate under John Archibald Wheeler at the University of Texas at Austin, where the questions that would define quantum information were being asked before the field had a name. In 1982, with Wojciech Zurek, he proved the no-cloning theorem — that an unknown quantum state cannot be copied — a one-line argument from linearity that turned out to underpin the security of quantum cryptography and the very possibility of quantum error correction. A decade later, entanglement had become a resource to be measured, and in 1996 Wootters joined Charles Bennett, David DiVincenzo and John Smolin to define the entanglement of formation through the convex roof, giving the mixed-state world its formation-cost measure. The masterstroke came in 1997–1998: with Scott Hill he introduced the concurrence, and then, in a single celebrated paper, Wootters proved that for any two-qubit state the convex-roof optimization — a minimization over a continuum of ensembles that looks utterly intractable — collapses to the closed algebraic form . The proof constructs an optimal ensemble in which every pure member shares the same concurrence, using the antiunitary spin-flip symmetry. It remains one of the few places in entanglement theory where an infinite optimization has a finite answer, and it is why concurrence and entanglement of formation carry, for a qubit pair, the same information.
Going further
Texts. Nielsen and Chuang, Quantum Computation and Quantum Information, §12.5 (entanglement measures) · Watrous, The Theory of Quantum Information, Chapter 6 · Wilde, Quantum Information Theory, 2nd ed., Chapter 22 · Bengtsson and Życzkowski, Geometry of Quantum States, 2nd ed., Chapter 16 · Horodecki, Horodecki, Horodecki and Horodecki, Quantum entanglement, Rev. Mod. Phys. 81, 865 (2009).
Primary sources. Bennett, DiVincenzo, Smolin and Wootters, Phys. Rev. A 54, 3824 (1996) — definition · Hill and Wootters, Phys. Rev. Lett. 78, 5022 (1997) — concurrence · Wootters, Phys. Rev. Lett. 80, 2245 (1998) — closed form · Hayden, Horodecki and Terhal, J. Phys. A 34, 6891 (2001) — cost equals regularized · Hastings, Nature Physics 5, 255 (2009) — non-additivity. Key numerical anchors: ; the Werner Bell-basis eigenvalues are and with concurrence threshold ; the pure-state value is ebit with ; and ebit.
Prerequisites. Entanglement Entropy of Pure States · Schmidt Decomposition · Separable versus Entangled States · Concurrence and Wootters' Formula. Leads to. Concurrence and Wootters' Formula · PPT Criterion and the Peres–Horodecki Test · Entanglement Witnesses.
Ask the tutor: Hand me any two-qubit density matrix and I will walk you through the spin flip, the concurrence, and Wootters' formula to its entanglement of formation in ebits.
Why not just use the reduced-state entropy S(ρ_A) as the entanglement measure?
For a pure state that is exactly right, and reduces to it. For a mixed state it fails, because counts two things at once: genuine quantum entanglement and mere classical ignorance about which pure state was prepared. The classically correlated coin-flip has bit yet contains no entanglement — it is a mixture of product states. The convex roof fixes this by letting you choose the decomposition that minimizes the residual entanglement, which for that state finds the product-state recipe and correctly returns zero.
What does "convex roof" actually mean geometrically?
Picture the entropy of entanglement defined on the pure states only, as a set of heights above the space of density operators. The convex roof is the largest convex function that stays below all those pure-state heights — the surface you get by draping a taut convex sheet underneath them. Equivalently, at any mixed state ρ you look at every way of writing ρ as a convex combination of pure states and take the lowest average height. Convexity (proved in the second derivation) is exactly the statement that this construction produces a convex function, which is what makes it well behaved as a resource measure.
Why is E_F easy for two qubits but hard in general?
The convex roof is a minimization over a continuum of ensembles, and in general there is no way to avoid searching that continuum — the problem is believed to be computationally intractable for arbitrary dimension. Two qubits are special because of a symmetry: the antiunitary spin flip lets Wootters construct an optimal ensemble in which every pure member has the same concurrence. That reduces the whole optimization to computing four eigenvalues of a fixed matrix. No analogous symmetry is known in higher dimensions, which is why has a closed form for qubit pairs and essentially nowhere else.
How do E_F, entanglement cost E_C, and distillable entanglement E_D differ?
They answer three different operational questions. is the entanglement you must spend, in ebits per copy, to create ρ by LOCC in the many-copy limit. is the entanglement you can extract from ρ back into pure Bell pairs by LOCC. is the single-copy formation cost, an upper bound on . For pure states all three coincide, so entanglement manipulation is reversible. For mixed states the chain can be strict, and the gap is the irreversibility of mixed-state entanglement — most dramatically for bound entangled states with .
What is the concurrence really measuring?
The concurrence repackages "how entangled" a two-qubit state is into a single number between 0 and 1, built from the spin-flip operation. For a pure state with the two Schmidt weights, so for a product state and when the weights are equal (a Bell state). For a mixed state it uses the ordered eigenvalues of with a max-of-zero to keep it non-negative. Its reason for existence is that is a fixed monotonic function of it, so concurrence and entanglement of formation carry the same information for a qubit pair.
Why did the additivity of E_F matter so much?
If were additive — — then single-copy would equal the asymptotic entanglement cost , and a whole web of quantities (minimum output entropy, Holevo capacity) would be additive too, giving clean single-letter formulas for channel capacities. That web was conjectured to hold for years. Hastings' 2009 counterexample to additivity of minimum output entropy tore it down, proving is superadditive in general. The consequence is that you must regularize — average over many copies — to obtain the true entanglement cost, and single-copy only bounds it from above.