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

International Journal of Emerging Innovations in Science and Technology

QUANTUM ENTANGLEMENT SWAPPING IN MULTI-NODE QUANTUM NETWORKS: EFFICIENCY AND SCALABILITY ANALYSIS

Muzafarova Sevinch Muhammadovna

Published Jun 8, 2026• 0 citations
OpenAlex

Abstract

This paper investigates the scalability and transmission efficiency of entanglement swapping protocols within multi-node quantum networks. As the realization of a global quantum internet relies heavily on long-distance entanglement distribution, quantum repeaters utilizing entanglement swapping serve as a critical backbone. However, scalability remains a bottleneck due to photon loss, operational infidelities, and quantum memory coherence times. In this study, we analytically model a multi-node quantum chain and evaluate how the end-to-end entanglement fidelity degrades as the number of intermediate nodes scales up. Our analysis highlights the critical thresholds for Bell state measurement (BSM) success rates required to maintain quantum state integrity across large distances. The findings provide optimization constraints for designing scalable and fault-tolerant routing protocols in future quantum information networks.

Related papers

Realizing Scalability Limits of Quantum Communication Networks

Connor Howe, Ali Anwar

The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Quantum Entanglement and Distance: A Performance Study of Long-Distance Networks

Alfredo Cuzzocrea, Mst Shapna Akter, Md. Shazzad Hossain Shaon +3 more

Long-distance quantum networks are far more than mere channels for data transfer; they are sophisticated systems that harness the counterintuitive features of quantum mechanics to enable secure and high-performance communication over vast distances. In our study, we explore the underlying mechanisms of quantum connectivity by investigating phenomena such as superposition and entanglement, and their roles in sustaining robust information propagation. We focus on the interaction between these quantum effects and routing protocols strategies that, while inspired by classical networks, must overcome challenges associated with quantum decoherence and measurement uncertainty. To evaluate these interactions, we simulated distributed quantum networks with node counts ranging from 10 to 100 using novel routing strategies including Q-Learning, Bell State, and Entanglement Swapping protocols. Our analysis centers on key performance metrics that capture both quantum fidelity and operational efficiency. Notably, our results show that high quantum state fidelity is maintained across all network configurations, confirming the efficacy of entangled states in preserving the integrity of quantum information over long distances. Simultaneously, we observe that increased network complexity introduces trade-offs, such as higher computational overhead and amplified susceptibility to decoherence and error propagation. These findings underscore the necessity for advanced error-correction techniques and adaptive routing strategies to ensure scalability and robustness in long-distance quantum communication. Overall, our work provides critical insights into optimizing quantum superposition and entanglement in practical routing implementations, thereby paving the way for the future realization of a global quantum communication infrastructure.

International Conference on Cloud and Big Data Computing (ICCBDC)•Aug 14, 2025•0 citations

Towards Scalable Quantum Networks

Connor Howe, Aziz, Mohsin, Ali Anwar

This paper presents a comprehensive study on the scalability challenges and opportunities in quantum communication networks, with the goal of determining parameters that impact networks most as well as the trends that appear when scaling networks. We design simulations of quantum networks comprised of router nodes made up of trapped-ion qubits, separated by quantum repeaters in the form of Bell State Measurement (BSM) nodes. Such networks hold the promise of securely sharing quantum information and enabling high-power distributed quantum computing. Despite the promises, quantum networks encounter scalability issues due to noise and operational errors. Through a modular approach, our research aims to surmount these challenges, focusing on effects from scaling node counts and separation distances while monitoring low-quality communication arising from decoherence effects. We aim to pinpoint the critical features within networks essential for advancing scalable, large-scale quantum computing systems. Our findings underscore the impact of several network parameters on scalability, highlighting a critical insight into the trade-offs between the number of repeaters and the quality of entanglement generated. This paper lays the groundwork for future explorations into optimized quantum network designs and protocols.

arXiv:2409.08416•Sep 12, 2024•4 citations

Optimal deployment design of repeaters and memories in quantum networks

Jiangyuan Yao, Kaiwen Zou, Deshun Li +1 more

