Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths
Abstract
A path in a quantum network is a chain of repeaters that distributes entanglement between two users. Selecting a path requires balancing the rate and quality (e.g., fidelity) of the delivered entanglement, but these quantities, unlike standard routing metrics, compose non-additively. The problem is compounded by link-level configuration choices (e.g., distillation rounds or emitter brightness tuning), each trading rate against fidelity, so that a path's performance depends jointly on its route and its per-link settings. We cast this joint path selection and configuration problem as a shortest path computation on a layered graph whose layers track discretized end-to-end fidelity. A single run returns the full rate fidelity Pareto frontier, from which the path maximizing any nondecreasing utility function of rate and fidelity can be selected. We prove 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. We further characterize exactly when cheaper scalarization-based routing suffices: it is optimal for utility functions with convex fidelity profiles, but can be arbitrarily suboptimal otherwise (e.g., for step-like, sigmoidal utilities), whereas the layered method remains reliable in all cases.
Related
- Query-Efficient Quantum Multi-Objective Optimization for Materials Configuration Search via Bayesian Weight Selection
- Turning Quantum Compiler Configuration Selection Upside Down: A Top-Down Paradigm
- Quantum utility routing in continuous-variable QKD networks with trusted and untrusted relays
- Practical wavelength selection for quantum-augmented networks over shared optical fiber
- Database-driven capability maps for Pareto-based configuration selection in tendon-driven continuum robots
BibTeX
@misc{bacciottini2026utilitybased,
title = {{Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths}},
author = {Leonardo Bacciottini and Subhransu Maji and Don Towsley and Gayane Vardoyan},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.16198},
eprint = {2609.16198},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.16198},
}
RIS
TY - UNPB
TI - Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths
AU - Leonardo Bacciottini
AU - Subhransu Maji
AU - Don Towsley
AU - Gayane Vardoyan
PY - 2026
DA - 2026/09/14
PB - arXiv
DO - 10.48550/arxiv.2609.16198
UR - https://arxiv.org/abs/2609.16198
AB - A path in a quantum network is a chain of repeaters that distributes entanglement between two users. Selecting a path requires balancing the rate and quality (e.g., fidelity) of the delivered entanglement, but these quantities, unlike standard routing metrics, compose non-additively. The problem is compounded by link-level configuration choices (e.g., distillation rounds or emitter brightness tuning), each trading rate against fidelity, so that a path's performance depends jointly on its route and its per-link settings. We cast this joint path selection and configuration problem as a shortest path computation on a layered graph whose layers track discretized end-to-end fidelity. A single run returns the full rate fidelity Pareto frontier, from which the path maximizing any nondecreasing utility function of rate and fidelity can be selected. We prove 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. We further characterize exactly when cheaper scalarization-based routing suffices: it is optimal for utility functions with convex fidelity profiles, but can be arbitrarily suboptimal otherwise (e.g., for step-like, sigmoidal utilities), whereas the layered method remains reliable in all cases.
ER -