Metraipolis › archive › dc_98bb72a56ba1

Optimal Entanglement Routing in Quantum Repeater Chains: Beyond Fixed Operation Order and Purification Schedule — arXiv:2609.37206

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37206
License (as archived)
CC0-1.0
Archived
2026-10-07T17:59:43.843Z
SHA-256 of the archived text
51d16a9fbc483c16cd12338bee7ff9d371d448a1dc104b9da1718368b4c24667
Stable URL of this page
https://metraipolis.com/documento/dc_98bb72a56ba1

How to cite

Optimal Entanglement Routing in Quantum Repeater Chains: Beyond Fixed Operation Order and Purification Schedule — arXiv:2609.37206 — arXiv (en), https://arxiv.org/abs/2609.37206 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_98bb72a56ba1 (Metraipolis archive dc_98bb72a56ba1, sha256 51d16a9fbc483c16cd12338bee7ff9d371d448a1dc104b9da1718368b4c24667)
BibTeX
@misc{dc98bb72a56ba1,
  title = {Optimal Entanglement Routing in Quantum Repeater Chains: Beyond Fixed Operation Order and Purification Schedule — arXiv:2609.37206},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37206},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_98bb72a56ba1; sha256 51d16a9fbc483c16cd12338bee7ff9d371d448a1dc104b9da1718368b4c24667},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37206. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-30 in cs.NI).
Categorie arXiv: Quantum Physics (quant-ph) ; Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2609.37206 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T17:33:10.193Z dalla pagina https://arxiv.org/catchup/cs.NI/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).