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

Shanlax International Journal of Arts Science and Humanities

An Adaptive, Simulation-Driven Design of Scalable and Resilient Quantum Internet Systems Using Entanglement- Centric Networking Paradigms

A Neelavathi, A Yogameena

Published Feb 27, 2026• 0 citations
Publisher

Abstract

The realization of a large-scale Quantum Internet is a long-term objective of quantum information science, aiming to interconnect quantum devices through the reliable distribution of entanglement across long distances. Unlike classical networks, quantum networks are constrained by decoherence, probabilistic operations, and the no-cloning theorem, which fundamentally alter network design principles. This paper presents a new simulation-driven study of a scalable and resilient Quantum Internet architecture based on adaptive, entanglement-centric networking. A detailed system model is developed, incorporating realistic quantum channel noise, memory decoherence, and repeater-assisted communication. Novel fidelity-aware routing and resource-adaptive entanglement management strategies are evaluated through extensive simulations. Mathematical models, algorithmic pseudocode, and performance analysis demonstrate how adaptive control significantly improves end-to-end fidelity and network throughput under non-ideal conditions. The results provide actionable design insights for future experimental and large-scale quantum networking deployments.

DOI
10.34293/sijash.v13is3-i1-feb.10263

Related papers

Thermodynamically Constrained Entanglement Routing with Autonomous Error-Aware Control for Scalable Quantum Internet Infrastructure

Payal Mittal, Ayush Mahanta

Decoherence, probabilistic entanglement generation, and finite quantum memory fundamentally limit the scalability of large-scale quantum communication networks. Traditional routing approaches rely on classical path-computation strategies that disregard the physical cost of maintaining quantum coherence, resulting in inefficient resource utilization and degraded network performance. This paper proposes a thermodynamically constrained entanglement routing framework with autonomous, error-aware control for scalable quantum networking infrastructure. The framework defines a composite routing metric that jointly incorporates decoherence rate, entropy production, memory lifetime, and purification overhead, enabling physically informed routing decisions at the network level. Routes are continuously reconfigured by an adaptive control mechanism designed to minimize irreversible resource loss under realistic noise and hardware variability. Simulation results show improved entanglement availability, resource efficiency, and operational stability compared to fidelity-only routing methods, demonstrating a practical path toward resilient, scalable quantum communication systems.

•Aug 1, 2026•0 citations

Making Quantum Networks Work: Routing, Calibration, and Programmable Quantum Repeaters

Vinay Kumar

The quantum internet enables distribution of quantum states across distant nodes, supporting secure communication, distributed computing, and quantum sensing. Unlike classical networks, it is constrained by the no cloning theorem, probabilistic entanglement generation, decoherence, and hardware drift, making classical abstractions inadequate. Scalable quantum networking therefore requires new architectures, protocols, and optimisation methods that explicitly account for these limitations. This thesis studies the architecture, routing, and operation of quantum networks under realistic constraints, focusing on bipartite entanglement distribution over quantum repeater networks. Key metrics include end to end fidelity, throughput, scalability, and fairness. At the network layer, routing strategies are developed beyond assumptions of homogeneous nodes and full network knowledge. Routing under heterogeneous repeater efficiencies shows how partial knowledge of node quality improves fidelity and reduces path blocking. A grey box routing approach is then introduced, where path selection relies only on topology and end to end estimates, achieving robustness and fairness without detailed link information. At the link layer, calibration and hardware drift are addressed through a calibration aware model separating activation and calibration phases. For linear repeater chains, an optimal calibration schedule is derived to balance operation time and calibration overhead. This is extended to general topologies with shared links, where a greedy orchestration heuristic is proposed. Finally, the thesis connects network protocols with hardware via an instruction set architecture for programmable quantum repeater nodes based on NV centers, enabling coherent programmability and linking physical operations to higher layer protocols.

quant-pharXiv:2606.22316•Jun 23, 2026•1 citation

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

Modelling Quantum Networking with Teleportation

Shiva Raj Pokhrel

We present a simple teleportation-based quantum internet framework with a centralized server architecture. Our model formalizes qubit transfer protocols while using stochastic differential equations to capture entanglement decoherence under both Markovian and non-Markovian noise. We quantify key performance metrics-entanglement generation rate, throughput, and security-validating our predictions through Qiskit simulations. The modular design addresses critical quantum networking challenges: fidelity-latency trade-offs, scalable entanglement distribution, and eavesdropping resilience. Future extensions incorporate multi-hop topologies with quantum repeaters and fault-tolerant error correction, establishing a foundation for scalable quantum networks.

IEEE Wireless Communications and Networking Conference•Apr 13, 2026•0 citations

