Distillable Entanglement and Bound Entanglement
The theory of entanglement is, at heart, an economics of conversion. A quantum state is a resource not because it is "spooky" but because it can be traded — under local operations and classical communication (LOCC) — into a single hard currency: the maximally entangled Bell pair, worth one ebit. This replaces the flat question "is entangled?" with two accounting questions. How many Bell pairs can you refine out of many copies of ? That optimal asymptotic yield is the distillable entanglement . And how many must you spend to manufacture ? That is the entanglement cost . For pure states the books balance perfectly: , the entropy of entanglement, so pure-state entanglement is one reversibly tradeable number set by the Schmidt spectrum. Mixed states break the balance. In general , and the inequality can be strict — a thermodynamic-style irreversibility in which entanglement, once poured into a state, can never be fully poured back out. The extreme case is the most startling object in the subject: bound entanglement — states that are provably entangled (a witness fires, they fail every separability test) yet have . Not one clean Bell pair can ever be extracted from them by LOCC, no matter how many copies you hold. The bridge to a computable criterion is a theorem of the Horodecki family: any state with a positive partial transpose (PPT) is undistillable, because PPT survives LOCC while the Bell pair violates it. Every PPT entangled state — and they exist in and systems — is therefore bound. This article builds the operational definitions, proves the pure-state reversibility theorem, proves PPT-implies-undistillable, and writes down the canonical Horodecki state explicitly.
- Distillable entanglement is the optimal asymptotic rate at which near-perfect Bell pairs can be extracted from many copies of using only LOCC; entanglement cost is the reverse rate.
- For pure states both collapse to the entropy of entanglement, , so pure-state entanglement is reversible and uniquely quantified.
- For mixed states , and the gap can be strict — the irreversibility of entanglement manipulation.
- Bound entangled states are entangled yet have : no ebit is extractable, though creating them still costs entanglement, .
- Every PPT entangled state is bound, because PPT is preserved by LOCC while the Bell pair is NPT — its partial transpose carries the eigenvalue .
- Bound entanglement is not inert: it activates distillation of other states and can yield secret key, so the operational landscape is richer than a single number.
- Key idea: LOCC is the free operation and the Bell pair the unit of currency; distillable entanglement is the asymptotic out-rate of Bell pairs, and a bound entangled state is one with a positive out-rate of zero — entangled but locked — which every PPT entangled state must be, since positivity of the partial transpose survives LOCC while the Bell pair has a negative one.
LOCC defines a free operation and the Bell pair a unit of currency. Distillable entanglement is the asymptotic out-rate of Bell pairs; bound entangled states are entangled states with zero out-rate, and every PPT entangled state is bound because positivity of the partial transpose survives LOCC while the Bell pair has a negative one.
Where this lives today
Bound entanglement began as a paradox and became a working part of the quantum-information toolkit. In quantum key distribution it produced its most striking surprise: certain bound entangled states, with , still yield a nonzero distillable secret key — the private states of Horodecki, Horodecki, Horodecki and Oppenheim (2005), so key distillation and entanglement distillation are genuinely different tasks. Bound entanglement also refuses to be inert through activation: individually undistillable states can, combined, become distillable, and Smolin-type four-party bound states can be "unlocked" by classical communication. Experimentally, PPT entangled states have been prepared and certified with tailored non-decomposable witnesses in photonic platforms (Amselem–Bourennane 2009 and later realizations), precisely because the Peres–Horodecki test is blind to them. And the central open question stands: does NPT bound entanglement exist? If some NPT states are undistillable, the clean equivalence NPT distillable fails in high dimensions, and the hierarchy must be redrawn.
The physical picture
Think of entanglement as a fuel. Separable states are empty tanks — LOCC can never pour fuel in. Distillable states are tanks you can siphon into clean, standardized cans: run the right LOCC protocol on enough copies and out come Bell pairs, ready to teleport a qubit or key a cipher. Bound entangled states are the strange third kind: sealed tanks that demonstrably hold fuel — a witness lights up — yet the fuel is locked in a chemistry from which LOCC can pour nothing out. You paid entanglement to fill the tank (), and you will never get an ebit back (). The lock has a precise mechanism: a conserved quantity LOCC cannot violate. Positivity of the partial transpose is preserved by every LOCC map, and the Bell pair breaks it — its partial transpose owns the eigenvalue . You cannot manufacture negativity out of positivity with free operations, so a PPT state can never be nudged toward a Bell target. Distillability and PPT sit on opposite sides of an LOCC-invariant wall.
Pure states escape the trap because they carry no wasted classical ignorance. Their entire content is the Schmidt spectrum , which governs both extraction and creation, so the conversion runs reversibly at rate . Mixing introduces classical uncertainty that can be irreversibly burned, opening the gap and, at the extreme, . The second figure makes the currency concrete: the LOCC engine that turns copies of into ebits, and the negative eigenvalue that powers the distinction.
The core equations
Distillation is asymptotic and error-tolerant: with copies you aim to output roughly Bell pairs, demanding only that the trace-norm error vanish as . is the best such rate.
where: — bipartite state on ; — an LOCC channel on all copies; — the two-qubit Bell state, one ebit; — Bell-pair output rate per input copy; — trace norm, the approximation error. Reading: is the largest yield at which the error still vanishes. Running the machine backwards defines the cost: how many Bell pairs must be fed in to build to vanishing error.
where: — Bell pairs consumed per copy produced; — LOCC channel synthesizing from Bell pairs. Reading: is the cheapest input rate that still succeeds. The cost is not independent; it equals the regularized entanglement of formation — the minimal average pure-state entanglement needed to mix , optimized over asymptotically many copies.
where: — a pure-state decomposition of ; — von Neumann entropy of the reduced state; regularization is needed because is not additive (Hayden–Horodecki–Terhal). The two rates are never in the wrong order — you cannot get more out than you put in, or LOCC would create entanglement free.
where: — out-rate; — in-rate. A strict gap signals irreversibility; the maximal gap is bound entanglement. The central theorem ties distillability to a computable criterion — the partial transpose's sign.
where: — partial transpose on , elements ; PPT — the property . Reading: positive partial transpose certifies undistillability. A computable upper bound on comes from the same object — the logarithmic negativity, the log trace-norm of .
where: — eigenvalues of ; is the negativity. Reading: always, and on every PPT state — re-deriving . The Bell pair violates : it is NPT, its negativity the origin of one full ebit.
where: — partial transpose on the second qubit; the eigenvalue certifies NPT, negativity , and ebit. Finally, the object that proves and "entangled" differ — the canonical Horodecki PPT entangled state, in the basis .
where: — family parameter; for the state is a valid density matrix (, positive), PPT, and entangled — hence bound. At it degenerates to a separable state. The three theorems behind the picture — pure-state reversibility, the PPT obstruction, and the Bell negativity — are derived below.
The goal is to show that for any pure bipartite state the two operational rates coincide with a single number, , so pure-state entanglement is perfectly reversible and measured by the marginal entropy alone. The engine is the typical subspace: independent copies concentrate their Schmidt weight on a set of size of nearly equal amplitudes — exactly a stack of Bell pairs in disguise. We extract that stack (distillation), rebuild the state from it (dilution), and squeeze the two bounds together.
Step 1. Write the Schmidt decomposition , so with entropy . Why: the Schmidt coefficients are the only local invariants of a pure bipartite state, so any LOCC rate can depend on nothing else.
Step 2. Tensor copies: with . By the asymptotic equipartition property these weights concentrate on a typical set of strings, each of weight . Why: many i.i.d. copies flatten the Schmidt spectrum onto an almost-uniform plateau — the fingerprint of maximal entanglement.
Step 3. Distill. Alice and Bob each locally project onto the typical subspace, with success approaching one. The shared state is then approximately maximally entangled across equal terms — that is, Bell pairs. Hence . Why: a flat Schmidt vector of dimension is precisely ebits.
Step 4. Dilute. Conversely, from Bell pairs, Schumacher compression plus classical communication synthesizes to fidelity approaching one. Hence . Why: the same typical subspace tells you exactly how many ebits are needed to pack the state back in.
Step 5. Squeeze. With the universal ordering , the two bounds give , forcing all three equal and the round trip reversible. Why: two inequalities pointing the opposite way through a general one pin the quantity to a formula. *Sanity checks: a Bell pair has , giving ebit; a product state has , giving .*
Go deeper · Derivation B · 2 minPositive partial transpose forbids distillation
The goal is to prove the load-bearing theorem of the subject: if then , so no LOCC protocol on any number of copies can squeeze out a single clean Bell pair. The strategy is to find an invariant — positivity of the partial transpose — that every LOCC map preserves, then observe that the distillation target lies strictly outside that invariant set. A protocol that never leaves a closed region can never reach a point outside it, so the achievable rate is zero.
Step 1. Every LOCC operation is a special separable map, , conditioned on classical messages. Why: local Kraus operators tensor across the cut, and classical communication only selects among local branches — it introduces no non-local operator.
Step 2. The partial transpose intertwines with local maps: , with the complex conjugate. Why: transposing turns the right action of into a left action of , so the expression stays a congruence — and congruences preserve positivity.
Step 3. So if , each output term and their sum stays : PPT is a closed, LOCC-invariant set, stable under tensoring, so remains PPT. Why: a sum of positive operators is positive — no branch, no number of copies, can manufacture a negative eigenvalue.
Step 4. The target lies outside this set. The Bell pair is NPT ( has eigenvalue ), and any state within small trace-norm distance of is NPT too, since eigenvalues move continuously. Why: NPT is an open condition, so a whole neighbourhood of the target is forbidden to a PPT trajectory.
Step 5. Conclude. From PPT , no LOCC channel can enter the NPT neighbourhood of any Bell target, so the best rate with vanishing error is : . With for entangled , every PPT entangled state is bound. Why: an invariant separating start from target is a conserved obstruction, like a topological charge. *Consistency check: in and , PPT is equivalent to separable, so no PPT entangled state exists and the theorem is non-vacuous only from and upward.*
Go deeper · Derivation C · 1 minThe Bell state has a negative partial transpose
The goal is a direct, by-hand computation that anchors everything else: the maximally entangled two-qubit state violates PPT, with partial-transpose spectrum , negativity , and logarithmic negativity exactly ebit. This single negative number makes the wall of the previous derivation a real barrier, and it fixes the currency unit — one Bell pair is worth one ebit of negativity.
Step 1. Write . The off-diagonal coherences and are where the entanglement lives. Why: a separable diagonal ensemble has no such cross terms; they are the target of the partial transpose.
Step 2. Apply , transposing the index of each bra–ket pair: and , diagonal terms untouched. Why: transposition swaps the second-slot labels, moving coherence from the sector into the sector.
Step 3. The result is . The block is , eigenvalues ; the diagonal contributes . Why: an antidiagonal block splits into symmetric and antisymmetric eigenvectors — one positive, one negative eigenvalue of equal magnitude.
Step 4. Collect the spectrum : negativity , trace norm , and ebit. Why: one full ebit of logarithmic negativity defines the currency unit against which every other is quoted. *The partial transpose returns eigenvalues , trace norm , and , matching the standard negativity of a maximally entangled qubit pair.*
Limiting cases
How the two rates specialize across the hierarchy:
| Case | Result | Meaning |
|---|---|---|
| Pure state | Reversible regime; a Bell pair gives ebit, a product state . | |
| Separable | No entanglement; freely creatable, trivially undistillable. | |
| PPT entangled (bound) | Entangled but undistillable — maximally irreversible. Witness fires, partial transpose stays . | |
| NPT distillable | Generic entangled states; some pure entanglement is recoverable, negativity . | |
| Two-qubit, qubit-qutrit (, ) | PPT equals separable here; no bound entanglement exists in these dimensions. |
Worked examples
1 · When does white noise kill distillability? The two-qubit Werner state (fully worked)
Consider the Werner state , a singlet blended with maximally mixed noise. For which mixing is it entangled, and hence (in ) distillable? Find the negativity.
Step 1. Take the partial transpose. Since and the singlet, like any Bell state, has partial-transpose spectrum , linearity gives , whose eigenvalues are .
Step 2. Evaluate the four eigenvalues. Three come from the Bell eigenvalues: (always positive). One comes from the eigenvalue: .
Step 3. The lone eigenvalue turns negative exactly when . So is NPT — hence entangled and, in , distillable — precisely for ; for it is separable, .
Step 4. Read off the negativity: . At (pure singlet) , recovering the Bell result; at , ; at the boundary , . The critical noise level is : below it the singlet's entanglement is fully washed out. Numerically confirmed: at the partial-transpose eigenvalues are , negativity ; at they are , exactly the separability edge.
2 · The Bell pair versus a PPT state: one ebit against zero (fully worked)
Compare the logarithmic negativity, and hence the distillability, of the Bell state with that of any PPT state .
Step 1. For , Derivation 3 gives spectrum , so and . Since and is pure with , in fact ebit — the currency unit.
Step 2. For any PPT state , positivity gives , so and .
Step 3. Since , a value of forces : no PPT state can be distilled, re-deriving equation from negativity alone. The Bell pair carries a full ebit, while any PPT state — even the entangled Horodecki — carries exactly zero. But does not make separable: it certifies undistillability, not separability. separates the distillable Bell pair (1 ebit) from every bound state (0 ebits) with a single scalar.
Physics of the portrait
Bound entanglement is the work not of one theorist but of a family that turned entanglement from a yes/no property into a structured, computable hierarchy in a few years in the late 1990s.
Origins · 1 minHorodecki family and how this was discovered
The Horodecki family — Ryszard Horodecki and his sons Paweł and Michał, working in Gdańsk — reshaped entanglement theory in a burst between 1996 and 1998. In 1996, building on Asher Peres's proposal that a separable state must have a positive partial transpose, the three proved the converse in the smallest cases: in and systems PPT is not merely necessary but sufficient for separability, so entanglement there is exactly negativity of the partial transpose. The same paper introduced entanglement witnesses via the Hahn–Banach separation theorem. The deeper surprise came next: in 1997 Paweł Horodecki constructed an explicit state — the matrix of this article — that is PPT yet demonstrably entangled, using a range criterion to rule out separability. Then in 1998 all three proved that any PPT state is undistillable, coining bound entanglement: entanglement that costs ebits to create but returns none. This split the once-monolithic notion of "entanglement" into a layered resource theory of free, bound, and distillable strata, mapped in their standard 2009 Reviews of Modern Physics survey. The through-line is operational: an entanglement measure earns its name only by controlling a physical conversion rate, and bound entanglement is the proof that detection and distillation are different questions.
Going further
Texts. Nielsen & Chuang, Quantum Computation and Quantum Information, §12.5 · Preskill, Lecture Notes on Quantum Computation, Ch. 4 · Watrous, The Theory of Quantum Information, Ch. 6 · Wilde, Quantum Information Theory, Ch. 19–21 · Horodecki⁴, Quantum entanglement, Rev. Mod. Phys. 81, 865 (2009) · Horodecki³, Phys. Rev. Lett. 80, 5239 (1998). The key numerical anchors are: (1) the Bell partial-transpose spectrum , negativity , ebit; (2) the Werner PT eigenvalues (triple) and , entangled iff , negativity at ; (3) of equation has unit trace, is positive semidefinite, and is PPT for . The pure-state squeeze establishes reversibility; PPT preservation under LOCC gives for all PPT states; and PPT separable in and .
Prerequisites. Separable versus Entangled States · PPT Criterion and the Peres–Horodecki Test · Schmidt Decomposition · Entanglement Entropy · Entanglement Witnesses. Leads to. Bell States and EPR Pairs · Concurrence and Wootters' Formula · Nonlocality and the No-Signalling Principle.
Ask the tutor: Ask me to walk through why the partial transpose is the exact obstruction to distillation, or to compute the negativity of any state you name.
What is the difference between distillable entanglement and entanglement cost?
They are the two directions of the same conversion. Distillable entanglement is the best rate at which you can refine many noisy copies into near-perfect Bell pairs using only LOCC — the output rate of the currency. Entanglement cost is the rate at which you must feed Bell pairs in to build the state — the input rate. For any state , because otherwise you could create a state cheaply and distill more than you spent, generating entanglement for free under LOCC. When the manipulation is irreversible; when the state is bound.
How can a state be entangled but have zero distillable entanglement?
Entanglement means the state cannot be written as a mixture of product states — a structural fact, certified by a witness or by . Distillability is a stronger, operational demand: that LOCC can actually extract clean Bell pairs from many copies. A PPT entangled state satisfies the first but fails the second, because its partial transpose stays positive under every LOCC map, so the state can never be driven toward a Bell pair, which is NPT. The entanglement is really there — you paid for it — but it is locked in a form no free operation can convert into usable ebits. That locked form is exactly what "bound" names.
Why is the partial transpose the right tool here?
Two facts conspire. First, transposition is positive but not completely positive, so applying it to one half of an entangled state can produce a negative eigenvalue — a flag no separable state can raise. Second, and crucially for distillation, the positivity of the partial transpose is preserved by all LOCC operations, because local Kraus operators intertwine with as a congruence. That makes PPT a conserved obstruction: an LOCC trajectory starting inside the PPT region stays there forever, while the Bell target lives outside. The partial transpose is thus both a separability probe and a distillability barrier.
Is logarithmic negativity a perfect measure of distillable entanglement?
No — it is a convenient bound, not an equality. Logarithmic negativity is easy to compute (just diagonalize the partial transpose) and it upper-bounds , so guarantees . But the gap can be large: many NPT states have strictly above their true , and computing exactly is generally intractable. Use as a fast certificate of undistillability and a ceiling on the yield, not as the yield itself.
Does bound entanglement have any use at all, or is it just a curiosity?
It is genuinely useful, which is what makes it interesting rather than pathological. Bound entangled states can be activated: two states individually undistillable can, used together, allow distillation, and bound states can boost the teleportation fidelity achievable from another resource. More dramatically, some support a nonzero distillable secret key, so they are useful for cryptography even though they yield no Bell pairs. These phenomena show that a single scalar cannot capture a state's worth — the value depends on the task and on what other resources are at hand, which is the whole point of a resource theory.
Why does bound entanglement need at least a 3×3 or 2×4 system?
Because in the smallest systems — (two qubits) and (qubit and qutrit) — the Horodecki family proved that a positive partial transpose is not merely necessary but sufficient for separability. So there every entangled state is NPT, every NPT state is distillable, and there is no room for a state that is entangled yet PPT. The equivalence breaks at and : the set of PPT states becomes strictly larger than the separable set, opening a shell of PPT entangled states. Those are the smallest bound entangled states, and Paweł Horodecki's matrix is the canonical inhabitant of that shell.