Integrating Entanglement Purification into All-Photonic Quantum Repeaters
Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter
TL;DR
This work tackles the challenge of incorporating entanglement purification into all-photonic repeater networks based on repeater graph states (RGS). By introducing optimistic purification implemented directly on half-RGS primitives and delaying the join of half-RGSs, the authors enable flexible purification scheduling along the connection path with modest overhead, while keeping end-to-end latency dominated by transmission time $L_{\text{total}}/c$. The key contributions include a purification-enhanced RGS framework, detailed overhead analysis comparing raw, end-node purification, and optimistic schemes, and a numerical study showing fidelities above $0.9$ and order-of-magnitude rate improvements ($\sim 45$–$65\times$) over baselines. This approach brings memory-based purification scheduling concepts into all-photonic implementations, potentially enabling near-deterministic high-fidelity entanglement across long distances with reduced memory requirements at end nodes. The work also provides open-source code for reproducing the numerical results and highlights avenues for further optimization and network-level validation.
Abstract
We propose a purification-enhanced all-photonic quantum repeater scheme based on repeater graph states (RGS) framework that leverages the recently proposed half-RGS building block. This framework addresses a longstanding open question--how to naturally integrate entanglement purification with an all-photonic scheme--by enabling long-distance purification without disrupting the core design. Our framework utilizes optimistic purification performed directly on the half-RGS primitives across long distances without waiting for heralding outcomes. The overhead is modest: the RGS generation slows down proportionally with the number of purification rounds, and each round requires only one additional quantum emitter per half-RGS source. However, since the generation time is negligible compared to the end-to-end communication delay, the total latency remains effectively dominated by communication time, similar to frameworks without purification. Our framework enables flexible purification scheduling along the connection path, making it compatible with memory-based strategies, a rich body of research on purification scheduling and optimization that was previously thought inapplicable to the RGS scheme. Through numerical evaluation, we compare the performance of our framework with purification between memories at end nodes.