Quantum Network Science: Linking Graph Structure to Entanglement Performance

Rawan AlMakinah, Muhammed Abdullah Canbaz

Quantum communication networks—the substrate of a future quantum Internet—demand analytical tools that account for entanglement, fidelity, and quantum-specific constraints absent from classical models. In this paper, we introduce the Quantum Network Science (QNS) framework that adapts core network metrics to the quantum setting through fidelity-, success-probability-, and capacity-aware weighting. We formalize centrality (including Quantum PageRank and continuous-time quantum-walk variants), community structure on entanglement graphs, and robustness/percolation with fidelity thresholds. The framework is validated via analytic motifs and controlled simulations on Erdős–Rényi, scale-free, and small-world topologies, as well as satellite-assisted versus fiber-only designs. Our results show that (i) fidelity weighting reorders structural importance and can reconnect networks that appear fragmented classically; (ii) heavy-tailed degree patterns improve tolerance to random failures but heighten vulnerability to targeted hub attacks; (iii) small-world shortcuts induced by long-range quantum links shrink path lengths; and (iv) overlapping “connected components” emerge from entanglement swapping, motivating revised connectivity baselines. We also discuss design implications—degree caps and hub hardening, link-type diversity, multipath routing, and buffering policies—and outline extensions to temporal and multilayer modeling that couple the quantum plane with its classical control layer. QNS thus offers a principled, measurement-oriented foundation for analyzing, comparing, and engineering resilient, high-capacity quantum networks.

Proceedings of the AAAI Symposium Series•Nov 23, 2025•1 citation

Fidelity- and Coherence-Aware Entanglement Routing for Regional Quantum Internet Networks

H S Ullas, A Lakshmi, H R Mithun Gowda

The quantum internet enables secure communication, distributed quantum computing, and remote sensing by distributing entanglement among distant nodes [1], [2]. However, establishing end-to-end entanglement across regional networks remains challenging because quantum links experience photon loss, entanglement generation is probabilistic, quantum memories have limited coherence times, and repeater resources are constrained [2], [3]. Conventional shortest-path routing does not jointly account for these quantum-specific limitations. This paper proposes a Fidelity- and Coherence-Aware Dynamic Entanglement Routing (FCADR) framework for regional quantum internet networks. The network is modelled as a graph containing end nodes, quantum repeaters, quantum memories, and lossy entanglement links. FCADR selects routes by jointly considering estimated end-to-end fidelity, entanglement-generation and swapping success probabilities, available quantum-memory capacity, and expected distribution delay. A discrete-event simulation framework is designed to compare FCADR with shortest-path routing, link-success-based routing, and fidelity-aware routing under varying channel loss, coherence time, traffic load, and node or link failures. Performance is evaluated using end-to-end fidelity, request-success rate, distribution delay, memory utilization, and network resilience. The framework aims to improve routing decisions by incorporating quantum-state quality and resource availability into dynamic path selection.

