Quantum key distribution (QKD) constitutes a symmetric secret key negotiation protocol capable of maintaining information-theoretic security. Given the recent advances in QKD networks, they have evolved from academic research to some preliminary applications. A QKD network consists of two or more QKD nodes interconnected by optical fiber or free space links. The secret keys are negotiated between any pair of QKD nodes, and then they can be delivered to multiple users in various areas for ensuring long-term protection and forward secrecy. We commence by introducing the QKD basics, followed by reviewing the development of QKD networks and their implementation in practice. Subsequently, we describe the general QKD network architecture, its elements, as well as its interfaces and protocols. Next, we provide an in-depth overview of the associated physical layer and network layer solutions, followed by the standardization efforts as well as the application scenarios associated with QKD networks. Finally, we discuss the potential future research directions and provide design guidelines for QKD networks.

Quantum key distribution (QKD) networking over wavelength division multiplexing (WDM) network infrastructure provides a new paradigm for secure communications across the networks. With limited wavelength resources in existing WDM networks, how to efficiently schedule QKD to provision sufficient secret keys over WDM networks becomes a new challenge. This study proposes a new time-scheduled scheme in combination with quantum key pool (QKP) technique to overcome this challenge. A new architecture of QKD-over-WDM networks is presented, in which QKPs are constructed to decouple secret-key resources from the underlying infrastructure for timely secret-key provisioning. In the time-scheduled scheme, routing, wavelength and time-slot allocation (RWTA) problem is proposed for efficient QKP construction (QKPC) over WDM networks, in which three sub-problems (i.e., secret-key consumption, time-slot allocation, and time-slot continuity) are discussed respectively. An integer linear programming (ILP) model and a novel joint path-and-link -based RWTA (JPL-RWTA) heuristic algorithm are designed to solve the RWTA problem, in which the three sub-problems are addressed together. Simulation results indicate that the ILP model and JPL-RWTA algorithm are effective approaches to obtain the positive balance between resource utilization of QKPC (RUQKPC) and successful probability of QKPC (SPQKPC). Moreover, the SPQKPC can be increased at the cost of reducing the flexibility of secret-key consumption, the uniformity of time-slot allocation, and the proportion of time-slot continuous QKPC (TC-QKPC) to time-slot discrete QKPC (TD-QKPC) requests.

Quantum key distribution (QKD) has demonstrated a great potential to provide future-proofed security, especially for 5G and beyond communications. As the critical infrastructure for 5G and beyond communications, optical networks can offer a cost-effective solution to QKD deployment utilizing the existing fiber resources. In particular, measurement-device-independent QKD shows its ability to extend the secure distance with the aid of an untrusted relay. Compared to the trusted relay, the untrusted relay has obviously better security, since it does not rely on any assumption on measurement and even allows to be accessed by an eavesdropper. However, it cannot extend QKD to an arbitrary distance like the trusted relay, such that it is expected to be combined with the trusted relay for large-scale QKD deployment. In this work, we study the hybrid trusted/untrusted relay based QKD deployment over optical backbone networks and focus on cost optimization during the deployment phase. A new network architecture of hybrid trusted/untrusted relay based QKD over optical backbone networks is described, where the node structures of the trusted relay and untrusted relay are elaborated. The corresponding network, cost, and security models are formulated. To optimize the deployment cost, an integer linear programming model and a heuristic algorithm are designed. Numerical simulations verify that the cost-optimized design can significantly outperform the benchmark algorithm in terms of deployment cost and security level. Up to 25% cost saving can be achieved by deploying QKD with the hybrid trusted/untrusted relay scheme while keeping much higher security level relative to the conventional point-to-point QKD protocols that are only with the trusted relays.

