Quantum entanglement routing improves fidelity and throughput in repeater chains
Optimal Entanglement Routing in Quantum Repeater Chains: Beyond Fixed Operation Order and Purification Schedule
Networking and Internet Architecture
Summary
Connecting distant quantum nodes needs special pairs called entangled pairs, which can be noisy and weak. Usually, scientists fix the order of two operations—making them better, then linking them—to build a long-distance connection. This paper shows that changing the order and using more flexible methods to improve those pairs can increase how many strong connections you get. They also found exact mathematical ways to plan this for the best results. Their tests show that better schedules for improving pairs matter more than changing operation order, especially under typical noise conditions.
What this means in practice
- •For quantum network engineers: Optimize entanglement routing in linear quantum repeater chains to increase the number of high-quality end-to-end connections under realistic noise conditions.
- •For telecommunication protocol developers: Design improved quantum communication protocols that flexibly schedule purification and swapping to extend feasible network lengths and throughput without hardware changes.
Authors
Aikaterini Mandilara, Antonia Tsili, Dimitris Syvridis, Konstantinos Christodoulopoulos
Abstract
Entanglement routing establishes entangled pairs between distant nodes of a quantum network by purifying and swapping pairs generated on elementary links. Existing methods typically restrict the decision space along two axes: the operation order, often fixed to purify-then-swap (PtS), and the purification schedule of each link, often restricted to pumping. Focusing on linear repeater chains with finite link capacities, we relax both restrictions and study the maximization of the expected end-to-end throughput subject to a fidelity threshold under two quantum-noise models. We develop a unified capacity-aware optimization framework comprising an exact mixed-integer linear program (MILP) under PtS, instantiated with either pumping or general tree purification schedules, and an exact dynamic program (DP) over arbitrary operation orders. Under symmetric Pauli noise, we prove that pumping converges to a fidelity strictly below unity, imposing a capacity-independent feasibility bound and a maximum chain length on every pumping-based PtS method, whereas general tree schedules yield a capacity-dependent bound. We further prove that post-swap purification never increases the throughput, so a free operation order can only increase feasibility. Numerical evaluations confirm the bounds: tree schedules serve over 90\% of the requests that pumping cannot at moderate fidelity thresholds; within the pumping class, a free operation order recovers much of this advantage; but once links use tree schedules, the tree-based MILP and the order-exact DP serve identical request sets throughout. Operation order and purification schedule are thus substitutes, with the purification schedule the dominant factor governing feasibility under symmetric Pauli noise.