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

Journal of Military Science and Technology

A solution for analyzing and evaluating quantum communication networks through simulation

Cao Van Toan, Dang Tien Sy, Bui Thi Thanh Tam, Trieu Duc Quan, Nguyen Trung Thanh, Do Doanh Dien, Phan Huy Anh

Published Oct 30, 2025• 2 citations
Publisher

Abstract

This paper proposes a comprehensive solution for analyzing and evaluating the performance of quantum communication networks through the use of the open-source simulation software, QuNetSim. This method provides a flexible and cost-effective approach to studying network protocols and parameters prior to hardware implementation. The main content of the paper focuses on modeling realistic factors such as channel loss, noise, and eavesdropping behaviors. The research conducted detailed simulation scenarios with the BB84 and E91 protocols. In particular, a general network scenario, integrating quantum repeaters and teleportation, was analyzed through Fidelity. The results not only confirm the crucial role of repeaters in maintaining long-distance connectivity but also quantify the performance degradation caused by channel loss and eavesdropping. The simulation results also demonstrate that QuNetSim is a powerful tool, enabling researchers to easily build, test, and optimize complex quantum networks, thereby accelerating the transition from theory to practice.

DOI
10.54939/1859-1043.j.mst.iite.2025.3-11

Related papers

Implementation of Quantum Key Distribution network simulation in Quantum Channel

S. Praveen Kumar, T. Jaya, Prithiviraj Rajalingam

Abstract The aim is to analyze the efficiency of a communication method, Quantum key distribution. This newly popularized method of communication uses the principles of quantum mechanics. The simulation environment allows researchers to create complex network topologies and a high degree of control and repeatable experiments, allowing them to conduct studies and verify their outcomes. It would be costly to implement QKD in reality, which would need optical and Internet connections between network nodes and the verification of a certain network method or protocol. Thus, the performance analysis here is done in open-source software called NS-3 or Network Simulator- 3, which has an in-built module called QKD netsim for creating the quantum channel.

Journal of Physics Conference Series•Sep 1, 2022•2 citations

QuNetSim: A Software Framework for Quantum Networks

Stephen Diadamo, Janis Nötzel, Benjamin Zanger +1 more

As quantum network technologies develop, the need for teaching and engineering tools such as simulators and emulators rises. QuNetSim addresses this need. QuNetSim is a Python software framework that delivers an easy-to-use interface for simulating quantum networks at the network layer, which can be extended at little effort of the user to implement the corresponding link layer protocols. The goal of QuNetSim is to make it easier to investigate and test quantum networking protocols over various quantum network configurations and parameters. The framework incorporates many known quantum network protocols so that users can quickly build simulations using a quantum-networking toolbox in a few lines of code and so that beginners can easily learn to implement their own quantum networking protocols. Unlike most current tools, QuNetSim simulates with real time and is, therefore, well suited to control laboratory hardware. Here, we present a software design overview of QuNetSim and demonstrate examples of protocols implemented with it. We describe ongoing work, which uses QuNetSim as a library, and describe possible future directions for the development of QuNetSim.

arXiv:2003.06397•IEEE Transactions on Quantum Engineering•Jan 1, 2021•142 citations

Secure Quantum Communication: Simulation and Analysis of Quantum Key Distribution Protocols

Mahendra Rasay, Emmanuel D. Sebastian, Subhash Prasad Sah +2 more

Quantum computing poses significant threats to conventional cryptographic techniques such as RSA and AES, motivating the need for quantum secure communication methods. Quantum Key Distribution (QKD) offers information theoretic security based on fundamental quantum principles. This paper presents a simulation-based analysis of well-known QKD protocols, namely BB84, B92, and E91, using the IBM Qiskit framework. Realistic quantum channel effects, including noise, decoherence, and eavesdropping, are modeled to evaluate protocol performance. Key metrics such as error rate, secret key generation, and security characteristics are analyzed and compared. The study highlights practical challenges in QKD implementation, including hardware limitations and channel losses, and discusses insights toward scalable and robust quantum communication systems. The results support the feasibility of QKD as a promising solution for secure communication in the quantum era.

quant-pharXiv:2603.16690•International Scientific Journal of Engineering and Management•Mar 18, 2026•4 citations

On the Specification and Analysis of Quantum Repeater Protocols

Lorenzo La Corte, Anita Buckley, Pavel Chuprikov +1 more

The distribution of high-quality entanglement over long distances remains a challenge due to losses in quantum channels. As a solution, quantum repeater protocols generate entanglement over short segments and progressively extend its range using entanglement swapping, while using distillation to compensate for entanglement degradation. Numerous studies analyze repeater protocols through tailored tools that are tied to specific protocol types and network assumptions. In this work, we propose a formal language to specify quantum repeater protocols in a unified manner, modeling the concurrent distribution of entanglement across multiple pairs of network nodes. We consider delays arising from failures and contention for resources, and account for the effects of noise and decoherence on the quality of entanglement. Furthermore, we provide a prototype tool based on our language to precisely track the rate and fidelity of the distributed entangled pairs, supporting heterogeneous hardware configurations and constraints on available quantum memories. Finally, we demonstrate the effectiveness of our approach by expressing common protocols from the literature and evaluating their performance.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations

Quantum Cryptography Simulation

R. Goutam, Shwetha S, T R Loukya +2 more

