# Entanglement Routing in Quantum Networks: A Comprehensive Survey

arXiv: https://arxiv.org/abs/2408.01234 · HTML: https://mlsanity.com/paper/2408.01234/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Aug 2024.

## Built on by (most cited first, 3 of 3)

- [11Plus-Bench: Demystifying Multimodal LLM Spatial Reasoning with Cognitive-Inspired Analysis](https://mlsanity.com/paper/2508.20068/) (2025)
- [Intelligence-Guided Adaptive Purification for DDoS-Resilient Quantum Networks: A CUDA-Q based Study](https://mlsanity.com/paper/2607.16276/) (2026)
- [Riemannian Optimization for Multi-Player Quantum Games on Product Unitary Manifolds](https://mlsanity.com/paper/2609.07397/) (2026)

## Abstract (arXiv)

Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the short lifetime of entangled states. In this work, we formulate a practical entanglement routing problem and analyze and categorize the main approaches to address it, drawing comparisons to, and inspiration from, classical network routing strategies where applicable. We classify and discuss the studied quantum routing schemes into reactive, proactive, opportunistic, and virtual routing