In quantum communication networks, the transmission success rate of entangled photons decreases exponentially with the transmission distance in fiber channel. With quantum repeaters, quantum networks can realize arbitrary long-distance links based on quantum entanglement swapping, quantum storage, and quantum teleportation. Thanks to the development of quantum memory technology, the throughput of quantum relay networks can be improved by increasing the number of quantum memories. In this paper, we study the routing metric, the goal of which is to achieve a higher throughput in a long-distance quantum network by reasonably allocating repeater positions with a given memory count between source and destination. A routing metric$E$was proposed, where the number and distance range of repeater deployments can be obtained by numerical analysis to support an optimal network throughput. According to the above principle, various repeaters were deployed on a linear quantum network to test the effectiveness of the proposed allocation mechanism with the given transmission loss, Bell-State Measurement (BSM) success rate, memory quantity, and distance. The results of evaluation show that increasing the number of repeaters blindly can lead to a waste of resources and a throughput decreasing, which implies that repeaters need to be placed at an appropriate deployment distance to achieve the optimal performance.

IEEE International Conference on High Performance Computing and Communications; IEEE International Conference on Smart City; IEEE International Conference on Data Science and Systems (HPCC/SmartCity/DSS)•Dec 1, 2021•2 citations

Entanglement Swapping Scheduling for Quantum Repeater Chains under Decoherence during Classical Communications

Jorge Benito Díaz, Andrés Agustí, Jabier Faba +3 more

First-generation quantum repeaters are essential in distributing entanglement over long distances since they could mitigate losses in optical fiber. Repeaters split the total distance into shorter, easier to generate links. Then, entanglement swapping establishes long range entanglement by performing local measurements at the repeaters and heralding their results. In this work, we develop an analytical model that estimates the impact of decoherence during heralding for a given protocol. Furthermore, we identify a competition between two phenomena: as repeater count increases, so does entanglement generation, but the additive impact of memory decoherence on final entanglement rate increases too. Therefore, we find that an optimal number of repeaters exists. These findings could lead the design of future quantum networks, both in the inter-repeater distance and swapping timings.

quant-pharXiv:2610.07991•Oct 7, 2026•0 citations

Practical Limitations on the Quantum Internet

