Carrier-Assisted Entanglement Purification

Entanglement distillation, a fundamental building block of quantum networks, enables the purification of noisy entangled states shared among distant nodes by local operations and classical communication. Its practical realization presents several technical challenges, including the storage of quantum states in quantum memory and the execution of coherent quantum operations on multiple copies of states within the quantum memory. In this work, we present an entanglement purification protocol via quantum communication, namely a carrier-assisted entanglement purification protocol, which utilizes two elements only: i) quantum memory for a single-copy entangled state shared by parties and ii) single qubits travelling between parties. We show that the protocol, when single-qubit transmission is noiseless, can purify a noisy entangled state shared by parties. When single-qubit transmission is noisy, the purification relies on types of noisy qubit channels; we characterize Pauli channels such that the protocol works for the purification. We address this limitation by using multiple carrier qubits, and show that for any depolarizing channel with channel fidelity greater than 1/2, the protocol’s fixed-point fidelity approaches unity as the number of carrier increases. Our results significantly reduce the experimental overhead needed for distilling entanglement, such as quantum memory and coherent operations, making long-distance pure entanglement closer to a practical realization.

💡 Research Summary

The paper introduces a novel entanglement purification protocol that relies on only two quantum resources: a single copy of an entangled pair stored in quantum memories at the two parties, and a single‑qubit carrier that travels between them. This “carrier‑assisted entanglement purification protocol” (CAEPP) dramatically reduces the experimental overhead compared with conventional two‑way entanglement purification (TWEPP) and entanglement pumping (EP) schemes, which typically require multiple copies of entangled pairs, large‑capacity quantum memories, and many coherent two‑qubit gates.

Protocol Overview

1. Alice and Bob each store one qubit of a Bell‑diagonal state ρ = Σ qᵢⱼ |Bellᵢⱼ⟩⟨Bellᵢⱼ| in their memories.
2. Alice prepares an ancillary carrier qubit in |0⟩, applies a CNOT with the carrier as target, and sends the carrier through a quantum channel N to Bob.
3. Bob receives the carrier, applies a CNOT (carrier as target again), measures the carrier in the Z basis, and announces the outcome. If the outcome is 0, the round is declared “Success” and the shared pair is kept; otherwise it is discarded.

The CNOT entangles the carrier with the stored pair such that even‑parity Bell states (ϕ⁺, ϕ⁻) produce a 0 outcome, while odd‑parity states (ψ⁺, ψ⁻) produce a 1 outcome. Thus the protocol filters out the odd‑parity components without ever needing a second copy of the entangled pair.

Noiseless Carrier Transmission
When the carrier channel is ideal (N = id), a single round eliminates the ψ‑type components, leaving a mixture of ϕ⁺ and ϕ⁻. A second round, preceded by a simple local rotation that makes ϕ⁻ the least likely component, removes the remaining ϕ⁻, yielding a pure ϕ⁺ state (fidelity = 1). Hence two successful rounds are sufficient to distill a perfect ebit from any initial Bell‑diagonal state with fidelity > ½.

Noisy Carrier – Pauli Channel Analysis
Realistic implementations involve noise on the carrier. The authors model the carrier channel as a Pauli channel N(p₀₀, p₀₁, p₁₀, p₁₁). A pre‑processing step applies local rotations Rₓ(±π/2) to permute the error probabilities so that the Z‑error probability becomes the smallest. After encoding (Alice’s rotation) and decoding (Bob’s rotation), X‑ and Y‑errors are swapped, allowing the CNOT‑based parity check to detect and discard them. The remaining Z‑errors are reduced in the next pre‑processing round.

Mathematically, the update of the Bell‑diagonal coefficients q → q′ is linear: q′ = (1/Pₛᵤ𝚌𝚌) L q, where L is a 4×4 matrix built from the channel probabilities and Pₛᵤ𝚌𝚌 is the success probability. The fidelity increases iff q′₀₀ > q₀₀, which yields an explicit inequality involving both the state’s and the channel’s probabilities. This condition generalizes the BBPSSW/DEJMPS criteria and shows that purification is possible whenever the combined error rates satisfy the inequality.

Limitations of a Single Carrier
If the carrier channel is a depolarizing channel with fidelity f = p₀₀, a single carrier can only raise the fidelity up to a fixed point F* < 1 (e.g., f = 0.75 leads to F* ≈ 0.86). The protocol therefore saturates before achieving a perfect ebit.

Multi‑Carrier Extension (m‑CAEPP)
To overcome this limitation, the authors propose sending m independent carrier qubits in parallel (or sequentially without resetting the memory). Each carrier experiences the same Pauli channel, and the collective effect is equivalent to applying the channel m times. The effective transformation matrix becomes Lᵐ, and the success probability scales accordingly. Crucially, for any depolarizing channel with f > ½, the fixed‑point fidelity Fₘ approaches 1 exponentially fast as m increases. Thus, by increasing the number of carriers, one can arbitrarily approach perfect entanglement even with moderately noisy channels.

Experimental Resource Comparison

• Memory: Only two quantum memories are required, each storing a single qubit of the entangled pair. No need for large‑scale storage of many copies.
• Gate Count: Each round uses a single CNOT at Alice, a single CNOT at Bob, and two single‑qubit rotations. Multi‑carrier rounds repeat this pattern per carrier but do not require multi‑qubit gates across different carriers.
• Measurements: Only one measurement per carrier (on the carrier itself) is needed, reducing susceptibility to detector errors.

Compared with EP, which needs two measurements per round (one on the auxiliary pair, one on the carrier), CAEPP replaces the auxiliary measurement with state preparation, thereby improving robustness against measurement imperfections.

Generalization to Multipartite States
The authors sketch how the same parity‑filtering idea can be applied to stabilizer states such as GHZ. By encoding the carrier into appropriate stabilizer generators, one can filter out unwanted error syndromes while preserving the multipartite entanglement.

Impact and Outlook
CAEPP provides a practically feasible route to high‑fidelity entanglement distribution with minimal hardware: a pair of memories and a modest quantum communication link. The multi‑carrier variant shows that even relatively noisy channels (f > ½) can be leveraged to reach near‑perfect entanglement, a crucial requirement for long‑distance quantum repeaters and networked quantum computing. Future work may explore optimal encoding/decoding for non‑Pauli noise, experimental demonstrations in photonic or solid‑state platforms, and integration of CAEPP into larger network protocols such as entanglement swapping and quantum error correction.