Priority-Aware Routing for Quantum Networks:Integrating Coherence-Time Constraints into Scheduling

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

cs.NI, quant-ph

Submitted: 2026-09-29

Updated: 2026-09-29

Terminology

• Fidelity — 72× in this paper · explained in 2 episodes
• Entanglement — 13× in this paper · explained in 4 episodes
• Core — 4× in this paper · explained in 2 episodes
• Robustness — 4× in this paper · explained in 5 episodes
• Decoupling — 3× in this paper · explained in 2 episodes
• Generalization — 3× in this paper · explained in 13 episodes
• Abstraction — 2× in this paper · explained in 1 episode
• Lindblad master equation — 2× in this paper · explained in 2 episodes
• Reinforcement Learning — 2× in this paper · explained in 4 episodes
• Weighted Fair Queueing — 2× in this paper
• Accuracy — 1× in this paper · explained in 1 episode
• Adaptation — 1× in this paper · explained in 1 episode
• Adaptive Selection — 1× in this paper · explained in 1 episode
• Classical Quality of Service — 1× in this paper
• Lindblad Dynamics — 1× in this paper · explained in 2 episodes
• Virtual Output Queue — 1× in this paper

Sources

• Shortcuts to quantum network routing
• Distributed Routing in a Quantum Internet
• RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks

Related papers

• HiFiNet: Hierarchical Fault Identification in Wireless Sensor Networks via Edge-Based Classification and Graph Aggregation
• Embodied AI in 6G Networks: From Intelligent Connectivity to Physical Intelligence
• Lightweight GenAI for Network Traffic Generation: Fidelity, Augmentation, and Classification
• EdgePoW: Adaptive Ingress-Aware Defense with Non-Interactive PoW Against Volumetric SYN Floods
• SoK: Where Do Flow Labels Come From? Auditing Label Provenance in Encrypted Traffic Benchmarks
• What is Normal? A Big Data Observational Science Model of Anonymized Internet Traffic