Entanglement Swapping & Quantum Repeaters
Building a quantum internet across long distances.
Fiber loses photons exponentially: across 1000 km, even a 10 GHz single-photon source would deliver roughly one photon every 300 years, and no-cloning forbids amplifying them along the way. The fix is to teleport entanglement itself: swap short links into long ones, purify away the errors, and park the halves in quantum memories while you wait.
What you’ll learn
- Quantify the repeaterless limit: fiber transmittance and the PLOB bound .
- Derive entanglement swapping and its action on Werner states, .
- Show how quantum memories turn a rate into one with a single intermediate station, and how nesting extends this.
- Compare repeater architectures: BDCZ nested purification, DLCZ atomic ensembles, and error-corrected generations.
- Relate end-to-end fidelity to the thresholds of applications: entanglement, CHSH violation and QKD.
The loss wall
Standard telecom fiber attenuates light by about dB/km at 1550 nm, so a photon survives a length with probability
Classical networks beat loss with amplifiers. Quantum signals cannot be amplified noiselessly: a perfect amplifier would be a cloner, and phase-insensitive linear amplifiers must add noise (Caves 1982).
Think first A 10 GHz single-photon source feeds 500 km of 0.2 dB/km fiber, with perfect detectors. How many photons arrive per second? What about 1000 km?
500 km means 100 dB of loss, : about one photon per second. At 1000 km the loss is 200 dB and : one photon every s, roughly once every 300 years.
So every point-to-point link scales linearly in , that is, exponentially in distance. Beating this requires intermediate quantum nodes. For key distribution specifically, twin-field QKD (Lucamarini, Yuan, Dynes & Shields 2018) already reaches scaling with a single untrusted middle station that merely interferes weak pulses.
Entanglement swapping
Split the distance in two. Node A shares a Bell pair with a middle node C (qubits 1 and 2), and C shares another with node B (qubits 3 and 4). Now teleport C's qubit 2 to B through the second pair:
Expand the first pair.
Apply the teleportation identity , then recombine the sum over .
A Bell measurement at C projects qubits 1 and 4, which never interacted, onto the same Bell state. C announces and B corrects to .
Noise compounds; purification fights back
Model each elementary link as a Werner state. Any two-qubit state can be twirled into this form by random bilateral rotations, without changing .
A Werner state is with one half sent through a depolarizing channel.
Swapping teleports one half of the first link through the second. Teleportation through acts as , and . (A perfect Bell measurement and Pauli correction are assumed.)
With equal links the end-to-end parameter is : it decays exponentially and . Swapping alone cannot cover long distances.
Two Werner links, each with fidelity , are swapped with a perfect Bell measurement. What is the fidelity of the resulting long link?
Show the answer
0.813
. Equivalently , and gives . Each swap multiplies the Werner parameters, so the noise compounds.
Entanglement purification (Bennett, Brassard, Popescu, Schumacher, Smolin & Wootters 1996; Deutsch et al. 1996) uses local operations and two-way classical communication to turn noisy pairs into fewer, better ones. In the recurrence protocol both parties apply CNOTs between two pairs and measure the target pair, keeping the source pair only if their outcomes agree. For Werner inputs of fidelity :
Nested purification (Briegel, Dür, Cirac & Zoller 1998): split the channel into segments; generate and purify elementary pairs; swap neighbors to double the distance; purify again; repeat times. If local operations err below a threshold at the percent level, the final fidelity can be held fixed while the resources grow only polynomially with distance. With "entanglement pumping", purifying one pair repeatedly with fresh elementary pairs, each node needs a number of memory qubits that grows only logarithmically with distance.
Memories and repeater architectures
Why do repeaters need memories? Put one station at the midpoint. Each half-link of length is heralded with probability per attempt (times detector and coupling efficiencies). Without memories, both halves must succeed in the same attempt, with probability : no better than direct transmission. With memories, a successful half simply waits for the other.
Count the attempts until each half succeeds; the maximum is the sum minus the minimum.
The minimum of two independent geometric variables is geometric with success probability .
Rate per attempt, assuming a deterministic swap. The square root is the whole game. With segments the elementary success probability becomes , at the price of waiting-time and swap-failure factors that grow only polynomially with the number of segments.
A single midpoint station heralds entanglement in both halves of the link, but has no quantum memories: a pair is distributed only if both halves succeed in the same attempt. How does the end-to-end rate scale with the total transmittance ?
- As : no better than direct transmission
- As
- As
- Independently of
Show the answer
A. As : no better than direct transmission
Each half succeeds with probability , and both must succeed simultaneously: . Memories turn simultaneous success into asynchronous success, which is what gives .
| Generation | Loss handled by | Operation errors handled by | Rate limited by | Examples |
|---|---|---|---|---|
| 1st | Heralded entanglement generation | Heralded purification (two-way communication) | Classical signalling over ever longer distances | BDCZ 1998; DLCZ 2001 |
| 2nd | Heralded entanglement generation | Quantum error correction (one-way) | Heralding time of one link, | Jiang et al. 2009; Munro et al. 2010 |
| 3rd | Quantum error correction (loss-tolerant codes) | Quantum error correction | Local operation time | Munro et al. 2012; Muralidharan et al. 2014 |
Fidelity thresholds and the frontier
| Application | Werner condition | Fidelity needed |
|---|---|---|
| Entangled (and hence distillable) | ||
| Teleportation beats the classical | ||
| Violates the CHSH inequality | ||
| BB84-type key with one-way post-processing (Shor–Preskill: ) |
Think first Elementary links have and there is no purification. How many links can be chained by swapping before the end-to-end pair stops violating CHSH?
, and links give . CHSH violation needs , i.e. : at most 25 links (24 swaps). Even excellent links run out after a few dozen hops, which is why long chains need purification or error correction.
Key takeaways
- Direct transmission is capped at (PLOB): exponentially small in distance. Only intermediate quantum nodes beat it.
- Swapping: . For Werner links the parameters multiply, , so purification is unavoidable.
- Memories turn simultaneous success () into asynchronous success ( per middle station); nested swapping and purification give polynomial overhead (BDCZ).
- Architectures trade two-way heralding and purification for quantum error correction (three generations); DLCZ showed how far ensembles and linear optics can go.
- Applications set fidelity thresholds: for entanglement, for CHSH, for one-way BB84-type keys.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
At node C, a Bell measurement on qubits 2 and 3 of returns . What state do qubits 1 and 4 now share?
- A product state
Show the answer
C.
From , the outcome leaves qubits 1 and 4 in . A Pauli correction at B then turns it into .
Two Werner links with and are swapped with a perfect Bell measurement. What is the Werner parameter of the result?
Show the answer
B.
Swapping composes the two depolarizing channels, and : , so .
For a pure-loss channel with transmissivity , the PLOB bound on secret-key bits per channel use is about:
- , that is,
Show the answer
A.
. Beating this linear scaling requires intermediate quantum nodes; -type scaling is what a single middle station with memories (or twin-field QKD) can reach.
What distinguishes third-generation quantum repeaters?
- They use satellites instead of fiber
- They need no entanglement at all
- They amplify the quantum signal at each station
- They correct both loss and operation errors with quantum error correction, so only one-way classical communication is needed
Show the answer
D. They correct both loss and operation errors with quantum error correction, so only one-way classical communication is needed
Encoding qubits in loss-tolerant codes and correcting at every station removes the heralding round trips; the rate is then limited by local operation speed, at the price of very low loss per hop and high-fidelity local gates.
Further reading
- M. Żukowski, A. Zeilinger, M. A. Horne & A. K. Ekert, "'Event-ready-detectors' Bell experiment via entanglement swapping", Physical Review Letters 71, 4287 (1993).
- H.-J. Briegel, W. Dür, J. I. Cirac & P. Zoller, "Quantum repeaters: The role of imperfect local operations in quantum communication", Physical Review Letters 81, 5932 (1998).
- L.-M. Duan, M. D. Lukin, J. I. Cirac & P. Zoller, "Long-distance quantum communication with atomic ensembles and linear optics", Nature 414, 413 (2001).
- N. Sangouard, C. Simon, H. de Riedmatten & N. Gisin, "Quantum repeaters based on atomic ensembles and linear optics", Reviews of Modern Physics 83, 33 (2011).
- S. Pirandola, R. Laurenza, C. Ottaviani & L. Banchi, "Fundamental limits of repeaterless quantum communications", Nature Communications 8, 15043 (2017).