Metraipolis › archive › dc_a9fa1ed56cb3
A Bi-Objective Routing Framework for Hybrid Terrestrial-Satellite Quantum Networks — arXiv:2609.19561
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19561
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T03:53:35.203Z
- SHA-256 of the archived text
d884e0241c96b80f399857accd9bbd4c0175017dd9169c78d2e387182e1f04a3- Stable URL of this page
https://metraipolis.com/documento/dc_a9fa1ed56cb3
How to cite
A Bi-Objective Routing Framework for Hybrid Terrestrial-Satellite Quantum Networks — arXiv:2609.19561 — arXiv (en), https://arxiv.org/abs/2609.19561 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a9fa1ed56cb3 (Metraipolis archive dc_a9fa1ed56cb3, sha256 d884e0241c96b80f399857accd9bbd4c0175017dd9169c78d2e387182e1f04a3)
BibTeX
@misc{dca9fa1ed56cb3,
title = {A Bi-Objective Routing Framework for Hybrid Terrestrial-Satellite Quantum Networks — arXiv:2609.19561},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19561},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a9fa1ed56cb3; sha256 d884e0241c96b80f399857accd9bbd4c0175017dd9169c78d2e387182e1f04a3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19561. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Hybrid terrestrial-satellite quantum networks combine terrestrial fiber infrastructure with free-space links to enable long-distance entanglement distribution. Entanglement can be routed over different combinations of terrestrial and satellite links, resulting in paths with different entanglement generation rates (EGRs) and fidelities. Existing routing algorithms, however, typically reduce routing to a single-objective problem by optimizing either EGR or fidelity, or by optimizing one while constraining the other, and thus do not explicitly capture the trade-off between the two. In this paper, we present a bi-objective routing framework for hybrid quantum networks that jointly optimizes end-to-end EGR and fidelity. We formulate routing as a Pareto optimization problem and show that it possesses a special mathematical structure: the bottleneck nature of end-to-end EGR and the multiplicative nature of end-to-end fidelity allow the problem to be transformed into a MAXMIN-MINSUM bi-criterion path problem. This transformation enables the exact polynomial-time computation of a minimal complete Pareto set using Martins' bicriterion routing algorithm. Our results demonstrate that hybrid networks expose substantially richer Pareto frontiers than terrestrial-only networks and that the proposed framework outperforms representative single-objective routing policies by allowing applications to select paths based on their EGR and fidelity requirements. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-18 in cs.PF). Categorie arXiv: Quantum Physics (quant-ph) ; Networking and Internet Architecture (cs.NI); Performance (cs.PF). Pagina del lavoro: https://arxiv.org/abs/2609.19561 — 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-10T03:24:50.234Z dalla pagina https://arxiv.org/catchup/cs.PF/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).