Software Defined Networks Key Relay for Large-Scale Quantum Key Distribution Networks

• URL: http://arxiv.org/abs/2608.17539v1
• Date: Tue, 18 Aug 2026 09:01:32 GMT
• Title: Software Defined Networks Key Relay for Large-Scale Quantum Key Distribution Networks
• Abstract summary: This work addresses the orchestration of largescale Quantum Key Distribution Networks (QKDNs) using Software Defined Networking (SDN)<n>Building on ETSI and ITU specifications, common best practices and architectures are outlined.<n>Multiple path selection algorithms, based on Dijkstra or a maximum-minimum capacity algorithm, with built-in load balancing are presented.
• Score: 35.61991435985963
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work addresses the orchestration of large-scale Quantum Key Distribution Networks (QKDNs) using Software Defined Networking (SDN). Building on ETSI and ITU specifications, common best practices and architectures are outlined. The main task of the SDN Controller is to aggregate technical key performance indicators (KPI) from the network and, based on these, select the optimal path. Multiple path selection algorithms, based on Dijkstra or a maximum-minimum capacity algorithm, with built-in load balancing are presented. The algorithms were tested in simulations and their performances, and tradeoffs, are discussed. Additional critical aspects related to SDN controlled QKDNs are discussed, such as query batching, multi-path selection and group key capabilities. An oblivious multi-party protocol is proposed for relay path selection in a multi-domain scenario, so providers don't have to disclose sensitive information about their QKDN. These contributions aim to enhance scalability, resilience and interoperability in quantum-secure network infrastructures.

Related papers

• Performance Analysis of QAOA Across Distributed Quantum Network Topologies Using SwitchQNet [0.32622301272834514]
  We study the Quantum Approximate Optimization Algorithm (QAOA) as a graph-structured optimization workload for QDC-based quantum computing.<n>We adapt QAOA to SwitchQNet, a distributed quantum compiler framework that schedules communication and entanglement generation over switch-based QDC networks.<n>We evaluate QAOA instances across Clos, fat-tree, and spine-leaf topologies, measuring communication latency, EPR-pair overhead, EPR wait time, retry overhead, and sensitivity to buffer size.
  arXiv  Detail & Related papers  (2026-07-26T01:45:57Z)
• Deploying and validating a metropolitan QKD secure network: architecture and field performance [76.02413102965598]
  Quantum Key Distribution provides information-theoretic security for key establishment.<n>A metropolitan-scale quantum-secure network between data centers in Milan is reported.<n>Results establish the technical and operational readiness of metropolitan QKD networks for production deployment.
  arXiv  Detail & Related papers  (2026-07-13T15:51:26Z)
• A Distributed Switching Protocol for Quantum Networks [0.22166578153935787]
  We propose a switching protocol for unbuffered, multidrop quantum networks in a photonic synchronization domain.<n>Two end nodes cooperatively select the target BSA node with the lowest path cost and independently reserve each path within the network.<n>Results demonstrate high link establishment success with stable performance even under increased network load.
  arXiv  Detail & Related papers  (2026-05-08T06:04:28Z)
• Switching Coordinator: An SDN Application for Flexible QKD-Networks [0.15840308565716285]
  A monitor and control framework for quantum-key-distribution (QKD) networks equipped with switching capabilities was developed.<n>It extracts essential data, such as the switching capabilities of QKD modules, the number of keys stored in buffer queues of the QKD links, and the respective key generation and consumption rates.<n>On the other hand, it allows software-defined networking applications to operate on the collected information and address the cryptographic needs of the network.
  arXiv  Detail & Related papers  (2026-03-14T07:35:04Z)
• Advanced Scheduling Strategies for Distributed Quantum Computing Jobs [1.4757786825685777]
  Scaling the number of qubits available across multiple quantum devices is an active area of research within distributed quantum computing (DQC)<n>The latter aspect is very challenging because, while reducing the makespan of job batches remains a relevant objective, novel quantum-specific constraints must be considered, including QPU utilization, non-local gate density, and the latency associated with queued DQC jobs.
  arXiv  Detail & Related papers  (2026-02-27T16:35:32Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Opportunistic Routing in Wireless Communications via Learnable State-Augmented Policies [7.512221808783587]
  This paper addresses the challenge of packet-based information routing in large-scale wireless communication networks.<n>Opportunistic routing exploits the broadcast nature of wireless communication to dynamically select optimal forwarding nodes.<n>We propose a State-Augmentation (SA) based distributed optimization approach aimed at maximizing the total information handled by the source nodes in the network.
  arXiv  Detail & Related papers  (2025-03-05T18:44:56Z)
• Optimization of QKD Networks with Classical and Quantum Annealing [0.7827586118586438]
  Quantum Key Distribution (QKD) hardware is used in a tier 1 provider network. The ensemble of QKD systems needs to be able to exchange as many encryption keys. Redundancy and latency requirements add additional boundary conditions.
  arXiv  Detail & Related papers  (2022-06-28T16:08:12Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Optimized Quantum Networks [68.8204255655161]
  Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests. We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
  arXiv  Detail & Related papers  (2021-07-21T18:00:07Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.