Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2509.24440 · Journal of Lightwave Technology

Evaluating Relayed and Switched Quantum Key Distribution (QKD) Network Architectures

Antonis Selentis, Nikolas Makris, Alkinoos Papageorgopoulos, Persefoni Konteli, K. Christodoulopoulos, George Theodore Kanellos, Dimitris Syvridis

Published May 21, 2026• 1 citation
arXivHTMLPDF

Abstract

We evaluate the performance of two architectures for network-wide quantum key distribution (QKD): Relayed QKD, which relays keys over multi-link QKD paths for non-adjacent nodes, and Switched QKD, which uses optical switches to dynamically connect arbitrary QKD modules to form direct QKD links between them. An advantage of Switched QKD is that it distributes quantum keys end-to-end, whereas Relayed relies on trusted nodes. However, Switched depends on arbitrary matching of QKD modules. We first experimentally evaluate the performance of commercial DV-QKD modules; for each of three vendors we benchmark the performance in standard/matched module pairs and in unmatched pairs to emulate configurations in the Switched QKD network architecture. The analysis reveals that in some cases a notable variation in the generated secret key rate (SKR) between the matched and unmatched pairs is observed. Driven by these experimental findings, we conduct a comprehensive theoretical analysis that evaluates the network wide performance of the two architectures. Our analysis is based on uniform ring networks, where we derive optimal key management configurations and analytical formulas for the achievable consumed SKR. We compare network performance under varying ring sizes, QKD link losses, QKD receivers' sensitivity and performance penalties of unmatched modules. Our findings indicate that Switched QKD performs better in dense rings (short distances, large node counts), while Relayed QKD is more effective in longer distances and large node counts. Moreover, we confirm that unmatched QKD modules penalties significantly impact the efficiency of Switched QKD architecture.

DOI
10.1109/jlt.2026.3695776

Related papers

Comparing Relayed and Switched QKD in Ring Networks

Antonios Selentis-Boulntadakis, K. Christodoulopoulos, George Theodore Kanellos

The rise of quantum computers threatens public-key cryptography and its foundational role in secure symmetric key distribution. Quantum Key Distribution (QKD) offers a promising alternative, leveraging quantum principles to securely distribute keys between two endpoints. To enable network-wide key distribution, two main architectures have emerged: Relayed QKD, which forwards keys generated between neighbors along a path, and Switched QKD, which uses optical switches to dynamically establish QKD links between nodes for scheduled key generation sessions. Both architectures require algorithmic solutions for efficient key management and distribution. We present optimal configurations and analytical formulas for uniform rings and compare the performance of the two architectures. We also define generic key management algorithms and apply them to compare the two architectures in non-uniform rings. Our findings are consistent across both uniform and non-uniform rings: Switched QKD is more effective in dense networks (i.e., with many nodes and short distances), while Relayed QKD performs better in larger rings with longer inter-node distances.

International Conference on Transparent Optical Networks•Jul 6, 2025•0 citations

Relayed vs. Switched QKD: A Comparison in Non-Uniform Ring Networks

Antonios Selentis-Boulntadakis, K. Christodoulopoulos, George Theodore Kanellos

The rise of quantum computers threatens public key security and its essential role in distributing symmetric keys. QKD offers a promising solution by leveraging quantum principles for secure key distribution between two points. To enable network-wide key distribution, two candidate architectures have emerged: Relayed QKD which relays neighboring generated keys along a path, and Switched QKD which uses optical switches to dynamically connect QKD devices and create key generation sessions between nodes. Both architectures require algorithmic solutions for effective key management and distribution. In prior work, we derived for uniform ring topologies optimal configurations and analytical formulas for keys consumption and compared the Switched and Relayed architectures. In this study, we extend that work by introducing scheduling and key management algorithms for arbitrary topologies and use them to compare these two architectures in non-uniform rings. Our findings reinforce previous conclusions: Switched QKD is more effective for dense (large number of nodes and short distances) networks, such as metropolitan rings, while Relayed QKD outperforms in larger rings with longer distances.

International Conference on Optical Network Design and Modeling (ONDM)•May 6, 2025•4 citations

Optically Switched Quantum Key Distribution Network

Xinke Tang

