REVIEW
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Quantum Physics · Submitted 20 Nov 1995 · 13 references
Pith's verdict: The founding paper of entanglement distillation: the constructive lower bound is solid, and the only real soft spot is an upper bound borrowed from an unpublished companion preprint.
T0 · AI review
Why Pith says this
Highlight any text to comment on it.
Referee report
The paper
The paper claims
Two distant observers who share imperfectly entangled pairs can, by local operations and ordinary classical messages, distil a smaller number of nearly perfect singlets from them, and then use those singlets to teleport unknown quantum stat
The reading
What carries the argument
The BXOR test is the engine. Alice and Bob each apply a controlled-NOT from one shared pair into another, then measure the target pair along the $z$ axis; the target survives the measurement only if its two spins come out parallel. Because the four Bell states transform under this operation in a small, tabulated way, the test works as a parity check that reveals whether the tested subset contains an even or odd number of $|M|$-type pairs, without disturbing the sources. Running enough tests on random subsets identifies every bad pair with high probability, at a cost asymptotically equal to the state's von Neumann entropy $S(W)$ — the same counting that makes classical parity-check codes work. The companion device is the random bilateral rotation, which exploits the singlet's invariance to symmetrize an arbitrary mixed pair into Werner form without changing its fidelity, so that a single number $F$ becomes a complete description of the resource.
Extended reading notes
Core claim
The central claim is that entanglement, unlike classical information, can be concentrated out of noise. Formally, if a shared two-spin state $M$ has fidelity $F = |M| > 1/2$ relative to the singlet $|M|$, then the distillable yield $D(M)$ is strictly positive. The argument is constructive. A random bilateral rotation turns any $M$ into a Werner state $W_F$ — a mixture of the singlet with the three triplets in equal proportion — carrying the same $F$, and two Werner pairs of fidelity $F > 1/2$ can be converted, with probability greater than $1/4$, into one Werner pair of fidelity $F' = (F^2 + (1-F)^2/9)/(F^2 + 2F(1-F)/3 + 5(1-F)^2/9)$, which exceeds $F$ on the whole interval. Iterating drives $F$ toward $1$. A second, more efficient method uses already-pure pairs as targets for parity checks on impure ones, locating and correcting errors at a cost of $S(W)$ tests per pair and leaving a yield of $1 - S(W)$, which is positive for Werner states above $F = 0.8107$. Against this, the paper sets an upper bound: $W_F$ can be written as an equal mixture of eight pure states each with entanglement $H_2(1/2 + |M|)$, and since local operations and classical communication cannot increase expected entanglement, no protocol can distill more than that.
Load-bearing premise
The argument assumes that fidelity relative to the singlet is a sufficient description of a shared pair once it has been symmetrized, so that a single threshold at one half governs every mixed state and not merely the rotationally symmetric ones.
Editorial extensions
If this is right
- Any noisy quantum channel whose output pairs exceed fidelity $1/2$ can be upgraded into a faithful channel for quantum states, at some nonzero rate, using only local operations and classical communication.
- Werner states with $F > 1/2$ must be regarded as nonlocal and useful, even though they violate the Clauser-Horne-Shimony-Holt inequality only above $F \approx 0.78$; Bell violation is therefore not the boundary of exploitable entanglement.
- The von Neumann entropy of a shared mixed state becomes the currency of purification: the breeding method yields $1 - S(W)$ pure singlets per impure pair, a positive rate whenever $S(W) < 1$.
- Because the entanglement of formation cannot be increased by local operations and classical communication, it caps every conceivable distillation protocol, not just the ones constructed here.
- A one-way-communication variant of the error-locating protocol extends the same reasoning from transmission to storage, protecting quantum information against errors while it sits in memory.
Reading between the lines
- The threshold at one half reframes the classical-quantum divide as a rate rather than a property: every fidelity above $1/2$ buys some strictly positive asymptotic yield, so the interesting object becomes the shape of $D(F)$ on the interval, which the paper explicitly leaves undetermined.
- Since the BXOR test is a parity check and its cost is an entropy, the purification protocol is structurally the same object as an error-correcting code or a privacy-amplification scheme; one expects a general correspondence in which distillation rate is set by how much syndrome information a state carries.
- The visible gap in the paper's own figure between the best achieved yield and the entanglement-of-formation bound is a concrete numerical target: closing it, or proving for some state that distillable entanglement falls strictly below entanglement of formation, would settle whether the two measures ever separate.
- The recurrence step needs two-way classical communication while the non-breeding variant needs only one-way, which suggests that the direction and amount of classical communication should be counted as a resource in its own right alongside the entanglement consumed.
Original abstract
Two separated observers, by applying local operations to a supply of not-too-impure entangled states ({\em e.g.} singlets shared through a noisy channel), can prepare a smaller number of entangled pairs of arbitrarily high purity ({\em e.g.} near-perfect singlets). These can then be used to faithfully teleport unknown quantum states from one observer to the other, thereby achieving faithful transfrom one observer to the other, thereby achieving faithful transmission of quantum information through a noisy channel. We give upper and lower bounds on the yield $D(M)$ of pure singlets ($\ket{\Psi^-}$) distillable from mixed states $M$, showing $D(M)>0$ if $\bra{\Psi^-}M\ket{\Psi^-}>\half$.
The compiled record
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
The abstract, sentence by sentence
Two separated observers, by applying local operations to a supply of not-too-impure entangled states ({\em e.g.} singlets shared through a noisy channel), can prepare a smaller number of entangled pairs of arbitrarily high purity ({\em e.g.} near-perfect singlets). These can then be used to faithfully teleport unknown quantum states from one observer to the other, thereby achieving faithful transfrom one observer to the other, thereby achieving faithful transmission of quantum information through a noisy channel. We give upper and lower bounds on the yield $D(M)$ of pure singlets ($\ket{\Psi^-}$) distillable from mixed states $M$, showing $D(M)>0$ if $\bra{\Psi^-}M\ket{\Psi^-}>\half$.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Two separated observers, by applying local operations to a supply of not-too-impure entangled states ({\em e.g.} singlets shared through a noisy channel), can prepare a smaller number of entangled pairs of arbitrarily high purity ({\em e.g.} near-perfect singlets). | contribution 0.52 | 0.52 | 0.47 | asserted 0.70 |
| s1 | These can then be used to faithfully teleport unknown quantum states from one observer to the other, thereby achieving faithful transfrom one observer to the other, thereby achieving faithful transmission of quantum information through a noisy channel. | interpretation 0.75 | 0.37 | 0.45 | asserted 0.94 |
| s2 | We give upper and lower bounds on the yield $D(M)$ of pure singlets ($\ket{\Psi^-}$) distillable from mixed states $M$, showing $D(M)>0$ if $\bra{\Psi^-}M\ket{\Psi^-}>\half$. | result 0.92 | 0.93 | 0.41 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
Figures
Figures reproduced from arXiv:quant-ph/9511027 by the authors.
References
How later papers used it
384 later papers cite it
11 later papers by other authors are listed below: 10 used its method or tool and 1 compared its own results with it.
Uses its method or tool 10 of 34 papers with this label
-
Used the BBPSSW scheme from this paper as the base for entanglement distillation.
Efficient computation of the waiting time and fidelity in quantum repeater chains (2019) · 1.00 · paraphrased: the licence does not allow quoting
-
Had Alice and Bob undertake the breeding protocol from this paper to guess bit-flip errors in the (2i-1)th pair.
A Study of Channel Estimation and Postprocessing in Quantum Key Distribution Protocols (2009) · 0.99 · paraphrased: the licence does not allow quoting
-
A plethora of purification protocols exists, but in this work we will focus on one of the most simple non-trivial one, named the IBM (BBPSSW) [ref] recursive protocol, whose recursive expression reads: [equation] This recursive protocol increases the fidelity of an entanglement if and only if the input fidelity is above the value $0.5$ and stops purifying when fidelity reaches a value of $1.0$.
Purification Strategy Optimization for Entanglement Routing in Quantum Networks (2026) · Entanglement and Fidelity · 0.98
-
Demonstrated the use of an entanglement purification protocol from this paper to correct errors from amplitude damping of microwave photons.
Entanglement purification and protection in a superconducting quantum network (2022) · 0.98 · paraphrased: the licence does not allow quoting
-
Considered the distillation scheme introduced in this paper, recalled in an appendix.
Entanglement distribution in two-dimensional square grid network (2023) · 0.98 · paraphrased: the licence does not allow quoting
-
In this work, the entanglement distillation protocol we consider is the BBPSSW protocol introduced in Ref. [ref] .
Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies (2024) · Entanglement distillation with the BBPSSW protocol · 0.98
-
Said that the error leaving the qubits in the state |11><11| is efficiently detected by the purification scheme described in this paper.
Long-distance entanglement distribution using individual atoms in optical cavities (2015) · 0.96 · paraphrased: the licence does not allow quoting
-
With the purification on noisy measurements, Alice and Bob apply the entanglement distillation protocol in Ref. [ref] .
Protocol for Purifying Noisy Preparation and Measurements of Qubits (2025) · Distilling Entanglement with Noisy SPAM · 0.94
-
Used the BBPSSW protocol from this paper, which it adapted by bringing the output state back into Werner form.
Efficient optimization of cut-offs in quantum repeater chains (2020) · 0.94 · paraphrased: the licence does not allow quoting
-
Additionally, Pauli twirling [ref] of the entangling CZ gates is implemented with 500 randomizations, and 100 measurements per randomization.
Observation of hadron scattering in a lattice gauge theory on a quantum computer (2025) · Methods · 0.93
Compares with it 1 of 14 papers with this label
-
Showed the performance of the asymptotic protocols of this paper and its own protocol on the same states when preceded by an optimal number of iterations of this recurrence protocol.
Heuristic Lookahead Distillation Protocol Search (2026) · 0.95 · paraphrased: the licence does not allow quoting
How the literature uses it
44 arXiv papers cite this in 59 sentences
Papers citing it · 22 sentences without a confident label
Uses its method or tool 1 paper
-
* Then, Alice and Bob undertake the breeding protocol [ref] to guess bit-flip errors in the $(2i-1)$th pair for all $i$.
A Study of Channel Estimation and Postprocessing in Quantum Key Distribution Protocols · Relation to Entanglement Distillation Protocol · 0.99
Cites it as background 28 papers
-
There is currently no simple formula for computing the two-way distillable entanglement of a bipartite state $ψ^AB$, which has been studied extensively by Bennett et al. and others in [ref] .
Assisted Entanglement Distillation · Introduction · 0.98
-
In this chapter, we focus on two different information-processing tasks relevant for bipartite quantum interactions, the first being entanglement distillation [ref] and the second secret key agreement [ref] .
Bipartite Quantum Interactions: Entangling and Information Processing Abilities · Entropy of Entanglement · 0.93
-
The pioneering works of quantum information theory sought to quantify entanglement [ref] , and provide conditions for transformations between entangled states using only Local Operations and Classical Communication (LOCC) in the limit of sharing many copies of the same state.
Entanglement fluctuation theorems · Introduction · 0.99
Discussion
Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.