Abstract Quantum networks are a fundamental component of quantum technologies, playing a pivotal role in advancing distributed quantum computing and laying the groundwork for the future quantum internet. They offer a scalable modular architecture for quantum chips and support infrastructure for measurement-based quantum computing. Furthermore, quantum networks serve as the backbone of the quantum internet, ensuring high levels of security. Notably, the advantages of quantum networks in communication are contingent upon entanglement distribution, which faces challenges such as high latency in protocols relying on Bell pair distribution and bipartite entanglement swapping. Additionally, algorithms designed for multipartite entanglement routing encounter intractability issues, rendering them unsolvable within polynomial time. In this paper, we explore a novel approach to distribute graph states in quantum networks, leveraging local quantum coding (LQC) isometries and multipartite states transfer. We also present single-use bounds for stabilizer states distribution. Analogous to network coding, these bounds are attainable when appropriate isometries and stabilizer codes are selected for relay nodes, resulting in reduced latency in entanglement distribution. We further demonstrate the protocol’s advantages across various network performance metrics.
Abstract Quantum networks are a fundamental component of quantum technologies, playing a pivotal role in advancing distributed quantum computing and laying the groundwork for the future quantum internet. They offer a scalable modular architecture for quantum chips and support infrastructure for measurement-based quantum computing. Furthermore, quantum networks serve as the backbone of the quantum internet, ensuring high levels of security. Notably, the advantages of quantum networks in communication are contingent upon entanglement distribution, which faces challenges such as high latency in protocols relying on Bell pair distribution and bipartite entanglement swapping. Additionally, algorithms designed for multipartite entanglement routing encounter intractability issues, rendering them unsolvable within polynomial time. In this paper, we explore a novel approach to distribute graph states in quantum networks, leveraging local quantum coding (LQC) isometries and multipartite states transfer. We also present single-use bounds for stabilizer states distribution. Analogous to network coding, these bounds are attainable when appropriate isometries and stabilizer codes are selected for relay nodes, resulting in reduced latency in entanglement distribution. We further demonstrate the protocol’s advantages across various network performance metrics.
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links, enabling more efficient quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network, then classical network coding is applied to enable quantum teleportation while overcoming network bottlenecks and minimizing qubit requirements for individual nodes. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving a quantum state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.
Quantum networks play a pivotal role in quantum information science, which not only provide a secure communication platform for remote access to quantum computers but also serve as the strategic core for achieving large-scale quantum information processing, forming the foundational infrastructure for the future global-scale quantum internet. Quantum teleportation, which enables the transmission of unknown quantum states over long distances by employing quantum entanglement together with classical communication, is essential for the distribution of quantum resources in the construction of the global-scale quantum internet. To realize a global-scale quantum internet, quantum repeater protocols represent one of the most promising approaches for enabling quantum communication between any nodes. This concise review presents representative experimental demonstrations of quantum teleportation for constructing quantum networks across different physical platforms. Along this trajectory, the review discusses current challenges, open issues, and future perspectives toward scalable and practical quantum internet.
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which are still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper proposes an efficient entanglement distribution protocol for classical-quantum networks with a limited number of quantum links, enabling quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping and classical network coding to distribute entanglements efficiently while overcoming bottlenecks and minimizing qubit and link usage. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving the teleported state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.
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.
Abstract - Quantum networking represents one of the most transformative developments in modern secure communication. Unlike classical networks that rely on mathematical encryption, quantum networks exploit the physical properties of qubits—superposition, entanglement, and the no-cloning theorem—to establish communication channels that are inherently tamper-evident. As quantum technologies mature, applications such as quantum key distribution (QKD), quantum repeaters, quantum teleportation, quantum memory systems, and quantum internet protocols are gaining global traction. This paper consolidates current progress in quantum networking technologies and provides an extended discussion of recent advancements in protocols, hardware components, integrated photonic systems, and machine-learning-enhanced architectures. Additionally, results synthesized from established literature, illustrate performance trends, security gains, and practical deployment challenges in quantum communication networks. The paper also outlines future directions toward scalable quantum internets, hybrid quantum-classical infrastructures, error-corrected qubit networks, satellite-based QKD, and intelligent routing systems. Overall, quantum networking is positioned to redefine the future of secure data transfer, distributed computing, and global communication infrastructures. Key Words: Quantum networking, Quantum Key Distribution (QKD), Entanglement Distribution, Integrated Photonic Chips, Machine Learning (ML)
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.