Encrypted data transmission is becoming increasingly more important as information security is vital to modern communication networks. Quantum Key Distribution (QKD) is a promising method based on the quantum properties of light to generate and distribute unconditionally secure keys for use in classical data encryption. Significant progress has been achieved in the performance of QKD point-to-point transmission over a fibre link between two users. The transmission distance has exceeded several hundred kilometres of optical fibre in recent years, and the secure bit rate achievable has reached megabits per second, making QKD applicable for metro networks. To realize quantum encrypted data transmission over metro networks, quantum keys need to be regularly distributed and shared between multiple end users. Optical switching has been shown to be a promising technique for cost-effective QKD networking, enabling the dynamic reconfiguration of transmission paths with low insertion loss. In this thesis, the performance of optically switched multi-user QKD systems are studied using a mathematical model in terms of transmission distance and secure key rates. The crosstalk and loss limitations are first investigated theoretically and then experimentally. The experiment and simulation both show that negligible system penalties are observed with crosstalk of -20 dB or below. A practical quantum-safe metro network solution is then reported, integrating optically-switched QKD systems with high speed reconfigurability to protect classical network traffic. Quantum signals are routed by rapid optical switches between any two endpoints or network nodes via reconfigurable connections. Proof-of-concept experiments with commercial QKD systems are conducted. Secure keys are continuously shared between virtualised Alice-Bob pairs over effective transmission distances of 30 km, 31.7 km, 33.1 km and 44.6 km. The quantum bit error rates (QBER) for the four paths are proportional to the channel losses with values between 2.6% and 4.1%. Optimising the reconciliation and clock distribution architecture is predicted to result in an estimated maximum system reconfiguration time of 20 s, far shorter than previously demonstrated. In addition, Continuous Variable (CV) QKD has attracted much research interest in recent years, due to its compatibility with standard telecommunication techniques and relatively low cost in practical implementation. A wide band balanced homodyne detection system built from modified off-the-shelf components is experimentally demonstrated. Practical limits and benefits for high speed CVQKD key transmission are demonstrated based on an analysis of noise performance. The feasibility of an optically switched CV-QKD is also experimentally demonstrated using two virtualised Alice-Bob pairs for the first time. This work represents significant advances towards the deployment of CVQKD in a practical quantum-safe metro network. A method of using the classical equalization technique for Inter-symbol-interference mitigation in CVQKD detection is also presented and investigated. This will encourage further research to explore the applications of classical communication tools in quantum communications.

•Sep 28, 2018•2 citations

Decentralized key distribution versus on-demand relaying for QKD networks

María Álvarez-Roa, Catalina Stan, Sebastian R. Verschoor +2 more

Quantum key distribution (QKD) allows the distribution of secret keys for quantum-secure communication between two distant parties, vital in the quantum computing era in order to protect against quantum-enabled attackers. However, overcoming rate-distance limits in QKD and the establishment of quantum key distribution networks necessitate key relaying over trusted nodes. This process may be resource-intensive, consuming a substantial share of the scarce QKD key material to establish end-to-end secret keys. Hence, an efficient scheme for key relaying and the establishment of end-to-end key pools is essential for practical and extended quantum-secured networking. In this paper, we propose and compare two protocols for managing, storing, and distributing secret key material in QKD networks, addressing challenges such as the success rate of key requests, key consumption, and overhead resulting from relaying. We present an innovative, fully decentralized key distribution strategy as an alternative to the traditional hop-by-hop relaying via trusted nodes, where three experiments are considered to evaluate performance metrics under varying key demand. Our results show that the decentralized pre-flooding approach achieves higher success rates as application demands increase. This analysis highlights the strengths of each approach in enhancing QKD network performance, offering valuable insights for developing robust key distribution strategies in different scenarios.

Journal of Optical Communications and Networking•Jun 23, 2025•7 citations

A routing method designed for a Quantum Key Distribution network

Yoshimichi Tanizawa, Ririka Takahashi, A. R. Dixon

Quantum Key Distribution (QKD) is a technique for sharing encryption keys between two adjacent nodes in an unconditionally secure manner based on quantum theory. From the viewpoint of network system research, QKD is considered to be a building block for providing secure link communication in network systems. Although the communication distance is subject to a limitation attributable to the QKD fundamentals, recent research and some QKD field trials of “key relaying” over a “QKD network” are overcoming this limitation. It also enables each node on the QKD network to exchange encryption keys with arbitrary nodes on the QKD network. However, the previous research didn't address a routing method on the QKD network in detail. This paper focuses on the routing issues on the QKD network, clarifies the requirements of the routing protocol, and proposes a routing solution designed for the key relaying on the QKD network. The proposed routing solution consists of 4 components: (1) a node interface architecture addressing both encrypted and unencrypted traffics, (2) a path selection algorithm based on the number of keys, (3) an IP address assignment scheme connecting unencrypted interfaces and encrypted interfaces, and (4) a routing protocol deployment method consuming no extra keys. The proposed routing solution allows the QKD network to select a suitable key relaying path according to the QKD system condition and to reduce the extra key consumption, which optimizes the key utilization on the QKD network. The proposed routing solution was implemented with a network emulating QKD technology and evaluated. The evaluation result shows that the proposed routing solution could select a path that stores enough keys, which is suitable for a QKD network. Additional impact analysis reveals that the proposed routing solution could save up to 52% of key consumption depending on the QKD key sharing speed and the routing protocol configuration.

