arXiv:2609.19561
A Bi-Objective Routing Framework for Hybrid Terrestrial-Satellite Quantum Networks
Yashpreet Khambay, Nitish K. Panigrahy
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.
AI Summary
The paper addresses routing entanglement through hybrid fiber–satellite networks when end-to-end entanglement generation rate (EGR) and fidelity favor different paths. Rather than selecting one route immediately, it computes a Pareto frontier for each source–destination pair and network snapshot, then selects a route using application-specific utility or a weighted distance from the ideal rate–fidelity point. The model takes path EGR to be the bottleneck link rate, $R_p=\min_{e\in p}R_e$, and represents link states as Werner states whose parameters multiply under swapping. Transforming these parameters into nonnegative costs, $C_e=-\log W_e$, gives a MAXMIN–MINSUM bicriterion path problem. Applying an existing algorithm, repeated shortest-path searches followed by removal of edges at or below the selected bottleneck rate enumerate the frontier in at most $|E|$ iterations, with stated complexity $O(|E|(|E|+|V|)\log|V|)$. Simulations use 1,000 terrestrial end nodes, 10 optical ground stations, and orbital data for 3,980 satellites, evaluating 100 user pairs over 24 hours at 10-second intervals. Satellite links increase routing choices: a representative medium-distance pair often has more than ten Pareto points, versus usually one terrestrially; a long-distance pair usually has one or two. Application-aware selection yields higher aggregate utility than the tested single-route baselines for a workload mixing secret-key, negativity, and distillable-entanglement utilities. The results assume perfect memories, deterministic swapping, Werner-state approximations, and fixed conditions within each snapshot. Satellite links use dual downlinks without inter-satellite connections and are activated by a separate greedy scheduler.
Error found: The frontier algorithm as described can output dominated paths when minimum-cost paths tie, so its claimed minimal complete Pareto set requires an unspecified tie-breaking or filtering step. The end-to-end fidelity formula in the path-metrics section is incorrect and gives fidelity 1.5 for perfect links, although the transformation section uses the correct formula.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.