Quantum Key Distribution (QKD) is a promising technology that provides proven unconditional security based on fundamentals of quantum physics, especially for point-to-point communications. It could be applied in large-scale optical networks for long-distance key provisioning mainly by three relaying methods: quantum-repeater-based QKD, trusted-relay-based QKD, and measurement-device-independent QKD (MDI-QKD). However, quantum-repeater-based QKD is still under study because of the immature technologies such as the preliminary quantum memory. The trusted-relay-based QKD is vulnerable since insecurity of non-ideal single-photon sources and detectors cannot be ignored in practical applications. On the other hand, for MDI-QKD, there exists a limitation on its key rate under long-distance communications. According to these limitations, embedding protocols like MDI-QKD into the existing trusted-relay-based QKD secured optical networks (QKD-ON) with usage of untrusted relays is a promising key-provisioning scheme. In this paper, we study such partially-trusted relay scenarios and focus on its routing of keys in different kinds of typical network topologies. A partially-trusted-relay-based QKD method is described, which can allow a pair of optical nodes sharing secret keys under the coexistence of trusted relays and untrusted relays. The secret-key provisioning with collaborative routing ( SKP-CR ) algorithm is proposed to search for the optimal key-relay routing path. We perform the simulations with different proportion of trusted relays versus untrusted relays, initial secret keys in the quantum key pools (QKPs), and traffic load. The simulations verify that the SKP-CR algorithm can significantly outperform the conventional trusted-relay-based scheme in terms of key-distribution success rate with an improvement of up to 62% with a mesh topology.

Quantum key distribution (QKD) uses the laws of quantum mechanics to distribute secret keys with information-theoretic security. To realize QKD for secure communications among multiple distant users, fiber-based QKD networks can be deployed with today’s available technologies. Incorporating QKD into existing wavelength-division multiplexing (WDM) network infrastructure provides a practical way to reduce the difficulty and cost of QKD networking. Nonetheless, the costs of QKD nodes and QKD links are still considered as the major barriers to long-distance QKD network deployment in practice. In this work, we study how to minimize the cost of deploying QKD-over-WDM backbone networks. We introduce a general architecture of QKD-over-WDM backbone networks. A novel cost-oriented model is defined to elaborate the cost-minimized problem, in which various QKD network components including QKD transceivers, QKD auxiliary equipment for QKD backbone nodes and trusted repeater nodes (TRNs), and QKD links are considered. The physical-layer parameters such as secret-key rate, physical distance, and the layout of TRNs are also incorporated in our defined model. We develop an integer linear programming (ILP) model and a novel cost-efficient QKD networking (CEQN) heuristic algorithm to address the cost-minimized problem. The extensive simulations indicate that our proposed approaches are effective in reducing the cost of deploying QKD-over-WDM backbone networks, where the designed CEQN algorithm is efficient to demonstrate similar to the ILP model. Finally, some open issues in future work are discussed, given that this work only presents an early high-level analysis as opposed to a definitive detailed model.

Quantum key distribution (QKD) networks are potential to be widely deployed in the immediate future to provide long-term security for data communications. Given the high price and complexity, multi-tenancy has become a cost-effective pattern for QKD network operations. In this work, we concentrate on addressing the online multi-tenant provisioning (On-MTP) problem for QKD networks, where multiple tenant requests (TRs) arrive dynamically. On-MTP involves scheduling multiple TRs and assigning non-reusable secret keys derived from a QKD network to multiple TRs, where each TR can be regarded as a high-security-demand organization with the dedicated secret-key demand. The quantum key pools (QKPs) are constructed over QKD network infrastructure to improve management efficiency for secret keys. We model the secret-key resources for QKPs and the secret-key demands of TRs using distinct images. To realize efficient On-MTP, we perform a comparative study of heuristics and reinforcement learning (RL) based On-MTP solutions, where three heuristics (i.e., random, fit, and best-fit based On-MTP algorithms) are presented and a RL framework is introduced to realize automatic training of an On-MTP algorithm. The comparative results indicate that with sufficient training iterations the RL-based On-MTP algorithm significantly outperforms the presented heuristics in terms of tenant-request blocking probability and secret-key resource utilization.