The realization of a global-scale quantum internet is hindered by practical challenges such as high photon loss, decoherence, susceptibility to node failure, and others. We analyze [1] the implications of these practical constraints on the scalability and robustness of the quantum Internet. Considering repeater-based quantum networks, we present bottlenecks for distributing resources among multiple end nodes. We use graph theory to assess network robustness and identify its critical nodes and critical length scales. In particular, we consider repeater-based quantum networks and present practical limitations on distilling secret keys via device-independent quantum key distribution (DI-QKD) protocols and other information processing tasks such as sharing of entanglement between the end nodes, performing Bell-CHSH violation experiments, and implementing quantum teleportation protocols. By considering instances of a hybrid satellite-fiber network for distributing entangled states between far-off cities and considering currently available quantum processor architectures as networks, we analyze the practical limitations and robustness of real-world quantum networks. For such real-world networks, we present algorithms for different network tasks. Overall, the assessment presented in this work can be used to benchmark the critical parameters in the practical realization of a global-scale quantum internet.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 3, 2024•1 citation
This paper investigates the scalability and transmission efficiency of entanglement swapping protocols within multi-node quantum networks. As the realization of a global quantum internet relies heavily on long-distance entanglement distribution, quantum repeaters utilizing entanglement swapping serve as a critical backbone. However, scalability remains a bottleneck due to photon loss, operational infidelities, and quantum memory coherence times. In this study, we analytically model a multi-node quantum chain and evaluate how the end-to-end entanglement fidelity degrades as the number of intermediate nodes scales up. Our analysis highlights the critical thresholds for Bell state measurement (BSM) success rates required to maintain quantum state integrity across large distances. The findings provide optimization constraints for designing scalable and fault-tolerant routing protocols in future quantum information networks.
The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.
Long-distance quantum networks are far more than mere channels for data transfer; they are sophisticated systems that harness the counterintuitive features of quantum mechanics to enable secure and high-performance communication over vast distances. In our study, we explore the underlying mechanisms of quantum connectivity by investigating phenomena such as superposition and entanglement, and their roles in sustaining robust information propagation. We focus on the interaction between these quantum effects and routing protocols strategies that, while inspired by classical networks, must overcome challenges associated with quantum decoherence and measurement uncertainty. To evaluate these interactions, we simulated distributed quantum networks with node counts ranging from 10 to 100 using novel routing strategies including Q-Learning, Bell State, and Entanglement Swapping protocols. Our analysis centers on key performance metrics that capture both quantum fidelity and operational efficiency. Notably, our results show that high quantum state fidelity is maintained across all network configurations, confirming the efficacy of entangled states in preserving the integrity of quantum information over long distances. Simultaneously, we observe that increased network complexity introduces trade-offs, such as higher computational overhead and amplified susceptibility to decoherence and error propagation. These findings underscore the necessity for advanced error-correction techniques and adaptive routing strategies to ensure scalability and robustness in long-distance quantum communication. Overall, our work provides critical insights into optimizing quantum superposition and entanglement in practical routing implementations, thereby paving the way for the future realization of a global quantum communication infrastructure.
This paper presents a comprehensive study on the scalability challenges and opportunities in quantum communication networks, with the goal of determining parameters that impact networks most as well as the trends that appear when scaling networks. We design simulations of quantum networks comprised of router nodes made up of trapped-ion qubits, separated by quantum repeaters in the form of Bell State Measurement (BSM) nodes. Such networks hold the promise of securely sharing quantum information and enabling high-power distributed quantum computing. Despite the promises, quantum networks encounter scalability issues due to noise and operational errors. Through a modular approach, our research aims to surmount these challenges, focusing on effects from scaling node counts and separation distances while monitoring low-quality communication arising from decoherence effects. We aim to pinpoint the critical features within networks essential for advancing scalable, large-scale quantum computing systems. Our findings underscore the impact of several network parameters on scalability, highlighting a critical insight into the trade-offs between the number of repeaters and the quality of entanglement generated. This paper lays the groundwork for future explorations into optimized quantum network designs and protocols.
In quantum communication networks, the transmission success rate of entangled photons decreases exponentially with the transmission distance in fiber channel. With quantum repeaters, quantum networks can realize arbitrary long-distance links based on quantum entanglement swapping, quantum storage, and quantum teleportation. Thanks to the development of quantum memory technology, the throughput of quantum relay networks can be improved by increasing the number of quantum memories. In this paper, we study the routing metric, the goal of which is to achieve a higher throughput in a long-distance quantum network by reasonably allocating repeater positions with a given memory count between source and destination. A routing metricEEEwas proposed, where the number and distance range of repeater deployments can be obtained by numerical analysis to support an optimal network throughput. According to the above principle, various repeaters were deployed on a linear quantum network to test the effectiveness of the proposed allocation mechanism with the given transmission loss, Bell-State Measurement (BSM) success rate, memory quantity, and distance. The results of evaluation show that increasing the number of repeaters blindly can lead to a waste of resources and a throughput decreasing, which implies that repeaters need to be placed at an appropriate deployment distance to achieve the optimal performance.
First-generation quantum repeaters are essential in distributing entanglement over long distances since they could mitigate losses in optical fiber. Repeaters split the total distance into shorter, easier to generate links. Then, entanglement swapping establishes long range entanglement by performing local measurements at the repeaters and heralding their results. In this work, we develop an analytical model that estimates the impact of decoherence during heralding for a given protocol. Furthermore, we identify a competition between two phenomena: as repeater count increases, so does entanglement generation, but the additive impact of memory decoherence on final entanglement rate increases too. Therefore, we find that an optimal number of repeaters exists. These findings could lead the design of future quantum networks, both in the inter-repeater distance and swapping timings.
The realization of a global-scale quantum internet is hindered by practical challenges such as high photon loss, decoherence, susceptibility to node failure, and others. We analyze [1] the implications of these practical constraints on the scalability and robustness of the quantum Internet. Considering repeater-based quantum networks, we present bottlenecks for distributing resources among multiple end nodes. We use graph theory to assess network robustness and identify its critical nodes and critical length scales. In particular, we consider repeater-based quantum networks and present practical limitations on distilling secret keys via device-independent quantum key distribution (DI-QKD) protocols and other information processing tasks such as sharing of entanglement between the end nodes, performing Bell-CHSH violation experiments, and implementing quantum teleportation protocols. By considering instances of a hybrid satellite-fiber network for distributing entangled states between far-off cities and considering currently available quantum processor architectures as networks, we analyze the practical limitations and robustness of real-world quantum networks. For such real-world networks, we present algorithms for different network tasks. Overall, the assessment presented in this work can be used to benchmark the critical parameters in the practical realization of a global-scale quantum internet.