Quantum utility routing in continuous-variable QKD networks with trusted and untrusted relays
Abstract
Continuous-variable quantum key distribution (CV-QKD) networks require routing strategies that account simultaneously for secret key generation, relay trust and finite network resources. We introduce Quantum Utility Routing (QUR), a weighted routing framework for networks combining trusted point-to-point links with untrusted CV Bell measurement relays. Transition level composable finite size secret key rates (SKRs) are incorporated directly into the route search, allowing QUR to balance bottleneck SKR against route geometry and resource use. We consider graph optimized QUR (QURgo) and a fixed weight implementation (QURfw) that uses machine learning to avoid repeated graph specific weight optimization, and benchmark both against A* and Max--Min routing. At the default network configuration, QURgo and QURfw improve the mean path SKR relative to A* while requiring substantially fewer network resources than Max--Min. The framework also maintains secure connectivity over a broad range of trusted node availability by exploiting untrusted infrastructure as measurement relays. These results demonstrate that routing in CV-QKD networks can be treated as a configurable trade off between cryptographic performance and network resource consumption.
Related
- Exponential advantage in continuous-variable quantum state learning
- Wavelength-shifting attack on a chip-based continuous-variable quantum key distribution system
- Coherent receiver for Continuous-Variable Quantum Key Distribution using a 3 × 3 beam splitter and single-ended photodetectors
- Distributed Inner Product Estimation of Continuous-Variable Quantum States
- Continuous variable quantum key distribution through a fading channel with minimal information leakage
BibTeX
@misc{ahmad2026quantum,
title = {{Quantum utility routing in continuous-variable QKD networks with trusted and untrusted relays}},
author = {Farsad Ahmad and Aeysha Khalique},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03382},
eprint = {2610.03382},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03382},
}
RIS
TY - UNPB
TI - Quantum utility routing in continuous-variable QKD networks with trusted and untrusted relays
AU - Farsad Ahmad
AU - Aeysha Khalique
PY - 2026
DA - 2026/10/02
PB - arXiv
DO - 10.48550/arxiv.2610.03382
UR - https://arxiv.org/abs/2610.03382
AB - Continuous-variable quantum key distribution (CV-QKD) networks require routing strategies that account simultaneously for secret key generation, relay trust and finite network resources. We introduce Quantum Utility Routing (QUR), a weighted routing framework for networks combining trusted point-to-point links with untrusted CV Bell measurement relays. Transition level composable finite size secret key rates (SKRs) are incorporated directly into the route search, allowing QUR to balance bottleneck SKR against route geometry and resource use. We consider graph optimized QUR (QUR_go) and a fixed weight implementation (QUR_fw) that uses machine learning to avoid repeated graph specific weight optimization, and benchmark both against A* and Max--Min routing. At the default network configuration, QUR_go and QUR_fw improve the mean path SKR relative to A* while requiring substantially fewer network resources than Max--Min. The framework also maintains secure connectivity over a broad range of trusted node availability by exploiting untrusted infrastructure as measurement relays. These results demonstrate that routing in CV-QKD networks can be treated as a configurable trade off between cryptographic performance and network resource consumption.
ER -