International Journal of Innovative Research in Engineering•Oct 29, 2026•0 citations
The realization of a large-scale Quantum Internet is a long-term objective of quantum information science, aiming to interconnect quantum devices through the reliable distribution of entanglement across long distances. Unlike classical networks, quantum networks are constrained by decoherence, probabilistic operations, and the no-cloning theorem, which fundamentally alter network design principles. This paper presents a new simulation-driven study of a scalable and resilient Quantum Internet architecture based on adaptive, entanglement-centric networking. A detailed system model is developed, incorporating realistic quantum channel noise, memory decoherence, and repeater-assisted communication. Novel fidelity-aware routing and resource-adaptive entanglement management strategies are evaluated through extensive simulations. Mathematical models, algorithmic pseudocode, and performance analysis demonstrate how adaptive control significantly improves end-to-end fidelity and network throughput under non-ideal conditions. The results provide actionable design insights for future experimental and large-scale quantum networking deployments.
Decoherence, probabilistic entanglement generation, and finite quantum memory fundamentally limit the scalability of large-scale quantum communication networks. Traditional routing approaches rely on classical path-computation strategies that disregard the physical cost of maintaining quantum coherence, resulting in inefficient resource utilization and degraded network performance. This paper proposes a thermodynamically constrained entanglement routing framework with autonomous, error-aware control for scalable quantum networking infrastructure. The framework defines a composite routing metric that jointly incorporates decoherence rate, entropy production, memory lifetime, and purification overhead, enabling physically informed routing decisions at the network level. Routes are continuously reconfigured by an adaptive control mechanism designed to minimize irreversible resource loss under realistic noise and hardware variability. Simulation results show improved entanglement availability, resource efficiency, and operational stability compared to fidelity-only routing methods, demonstrating a practical path toward resilient, scalable quantum communication systems.
The quantum internet enables distribution of quantum states across distant nodes, supporting secure communication, distributed computing, and quantum sensing. Unlike classical networks, it is constrained by the no cloning theorem, probabilistic entanglement generation, decoherence, and hardware drift, making classical abstractions inadequate. Scalable quantum networking therefore requires new architectures, protocols, and optimisation methods that explicitly account for these limitations. This thesis studies the architecture, routing, and operation of quantum networks under realistic constraints, focusing on bipartite entanglement distribution over quantum repeater networks. Key metrics include end to end fidelity, throughput, scalability, and fairness. At the network layer, routing strategies are developed beyond assumptions of homogeneous nodes and full network knowledge. Routing under heterogeneous repeater efficiencies shows how partial knowledge of node quality improves fidelity and reduces path blocking. A grey box routing approach is then introduced, where path selection relies only on topology and end to end estimates, achieving robustness and fairness without detailed link information. At the link layer, calibration and hardware drift are addressed through a calibration aware model separating activation and calibration phases. For linear repeater chains, an optimal calibration schedule is derived to balance operation time and calibration overhead. This is extended to general topologies with shared links, where a greedy orchestration heuristic is proposed. Finally, the thesis connects network protocols with hardware via an instruction set architecture for programmable quantum repeater nodes based on NV centers, enabling coherent programmability and linking physical operations to higher layer protocols.
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.
We present a simple teleportation-based quantum internet framework with a centralized server architecture. Our model formalizes qubit transfer protocols while using stochastic differential equations to capture entanglement decoherence under both Markovian and non-Markovian noise. We quantify key performance metrics-entanglement generation rate, throughput, and security-validating our predictions through Qiskit simulations. The modular design addresses critical quantum networking challenges: fidelity-latency trade-offs, scalable entanglement distribution, and eavesdropping resilience. Future extensions incorporate multi-hop topologies with quantum repeaters and fault-tolerant error correction, establishing a foundation for scalable quantum networks.
Quantum communication networks—the substrate of a future quantum Internet—demand analytical tools that account for entanglement, fidelity, and quantum-specific constraints absent from classical models. In this paper, we introduce the Quantum Network Science (QNS) framework that adapts core network metrics to the quantum setting through fidelity-, success-probability-, and capacity-aware weighting. We formalize centrality (including Quantum PageRank and continuous-time quantum-walk variants), community structure on entanglement graphs, and robustness/percolation with fidelity thresholds. The framework is validated via analytic motifs and controlled simulations on Erdős–Rényi, scale-free, and small-world topologies, as well as satellite-assisted versus fiber-only designs. Our results show that (i) fidelity weighting reorders structural importance and can reconnect networks that appear fragmented classically; (ii) heavy-tailed degree patterns improve tolerance to random failures but heighten vulnerability to targeted hub attacks; (iii) small-world shortcuts induced by long-range quantum links shrink path lengths; and (iv) overlapping “connected components” emerge from entanglement swapping, motivating revised connectivity baselines. We also discuss design implications—degree caps and hub hardening, link-type diversity, multipath routing, and buffering policies—and outline extensions to temporal and multilayer modeling that couple the quantum plane with its classical control layer. QNS thus offers a principled, measurement-oriented foundation for analyzing, comparing, and engineering resilient, high-capacity quantum networks.
The quantum internet enables secure communication, distributed quantum computing, and remote sensing by distributing entanglement among distant nodes [1], [2]. However, establishing end-to-end entanglement across regional networks remains challenging because quantum links experience photon loss, entanglement generation is probabilistic, quantum memories have limited coherence times, and repeater resources are constrained [2], [3]. Conventional shortest-path routing does not jointly account for these quantum-specific limitations. This paper proposes a Fidelity- and Coherence-Aware Dynamic Entanglement Routing (FCADR) framework for regional quantum internet networks. The network is modelled as a graph containing end nodes, quantum repeaters, quantum memories, and lossy entanglement links. FCADR selects routes by jointly considering estimated end-to-end fidelity, entanglement-generation and swapping success probabilities, available quantum-memory capacity, and expected distribution delay. A discrete-event simulation framework is designed to compare FCADR with shortest-path routing, link-success-based routing, and fidelity-aware routing under varying channel loss, coherence time, traffic load, and node or link failures. Performance is evaluated using end-to-end fidelity, request-success rate, distribution delay, memory utilization, and network resilience. The framework aims to improve routing decisions by incorporating quantum-state quality and resource availability into dynamic path selection.