Entanglement Distillation
Purifying many noisy pairs into fewer perfect ones.
Every real channel degrades entanglement. Distillation is the remedy: Alice and Bob sacrifice some noisy pairs, using only local operations and classical talk, to purify others. How many perfect Bell pairs can noisy ones yield? The answer defines the distillable entanglement, and comparing it with the cost of creating the state reveals an irreversibility at the heart of entanglement theory.
What you’ll learn
- Define the distillable entanglement and the entanglement cost , and explain why , with equality for pure states.
- Derive the bilateral-CNOT recurrence map on Bell-diagonal states, including the BBPSSW fidelity formula and the DEJMPS improvement.
- Explain the hashing protocol, its yield , and the coherent-information lower bound on .
- Prove that PPT states are undistillable, and explain bound entanglement and irreversibility.
Two numbers: distillable entanglement and cost
Alice and Bob share copies of a mixed state . They want as many Bell pairs as possible, with an error that vanishes as , using LOCC. Conversely, how many Bell pairs does it take to create ? Write .
For pure states both equal the entropy of entanglement , by concentration and dilution. For mixed states, Hayden, Horodecki & Terhal (2001) showed , the regularized entanglement of formation , minimized over decompositions . Additivity of fails in general (Hastings 2009, via Shor's equivalence of the additivity conjectures), one reason is hard to compute.
Recurrence: BBPSSW and DEJMPS
Label the Bell states by two bits: a phase bit ( for ; for ) and a parity bit ( for ; for ). The basic step acts on two pairs, a source and a target: Alice applies a CNOT from her half of the source to her half of the target, and Bob does the same on his side. This bilateral CNOT permutes Bell states:
Both then measure their halves of the target in the basis and compare results by phone. Their outcomes agree iff . They keep the source pair if the outcomes agree, and discard it otherwise.
Inputs are independent copies of . Keep iff the parity bits agree: both pairs -type or both -type.
A kept source carries phase : it is if both pairs were or both were .
Likewise in the sector. Parity errors (the weight) are suppressed quadratically; phase errors are not detected at all.
BBPSSW (1996): feed in Werner-form pairs and twirl the output back to Werner form. Then exactly when ; is a fixed point.
DEJMPS (1996): instead of twirling, Alice applies and Bob to each pair before every round. This swaps the and weights, turning undetected phase errors into detectable parity errors for the next round. It converges much faster and drives every Bell-diagonal state with toward .
Start with Werner pairs of fidelity . After one BBPSSW round, what is the fidelity of the pairs that are kept?
Show the answer
0.79
, and the round succeeds with probability . Each success turns two pairs into one, so after rounds the yield is at most : recurrence alone has zero asymptotic rate as .
Hashing: a positive yield
Recurrence protocols discard at least half of the pairs in every round. The hashing protocol (Bennett, DiVincenzo, Smolin & Wootters, 1996) achieves a constant rate by treating the unknown Bell labels as a classical string to be learned.
Bell-diagonal pairs form a classical mixture over strings of Bell labels: unknown bits carrying entropy per pair.
With high probability lies in a typical set of about strings, so identifying it takes about bits of information.
Bilateral local Clifford operations (CNOTs and local rotations) act on the Bell labels as invertible linear maps over . With them Alice and Bob collect a chosen parity of the whole string onto one pair, measure that pair and compare: one pair sacrificed, one bit learned. Random parities roughly halve the set of candidate strings each time.
After about measurements the string is known, local Pauli corrections fix every remaining pair, and about perfect Bell pairs remain.
The general hashing inequality (Devetak & Winter, 2005): the coherent information is achievable with one-way LOCC from Alice to Bob. For Bell-diagonal states and , recovering the hashing yield.
For Werner-form states , so hashing alone works only for . Combining the methods, recurrence first to push above that threshold and hashing afterwards, gives a positive yield for every . Since local filtering and twirling bring any entangled two-qubit state to Werner form with , every entangled two-qubit state is distillable (Horodecki, Horodecki & Horodecki, 1997).
| Quantity (isotropic two-qubit state, ) | Value | Role |
|---|---|---|
| Hashing yield | achievable: lower bound on | |
| Relative entropy of entanglement | upper bound on | |
| Logarithmic negativity | upper bound on | |
| Entanglement of formation with | upper bound on (Wootters' formula) |
Bound entanglement and irreversibility
Write for the partial transpose on Bob's side. Tensor powers of a PPT state are PPT.
Every separable operation, hence every LOCC protocol, preserves PPT: the partial transpose turns Bob's Kraus operator into its complex conjugate.
For the maximally entangled state of local dimension , with the swap operator. A PPT state has , and .
So every state reachable from by LOCC has overlap at most with Bell pairs (at most with a single one), whereas distillation needs overlap close to . Hence .
Entangled PPT states exist in every dimension beyond : in , and larger (P. Horodecki, 1997; see Separability, PPT & Entanglement Witnesses). Their entanglement is bound: it took entanglement to create them (every bound entangled state has ; Yang, Horodecki, Horodecki & Synak-Radtke, 2005), yet none of it can be distilled back. Entanglement theory is therefore irreversible: .
Why does the PPT argument rule out distillation even with unlimited copies and unlimited rounds of communication?
- Because PPT states are separable
- Because PPT is preserved by tensor powers and by every LOCC map, while states close to Bell pairs are NPT
- Because PPT states have zero entanglement cost
- Because the hashing yield of a PPT state is negative
Show the answer
B. Because PPT is preserved by tensor powers and by every LOCC map, while states close to Bell pairs are NPT
The argument is an invariant: the PPT property survives tensor powers and every separable (hence LOCC) operation, and any PPT state has overlap at most with . No protocol, however long, can leave the PPT set and approach Bell pairs.
Key takeaways
- (Bell pairs out) (Bell pairs in); both equal for pure states, and is the regularized entanglement of formation.
- The bilateral CNOT moves parity forward and phase backward. BBPSSW improves Werner fidelity iff ; DEJMPS rotates between rounds so that phase errors become detectable.
- Hashing yields (positive for Werner states with ); recurrence followed by hashing gives a positive rate for every ; in general .
- PPT states are undistillable: PPT is closed under LOCC and tensor powers, and PPT states have overlap at most with . Bound entanglement makes the theory irreversible.
- Whether NPT bound entanglement exists is open, and is unknown even for two-qubit Werner states.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
A Bell-diagonal state has weights on and on (and zero on ). What yield does the hashing protocol achieve?
Show the answer
C.
, so Bell pairs per input pair. For this rank-2 state the relative entropy of entanglement gives the same value, so hashing is optimal here: .
Why does recurrence-only distillation (BBPSSW or DEJMPS, iterated) have zero asymptotic yield?
- Each round turns at least two pairs into at most one, so rounds yield at most , and reaching needs
- It works only for
- It requires sending qubits between the labs
- It converges to a fixed point strictly below
Show the answer
A. Each round turns at least two pairs into at most one, so rounds yield at most , and reaching needs
Recurrence improves fidelity but halves (at least) the number of pairs per round. Constant-rate distillation needs hashing-type protocols, which learn the error string collectively.
Which statement is always true?
- for every state
- , with equality for pure states
- for every two-qubit state
- is at least the logarithmic negativity
Show the answer
B. , with equality for pure states
You cannot distill more Bell pairs than it took to create the state, since LOCC cannot create entanglement. For pure states both equal .
A state is PPT but entangled. What follows?
- It can be distilled, given enough copies
- It is separable after all
- It can be converted into an exact Bell pair with small but nonzero probability
- Its distillable entanglement is zero, but its entanglement cost is positive
Show the answer
D. Its distillable entanglement is zero, but its entanglement cost is positive
PPT implies , while every entangled state has : this is bound entanglement, the clearest instance of irreversibility.
Further reading
- C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin & W. K. Wootters, "Purification of noisy entanglement and faithful teleportation via noisy channels", Phys. Rev. Lett. 76, 722 (1996).
- D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu & A. Sanpera, "Quantum privacy amplification and the security of quantum cryptography over noisy channels", Phys. Rev. Lett. 77, 2818 (1996).
- C. H. Bennett, D. P. DiVincenzo, J. A. Smolin & W. K. Wootters, "Mixed-state entanglement and quantum error correction", Phys. Rev. A 54, 3824 (1996).
- M. Horodecki, P. Horodecki & R. Horodecki, "Mixed-state entanglement and distillation: is there a 'bound' entanglement in nature?", Phys. Rev. Lett. 80, 5239 (1998).
- R. Horodecki, P. Horodecki, M. Horodecki & K. Horodecki, "Quantum entanglement", Rev. Mod. Phys. 81, 865 (2009).