As quantum key distribution becomes increasingly practical, questions of how to effectively employ it in large-scale networks and over large distances becomes increasingly important. To that end, in this work, we model the performance of the E91 entanglement based QKD protocol when operating in a network consisting of both quantum repeaters and trusted nodes. We propose a number of routing protocols for this network and compare their performance under different usage scenarios. Through our modeling, we investigate optimal placement and number of trusted nodes versus repeaters depending on device performance (e.g., quality of the repeater's measurement devices). Along the way we discover interesting lessons determining what are the important physical aspects to improve for upcoming quantum networks in order to improve secure communication rates.
Quantum key distribution (QKD) can provide point-to-point information-theoretic secure key services for two connected users. In fact, the development of QKD networks needs more focus from the scientific community in order to broaden the service scale of QKD technology to deliver end-to-end secure key services. Of course, some recent efforts have been made to develop secure communication protocols based on QKD. However, due to the limited key generation capability of QKD devices, high quantum secure key utilization is the major concern for QKD networks. Since traditional routing techniques do n…
In this paper, we consider quantum key distribution (QKD) in a quantum network with both quantum repeaters and a small number of trusted nodes. In contrast to current QKD networks with only trusted nodes and the true Quantum Internet with only quantum repeaters, such networks represent a middle ground, serving as near-future QKD networks. In this setting, QKD can be efficiently and practically deployed, while providing insights for the future true Quantum Internet. To significantly improve the key generation efficiency in such networks, we develop a new dynamic routing strategy that makes rout…
Multi-Criteria Routing for Cryptographic Key Exchange in QKD Networks: Survey, Taxonomy, and a Conceptual Optimization Framework
University of Zagreb, Faculty of Transport and Traffic Sciences（萨格勒布大学交通与交通科学学院）；University of Aveiro, Department of Electronics, Telecommunications and Informatics (DETI)（阿威罗大学电子、电信与信息学系）；Instituto de Telecomunicações（电信研究所）
We consider various issues which arise as soon as one tries to practically implement simple networks of quantum relays for QKD. In particular we discuss authentication and routing which are essential ingredients of any QKD network. This paper aims to address some gaps between quantum and networking aspects of QKD networks usually reserved to specialist in physics and computer science respectively.
We consider the problem of secure packet routing at the maximum achievable rate in Quantum Key Distribution (QKD) networks. Assume that a QKD protocol generates symmetric private key pairs for secure communication over each link in a network. The quantum key generation process is modeled using a stochastic counting process. Packets are first encrypted with the quantum keys available for each hop and then transmitted on a point-to-point basis over the links. A fundamental problem in this setting is the design of a secure and capacity-achieving routing policy that takes into account the time-var…
Isogeny Graphs in Superposition and Quantum Onion Routing
The Cyprus Institute（塞浦路斯研究所）；Northeastern University – London（伦敦东北大学）；Khoury College of Computer Sciences, Northeastern University（东北大学库里计算机学院）；Deutsches Elektronen-Synchrotron DESY（德国电子同步加速器中心）
We study the routing of quantum information in parallel on multi-dimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits using Josephson junctions and resonators. We show that perfect parallel state transfer is possible for certain networks of harmonic oscillator modes. We further extend this to the distribution of entanglement between every pair of nodes in the network, finding that the routing efficiency of hypercube networks is both optimal and robust in the presence of dissipation and finite bandwidth.
We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant…
