arXiv:2609.37206
Optimal Entanglement Routing in Quantum Repeater Chains: Beyond Fixed Operation Order and Purification Schedule
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.
AI Summary
The paper studies how purification schedules and the ordering of purification and swapping affect expected end-to-end entanglement throughput on finite-capacity repeater chains, subject to a fidelity threshold. It compares pumping with general binary-tree BBPSSW purification schedules, under Werner-state and single-Pauli-error noise models. A mixed-integer linear program optimizes per-link schedules under purify-then-swap (PtS), using logarithmic Bell parameters to linearize fidelity composition. A Pareto-frontier dynamic program permits interleaved swapping and virtual-link self-purification; a greedy heuristic provides a lower-cost alternative. Optimality is proved relative to the specified operation set and supplied schedule choices. For Werner states, pumping converges to a fidelity $F_e^*<1$, giving the capacity-independent PtS ceiling $F_{\mathrm{e2e}}\leq\tfrac14+\tfrac34\prod_e(4F_e^*-1)/3$. Balanced purification instead approaches unit fidelity, yielding capacity-dependent limits. Under single-Pauli-error noise, tree shape does not affect fidelity or cumulative success probability at fixed raw-pair cost. Simulations, generally using 200 instances per point on two- to six-link chains, find that tree schedules serve over 90% of pumping-infeasible requests at moderate thresholds. Tree-based PtS and interleaved optimization serve identical instance sets throughout the reported sweeps; interleaving provides up to approximately 10% higher median throughput on longer chains. Many additional feasible requests have very low throughput. The model assumes identical replicated schedules, virtual-link self-purification, fixed generation/operation cycles, and negligible operation-phase decoherence. Tree frontiers use a $10^{-3}$ fidelity grid, so computational exactness is relative to those choices. General topologies, heterogeneous pair pools, and other distillation protocols are excluded; dynamic-program memory requirements limit scaling.
Central claim may not hold: The abstract's claim that free operation order can only improve feasibility is contradicted by the paper's own throughput improvements on already-feasible instances. Showing that adding post-swap purification reduces throughput for fixed inputs does not show that optimizing operation order cannot improve throughput under a fidelity constraint. The DP's arbitrary-order exactness is restricted to identical-copy virtual-link purification and excludes purification between distinct routing configurations. The implemented tree-schedule optimization uses an approximate discretized frontier, so its exactness is relative to that choice set rather than the full tree family. The stated baseline-fidelity formula maps physical source fidelities above one and then to 0.999 after clipping, inconsistent with the reported heterogeneous simulation inputs.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 21 pages, 9 figures