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.
It is proved that any optimal backbone configuration must correspond to a capacity-maximizing Voronoi tessellation of the network region, and this can be efficiently approximated by a centroidal Voronoi tessellation via Lloyd's algorithm, with backbone nodes connected according to a Delaunay triangulation.
A. Fletcher, Ignazio Pedone, S. Pirandola· 0 citations
Efficient end-to-end entanglement distribution in quantum information networks requires routing under limited resources and fidelity constraints. We study entanglement routing as a fidelity-constrained unsplittable multicommodity flow problem that maximizes the number of admitted requests. As a proof of concept, we int...
M. Naghmouchi, Quentin Ma, Agathe Blaise et al.· 0 citations
It is proved that for certain utility functions (including the secret key rate of BB84), the method is a fully polynomial time approximation scheme, returning a near-optimal path within a specified tolerance.
Leonardo Bacciottini, S. Maji, Don Towsley et al.· 0 citations
Fidelity-Optimizing Local Detours (FOLD) is introduced, a heuristic that starts from the highest-fidelity path and merges a detour only when distillation improves on both routes and raises end-to-end fidelity, and achieves the highest mean end-to-end fidelity among the polynomial baselines.
Nadav Lavi, Nir Gutman, I. Kaminer et al.· 0 citations
We address the design of global quantum internet topologies that jointly optimise four physical objectives: average end-to-end Werner-state fidelity, entanglement rate, latency and coverage, evaluated with an analytical BDCZ oracle whose path selection is exact under the stated Werner-composition model and whose satell...
Jesús Gil Ruiz, Diego Rubén Rodríguez Regadera, Rafael Muñoz Gil· Entropy· 0 citations
This framework provides a direct route from exact network resource laws to the design and comparison of passive entanglement architectures under experimentally specified hardware constraints.
Ekta Panwar, Gilberto Borges, Saeide Salari et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.