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

arXiv:2609.37206 · quant-ph, cs.NI · Submitted 2026-09-29 · Read on arXiv

quant-ph, cs.NI

Submitted: 2026-09-29

Updated: 2026-09-29

Terminology

• Fidelity — 132× in this paper · explained in 2 episodes
• Entanglement — 79× in this paper · explained in 3 episodes
• Dynamic Programming — 6× in this paper
• Abstraction — 1× in this paper · explained in 1 episode
• Benchmarking — 1× in this paper · explained in 3 episodes
• Distillation — 1× in this paper · explained in 2 episodes
• Mixed-Integer Linear Program — 1× in this paper
• Mixed-Integer Linear Program (MILP) — 1× in this paper · explained in 2 episodes
• Model-Agnostic — 1× in this paper · explained in 2 episodes
• Physical Constraints — 1× in this paper · explained in 7 episodes
• Post-Selection — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• Joint Optimization of Routing and Purification to Meet Fidelity Targets in Quantum Networks
• On Utility-optimal Entanglement Routing in Quantum Networks
• Purification Strategy Optimization for Entanglement Routing in Quantum Networks

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity