Capacity-Achieving Entanglement Purification Protocol for Pauli Dephasing Channel
Ozlem Erkilic, Matthew S. Winnel, Aritra Das, Sebastian Kish, Ping Koy Lam, Jie Zhao, Syed M. Assad

TL;DR
This paper introduces a scalable two-way entanglement purification protocol that asymptotically reaches the capacity of the Pauli dephasing channel, significantly improving the fidelity of Bell states for quantum communication.
Contribution
It presents the first explicit, scalable two-way purification protocol that asymptotically achieves the dephasing channel capacity, with residual errors suppressed doubly-exponentially.
Findings
Fidelity of Bell states increases with each purification round
Residual dephasing error scales as (p^{2^{n}})
Protocol is practical and applicable to multiple Bell pairs
Abstract
Quantum communication enables secure information transmission and entanglement distribution, but these tasks are fundamentally limited by the capacities of quantum channels. While quantum repeaters can mitigate losses and noise, entanglement swapping via a central node is ineffective against the Pauli dephasing channel due to degradation from Bell-state measurements. This suggests that purifying distributed Bell states before entanglement swapping is necessary. Although one-way hashing codes are known to saturate the dephasing channel capacity, no explicit two-way purification protocol has previously been shown to achieve this bound. In this work, we present a two-way entanglement purification protocol with an explicit, scalable circuit that asymptotically achieves the dephasing channel capacity. With each iteration, the fidelity of Bell states increases. At the final round, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum optics and atomic interactions
