Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

A Bi-Objective Routing Framework for Hybrid Terrestrial-Satellite Quantum Networks

Abstract

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.

Related

  1. Quantum Approximate Multi-Objective Optimization in Routing Problems
    Eduardo Willwock Lussi, Alisson dos Passos Fumaco, Marcos Vinicius Reballo +3
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
    Zachary Goisman, Matthew L. Stevens, Maxwell Goisman +7
    Optics ExpressPeer-reviewedPublisher termsFull textOptics & photonicsCrossref
  3. Quantum utility routing in continuous-variable QKD networks with trusted and untrusted relays
    Farsad Ahmad, Aeysha Khalique
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
    Zachary Goisman, Matthew L. Stevens, Maxwell Goisman +7
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  5. One-shot Routing in Quantum Networks
    Nadav Lavi, Nir Gutman, Ido Kaminer +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{khambay2026biobjective,
  title = {{A Bi-Objective Routing Framework for Hybrid Terrestrial-Satellite Quantum Networks}},
  author = {Yashpreet Khambay and Nitish K. Panigrahy},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.19561},
  eprint = {2609.19561},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.19561},
}
RIS
TY  - UNPB
TI  - A Bi-Objective Routing Framework for Hybrid Terrestrial-Satellite Quantum Networks
AU  - Yashpreet Khambay
AU  - Nitish K. Panigrahy
PY  - 2026
DA  - 2026/09/17
PB  - arXiv
DO  - 10.48550/arxiv.2609.19561
UR  - https://arxiv.org/abs/2609.19561
AB  - 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.
ER  -