By utilizing concepts from quantum physics like entanglement and superposition, quantum cryptography is revolutionizing data security. This study focuses on the application of classical computational models for simulation-based analysis of Quantum Key Distribution (QKD) protocols, namely BB84 and E91. By taking use of quantum features, QKD makes secure key exchange possible and guarantees that any effort at eavesdropping may be identified because of the disruption of quantum states. In order to assess how quantum communication channels behave under different noise and attack scenarios, the study models and simulates these channels. The study evaluates the efficacy and robustness of BB84 and E91 protocols in practical network settings by contrasting their performance and error tolerance. In order to determine if integrating quantum-secured systems with current classical infrastructures is feasible, scalability issues are also investigated. These simulations’ outcomes shed light on feasible security levels, resource needs, and workable deployment tactics. In the end, this research highlights how quantum cryptography may advance the basis for next-generation secure information networks by bridging the gap between theoretical quantum security models and real-world communication systems with the use of strong simulation frameworks.

International Conference on Advancement in Futuristic Technologies (ICAFT)•Dec 19, 2025•0 citations

Design and Evaluation of Communication Protocols for Quantum Repeater Networks

Luciano Aparicio

When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.

•Sep 27, 2011•2 citations
This paper proposes a comprehensive solution for analyzing and evaluating the performance of quantum communication networks through the use of the open-source simulation software, QuNetSim. This method provides a flexible and cost-effective approach to studying network protocols and parameters prior to hardware implementation. The main content of the paper focuses on modeling realistic factors such as channel loss, noise, and eavesdropping behaviors. The research conducted detailed simulation scenarios with the BB84 and E91 protocols. In particular, a general network scenario, integrating quantum repeaters and teleportation, was analyzed through Fidelity. The results not only confirm the crucial role of repeaters in maintaining long-distance connectivity but also quantify the performance degradation caused by channel loss and eavesdropping. The simulation results also demonstrate that QuNetSim is a powerful tool, enabling researchers to easily build, test, and optimize complex quantum networks, thereby accelerating the transition from theory to practice.
Abstract The aim is to analyze the efficiency of a communication method, Quantum key distribution. This newly popularized method of communication uses the principles of quantum mechanics. The simulation environment allows researchers to create complex network topologies and a high degree of control and repeatable experiments, allowing them to conduct studies and verify their outcomes. It would be costly to implement QKD in reality, which would need optical and Internet connections between network nodes and the verification of a certain network method or protocol. Thus, the performance analysis here is done in open-source software called NS-3 or Network Simulator- 3, which has an in-built module called QKD netsim for creating the quantum channel.
As quantum network technologies develop, the need for teaching and engineering tools such as simulators and emulators rises. QuNetSim addresses this need. QuNetSim is a Python software framework that delivers an easy-to-use interface for simulating quantum networks at the network layer, which can be extended at little effort of the user to implement the corresponding link layer protocols. The goal of QuNetSim is to make it easier to investigate and test quantum networking protocols over various quantum network configurations and parameters. The framework incorporates many known quantum network protocols so that users can quickly build simulations using a quantum-networking toolbox in a few lines of code and so that beginners can easily learn to implement their own quantum networking protocols. Unlike most current tools, QuNetSim simulates with real time and is, therefore, well suited to control laboratory hardware. Here, we present a software design overview of QuNetSim and demonstrate examples of protocols implemented with it. We describe ongoing work, which uses QuNetSim as a library, and describe possible future directions for the development of QuNetSim.
Quantum computing poses significant threats to conventional cryptographic techniques such as RSA and AES, motivating the need for quantum secure communication methods. Quantum Key Distribution (QKD) offers information theoretic security based on fundamental quantum principles. This paper presents a simulation-based analysis of well-known QKD protocols, namely BB84, B92, and E91, using the IBM Qiskit framework. Realistic quantum channel effects, including noise, decoherence, and eavesdropping, are modeled to evaluate protocol performance. Key metrics such as error rate, secret key generation, and security characteristics are analyzed and compared. The study highlights practical challenges in QKD implementation, including hardware limitations and channel losses, and discusses insights toward scalable and robust quantum communication systems. The results support the feasibility of QKD as a promising solution for secure communication in the quantum era.
The distribution of high-quality entanglement over long distances remains a challenge due to losses in quantum channels. As a solution, quantum repeater protocols generate entanglement over short segments and progressively extend its range using entanglement swapping, while using distillation to compensate for entanglement degradation. Numerous studies analyze repeater protocols through tailored tools that are tied to specific protocol types and network assumptions. In this work, we propose a formal language to specify quantum repeater protocols in a unified manner, modeling the concurrent distribution of entanglement across multiple pairs of network nodes. We consider delays arising from failures and contention for resources, and account for the effects of noise and decoherence on the quality of entanglement. Furthermore, we provide a prototype tool based on our language to precisely track the rate and fidelity of the distributed entangled pairs, supporting heterogeneous hardware configurations and constraints on available quantum memories. Finally, we demonstrate the effectiveness of our approach by expressing common protocols from the literature and evaluating their performance.
By utilizing concepts from quantum physics like entanglement and superposition, quantum cryptography is revolutionizing data security. This study focuses on the application of classical computational models for simulation-based analysis of Quantum Key Distribution (QKD) protocols, namely BB84 and E91. By taking use of quantum features, QKD makes secure key exchange possible and guarantees that any effort at eavesdropping may be identified because of the disruption of quantum states. In order to assess how quantum communication channels behave under different noise and attack scenarios, the study models and simulates these channels. The study evaluates the efficacy and robustness of BB84 and E91 protocols in practical network settings by contrasting their performance and error tolerance. In order to determine if integrating quantum-secured systems with current classical infrastructures is feasible, scalability issues are also investigated. These simulations’ outcomes shed light on feasible security levels, resource needs, and workable deployment tactics. In the end, this research highlights how quantum cryptography may advance the basis for next-generation secure information networks by bridging the gap between theoretical quantum security models and real-world communication systems with the use of strong simulation frameworks.
When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.