International Conference on Ubiquitous and Future Networks•Jul 1, 2016•45 citations

Relayed-QKD and switched-QKD networks performance comparison considering physical layer QKD limitations

Nikolaos Makris, A. Papageorgopoulos, Persefoni Konteli +6 more

We experimentally evaluate the SKR generation for unoptimized QKD pairs in switched QKD and compare the performance of the switched-QKD with relayed-QKD networks to reveal they perform better for short distances and at large networks.

arXiv:2310.17262•Optical Fiber Communication Conference•Jan 1, 2024•3 citations
We evaluate the performance of two architectures for network-wide quantum key distribution (QKD): Relayed QKD, which relays keys over multi-link QKD paths for non-adjacent nodes, and Switched QKD, which uses optical switches to dynamically connect arbitrary QKD modules to form direct QKD links between them. An advantage of Switched QKD is that it distributes quantum keys end-to-end, whereas Relayed relies on trusted nodes. However, Switched depends on arbitrary matching of QKD modules. We first experimentally evaluate the performance of commercial DV-QKD modules; for each of three vendors we benchmark the performance in standard/matched module pairs and in unmatched pairs to emulate configurations in the Switched QKD network architecture. The analysis reveals that in some cases a notable variation in the generated secret key rate (SKR) between the matched and unmatched pairs is observed. Driven by these experimental findings, we conduct a comprehensive theoretical analysis that evaluates the network wide performance of the two architectures. Our analysis is based on uniform ring networks, where we derive optimal key management configurations and analytical formulas for the achievable consumed SKR. We compare network performance under varying ring sizes, QKD link losses, QKD receivers' sensitivity and performance penalties of unmatched modules. Our findings indicate that Switched QKD performs better in dense rings (short distances, large node counts), while Relayed QKD is more effective in longer distances and large node counts. Moreover, we confirm that unmatched QKD modules penalties significantly impact the efficiency of Switched QKD architecture.
The rise of quantum computers threatens public-key cryptography and its foundational role in secure symmetric key distribution. Quantum Key Distribution (QKD) offers a promising alternative, leveraging quantum principles to securely distribute keys between two endpoints. To enable network-wide key distribution, two main architectures have emerged: Relayed QKD, which forwards keys generated between neighbors along a path, and Switched QKD, which uses optical switches to dynamically establish QKD links between nodes for scheduled key generation sessions. Both architectures require algorithmic solutions for efficient key management and distribution. We present optimal configurations and analytical formulas for uniform rings and compare the performance of the two architectures. We also define generic key management algorithms and apply them to compare the two architectures in non-uniform rings. Our findings are consistent across both uniform and non-uniform rings: Switched QKD is more effective in dense networks (i.e., with many nodes and short distances), while Relayed QKD performs better in larger rings with longer inter-node distances.
The rise of quantum computers threatens public key security and its essential role in distributing symmetric keys. QKD offers a promising solution by leveraging quantum principles for secure key distribution between two points. To enable network-wide key distribution, two candidate architectures have emerged: Relayed QKD which relays neighboring generated keys along a path, and Switched QKD which uses optical switches to dynamically connect QKD devices and create key generation sessions between nodes. Both architectures require algorithmic solutions for effective key management and distribution. In prior work, we derived for uniform ring topologies optimal configurations and analytical formulas for keys consumption and compared the Switched and Relayed architectures. In this study, we extend that work by introducing scheduling and key management algorithms for arbitrary topologies and use them to compare these two architectures in non-uniform rings. Our findings reinforce previous conclusions: Switched QKD is more effective for dense (large number of nodes and short distances) networks, such as metropolitan rings, while Relayed QKD outperforms in larger rings with longer distances.
Encrypted data transmission is becoming increasingly more important as information security is vital to modern communication networks. Quantum Key Distribution (QKD) is a promising method based on the quantum properties of light to generate and distribute unconditionally secure keys for use in classical data encryption. Significant progress has been achieved in the performance of QKD point-to-point transmission over a fibre link between two users. The transmission distance has exceeded several hundred kilometres of optical fibre in recent years, and the secure bit rate achievable has reached megabits per second, making QKD applicable for metro networks. To realize quantum encrypted data transmission over metro networks, quantum keys need to be regularly distributed and shared between multiple end users. Optical switching has been shown to be a promising technique for cost-effective QKD networking, enabling the dynamic reconfiguration of transmission paths with low insertion loss. In this thesis, the performance of optically switched multi-user QKD systems are studied using a mathematical model in terms of transmission distance and secure key rates. The crosstalk and loss limitations are first investigated theoretically and then experimentally. The experiment and simulation both show that negligible system penalties are observed with crosstalk of -20 dB or below. A practical quantum-safe metro network solution is then reported, integrating optically-switched QKD systems with high speed reconfigurability to protect classical network traffic. Quantum signals are routed by rapid optical switches between any two endpoints or network nodes via reconfigurable connections. Proof-of-concept experiments with commercial QKD systems are conducted. Secure keys are continuously shared between virtualised Alice-Bob pairs over effective transmission distances of 30 km, 31.7 km, 33.1 km and 44.6 km. The quantum bit error rates (QBER) for the four paths are proportional to the channel losses with values between 2.6% and 4.1%. Optimising the reconciliation and clock distribution architecture is predicted to result in an estimated maximum system reconfiguration time of 20 s, far shorter than previously demonstrated. In addition, Continuous Variable (CV) QKD has attracted much research interest in recent years, due to its compatibility with standard telecommunication techniques and relatively low cost in practical implementation. A wide band balanced homodyne detection system built from modified off-the-shelf components is experimentally demonstrated. Practical limits and benefits for high speed CVQKD key transmission are demonstrated based on an analysis of noise performance. The feasibility of an optically switched CV-QKD is also experimentally demonstrated using two virtualised Alice-Bob pairs for the first time. This work represents significant advances towards the deployment of CVQKD in a practical quantum-safe metro network. A method of using the classical equalization technique for Inter-symbol-interference mitigation in CVQKD detection is also presented and investigated. This will encourage further research to explore the applications of classical communication tools in quantum communications.
Quantum key distribution (QKD) allows the distribution of secret keys for quantum-secure communication between two distant parties, vital in the quantum computing era in order to protect against quantum-enabled attackers. However, overcoming rate-distance limits in QKD and the establishment of quantum key distribution networks necessitate key relaying over trusted nodes. This process may be resource-intensive, consuming a substantial share of the scarce QKD key material to establish end-to-end secret keys. Hence, an efficient scheme for key relaying and the establishment of end-to-end key pools is essential for practical and extended quantum-secured networking. In this paper, we propose and compare two protocols for managing, storing, and distributing secret key material in QKD networks, addressing challenges such as the success rate of key requests, key consumption, and overhead resulting from relaying. We present an innovative, fully decentralized key distribution strategy as an alternative to the traditional hop-by-hop relaying via trusted nodes, where three experiments are considered to evaluate performance metrics under varying key demand. Our results show that the decentralized pre-flooding approach achieves higher success rates as application demands increase. This analysis highlights the strengths of each approach in enhancing QKD network performance, offering valuable insights for developing robust key distribution strategies in different scenarios.
Quantum Key Distribution (QKD) is a technique for sharing encryption keys between two adjacent nodes in an unconditionally secure manner based on quantum theory. From the viewpoint of network system research, QKD is considered to be a building block for providing secure link communication in network systems. Although the communication distance is subject to a limitation attributable to the QKD fundamentals, recent research and some QKD field trials of “key relaying” over a “QKD network” are overcoming this limitation. It also enables each node on the QKD network to exchange encryption keys with arbitrary nodes on the QKD network. However, the previous research didn't address a routing method on the QKD network in detail. This paper focuses on the routing issues on the QKD network, clarifies the requirements of the routing protocol, and proposes a routing solution designed for the key relaying on the QKD network. The proposed routing solution consists of 4 components: (1) a node interface architecture addressing both encrypted and unencrypted traffics, (2) a path selection algorithm based on the number of keys, (3) an IP address assignment scheme connecting unencrypted interfaces and encrypted interfaces, and (4) a routing protocol deployment method consuming no extra keys. The proposed routing solution allows the QKD network to select a suitable key relaying path according to the QKD system condition and to reduce the extra key consumption, which optimizes the key utilization on the QKD network. The proposed routing solution was implemented with a network emulating QKD technology and evaluated. The evaluation result shows that the proposed routing solution could select a path that stores enough keys, which is suitable for a QKD network. Additional impact analysis reveals that the proposed routing solution could save up to 52% of key consumption depending on the QKD key sharing speed and the routing protocol configuration.