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

Quantum Networking

Rodney Van Meter

Published May 9, 2014• 89 citations
OpenAlex

Abstract

Quantum networks build on entanglement and quantum measurement to achieve tasks that are beyond the reach of classical systems. Using quantum effects, we can detect the presence of eavesdroppers, raise the sensitivity of scientific instruments such as telescopes, or teleport quantum data from one location to another. Long-distance entanglement can be used to execute important tasks such as Byzantine agreement and leader election in fewer rounds of communication than classical systems, improving the efficiency of operations that are critical in distributed systems.

Related papers

Quantum networking and internetworking

Rodney Van Meter

Quantum networks build on entanglement and quantum measurement to bring new capabilities to communication systems. Quantum physical effects can be used to detect eavesdropping, to improve the shared sensitivity of separated astronomical instruments, or to create distributed states that will enable numerical quantum computation over a distance using teleportation. Because quantum data is fragile and some quantum operations are probabilistic, errors and distributed calculations must be managed aggressively and perhaps cooperatively among nodes. Solutions to these problems will have both similarities to and differences from purely classical networks. Architectures for large-scale quantum networking and internetworking are in development, paralleling theoretical and experimental work on physical layers and low-level error management and connection technologies. With unentangled quantum networks already deployed, entangled networks may appear within the next few years and will form a vibrant research topic in the coming decade.

IEEE Network•Jan 1, 2012•57 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

Byzantine Resilient Multi Criteria Leader Election in Quantum Communication Networks Using VIKOR

Suresh Kumar Jha, Ketan Anand, Aditya Narayan Hati

In developing quantum-classical network infrastructures, where coordination, entanglement distribution, and time-sensitive control rely on a stable and reliable coordinator, reliable leader election is crucial. In this work, we present VIKOR-BFT, a leader election scheme that integrates a lightweight data-sanitization stage with the VIKOR multi-criteria ranking mechanism to improve resilience against Byzantine behaviour. To understand its practical behaviour, we developed a Python-based prototype and evaluated the protocol under a range of adversarial and high-load scenarios. The study indicates that VIKOR-BFT keeps latency growth moderate even as the network scales and sustains throughput values above 100 tx/s in networks of roughly 500 nodes. In comparison with PBFT and an optimized PBFT variant, the proposed method reduces message complexity by almost two orders of magnitude without compromising the correctness of leader selection. Under 15% and 25% Byzantine participation, the protocol continues to select an honest leader in more than 90% and 75% of the trials, respectively. Overall, the findings suggest that VIKOR-BFT provides a scalable and practically viable option for secure leader election in hybrid quantum-classical communication environments.

International Conference on Pioneering Developments in Computer Science & Digital Technologies (IC2SDT)•Dec 4, 2025•1 citation

Laying the Foundations for Quantum Networks: An Overview of Principles, Progress, and Prospects

Neal Xiong, Chanchan Kuang, Silong Li +2 more

Driven by quantum superposition and entanglement, the swift advancement of quantum computing has highlighted the limitations of classical computation. As a solution, Quantum Networks (QNs) have emerged, offering high-quality entanglement connections and reliable quantum state transmission, enabling a range of applications that exceed the limitations of classical data networks, including quantum communication and distributed quantum computing (DQC). This article delves into key components and concepts such as quantum entanglement, quantum decoherence and entanglement distribution. It then explores quantum remote secure communication technologies, including quantum teleportation, quantum key distribution (QKD), quantum dense coding, quantum repeater technology, and quantum satellite communication. We also provide a detailed introduction to quantum remote entanglement distribution and quantum entanglement routing design, including current research progress and a discussion on the challenges and existing solutions for constructing large-scale QNs. The aim of this article is to provide readers with a fundamental understanding of QNs, an assessment of current research, and insights into the main challenges and solutions in this emerging field. Through these discussions, we hope to help readers better understand the potential and future direction of QNs.

網際網路技術學刊•Sep 29, 2026•0 citations

Synchronous Distributed Key Generation without Broadcasts

Nibesh Shrestha, Adithya Bhat, Aniket Kate +1 more

Distributed key generation (DKG) is a key building block in developing many efficient threshold cryptosystems. This work initiates the study of communication complexity and round complexity of DKG protocols over a point-to-point (bounded) synchronous network. Our key result is the first synchronous DKG protocol for discrete log-based cryptosystems with O ( κ n 3 ) communication complexity ( κ denotes a security parameter) that tolerates any t < n / 2 Byzantine faults among n parties. We present two variants of the protocol: (i) a protocol with worst-case O ( κ n 3 ) communication and O ( t ) rounds, and (ii) a protocol with expected O ( κ n 3 ) communication and expected constant rounds. In the process of achieving our results, we design (1) a novel weak gradecast protocol with a communication complexity of O ( κ n 2 ) for linear-sized inputs and constant rounds, (2) a protocol called “recoverable-set-of-shares” for ensuring recovery of shared secrets, (3) an oblivious leader election protocol with O ( κ n 3 ) communication and constant rounds, and (4) a multi-valued validated Byzantine agreement (MVBA) protocol with O ( κ n 3 ) communication complexity for linear-sized inputs and expected constant rounds. Each of these primitives is of independent interest.

IACR Communications in Cryptology•Jul 8, 2024•4 citations

Quantum Communications and Networking: Series 1

Ruidong Li, Prineha Narang, Melchior Aelmans +2 more

Quantum communication researchers have achieved significant progress during the recent decades and quantum networking has shown promise in terms of improving the overall functional benefits of the Internet and enabling applications with no counterpart in the classical world. It is a breakthrough technology towards the unimaginable future. In a quantum network, the source and destination may be connected by quantum repeaters/routers for facilitating qubit transmissions. The quantum network of the future is envisaged to pervade the entire globe, relying on terrestrial components, satellites, airplanes, ships and other vehicles. It is anticipated that it will support nearly unconditional security, super-computing power, large network capacity-even at high velocity-and privacy.

IEEE Network•Jan 1, 2024•2 citations
Quantum networks build on entanglement and quantum measurement to achieve tasks that are beyond the reach of classical systems. Using quantum effects, we can detect the presence of eavesdroppers, raise the sensitivity of scientific instruments such as telescopes, or teleport quantum data from one location to another. Long-distance entanglement can be used to execute important tasks such as Byzantine agreement and leader election in fewer rounds of communication than classical systems, improving the efficiency of operations that are critical in distributed systems.
Quantum networks build on entanglement and quantum measurement to bring new capabilities to communication systems. Quantum physical effects can be used to detect eavesdropping, to improve the shared sensitivity of separated astronomical instruments, or to create distributed states that will enable numerical quantum computation over a distance using teleportation. Because quantum data is fragile and some quantum operations are probabilistic, errors and distributed calculations must be managed aggressively and perhaps cooperatively among nodes. Solutions to these problems will have both similarities to and differences from purely classical networks. Architectures for large-scale quantum networking and internetworking are in development, paralleling theoretical and experimental work on physical layers and low-level error management and connection technologies. With unentangled quantum networks already deployed, entangled networks may appear within the next few years and will form a vibrant research topic in the coming decade.
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.
In developing quantum-classical network infrastructures, where coordination, entanglement distribution, and time-sensitive control rely on a stable and reliable coordinator, reliable leader election is crucial. In this work, we present VIKOR-BFT, a leader election scheme that integrates a lightweight data-sanitization stage with the VIKOR multi-criteria ranking mechanism to improve resilience against Byzantine behaviour. To understand its practical behaviour, we developed a Python-based prototype and evaluated the protocol under a range of adversarial and high-load scenarios. The study indicates that VIKOR-BFT keeps latency growth moderate even as the network scales and sustains throughput values above 100 tx/s in networks of roughly 500 nodes. In comparison with PBFT and an optimized PBFT variant, the proposed method reduces message complexity by almost two orders of magnitude without compromising the correctness of leader selection. Under 15% and 25% Byzantine participation, the protocol continues to select an honest leader in more than 90% and 75% of the trials, respectively. Overall, the findings suggest that VIKOR-BFT provides a scalable and practically viable option for secure leader election in hybrid quantum-classical communication environments.
Driven by quantum superposition and entanglement, the swift advancement of quantum computing has highlighted the limitations of classical computation. As a solution, Quantum Networks (QNs) have emerged, offering high-quality entanglement connections and reliable quantum state transmission, enabling a range of applications that exceed the limitations of classical data networks, including quantum communication and distributed quantum computing (DQC). This article delves into key components and concepts such as quantum entanglement, quantum decoherence and entanglement distribution. It then explores quantum remote secure communication technologies, including quantum teleportation, quantum key distribution (QKD), quantum dense coding, quantum repeater technology, and quantum satellite communication. We also provide a detailed introduction to quantum remote entanglement distribution and quantum entanglement routing design, including current research progress and a discussion on the challenges and existing solutions for constructing large-scale QNs. The aim of this article is to provide readers with a fundamental understanding of QNs, an assessment of current research, and insights into the main challenges and solutions in this emerging field. Through these discussions, we hope to help readers better understand the potential and future direction of QNs.
Distributed key generation (DKG) is a key building block in developing many efficient threshold cryptosystems. This work initiates the study of communication complexity and round complexity of DKG protocols over a point-to-point (bounded) synchronous network. Our key result is the first synchronous DKG protocol for discrete log-based cryptosystems with O ( κ n 3 ) communication complexity ( κ denotes a security parameter) that tolerates any t < n / 2 Byzantine faults among n parties. We present two variants of the protocol: (i) a protocol with worst-case O ( κ n 3 ) communication and O ( t ) rounds, and (ii) a protocol with expected O ( κ n 3 ) communication and expected constant rounds. In the process of achieving our results, we design (1) a novel weak gradecast protocol with a communication complexity of O ( κ n 2 ) for linear-sized inputs and constant rounds, (2) a protocol called “recoverable-set-of-shares” for ensuring recovery of shared secrets, (3) an oblivious leader election protocol with O ( κ n 3 ) communication and constant rounds, and (4) a multi-valued validated Byzantine agreement (MVBA) protocol with O ( κ n 3 ) communication complexity for linear-sized inputs and expected constant rounds. Each of these primitives is of independent interest.
Quantum communication researchers have achieved significant progress during the recent decades and quantum networking has shown promise in terms of improving the overall functional benefits of the Internet and enabling applications with no counterpart in the classical world. It is a breakthrough technology towards the unimaginable future. In a quantum network, the source and destination may be connected by quantum repeaters/routers for facilitating qubit transmissions. The quantum network of the future is envisaged to pervade the entire globe, relying on terrestrial components, satellites, airplanes, ships and other vehicles. It is anticipated that it will support nearly unconditional security, super-computing power, large network capacity-even at high velocity-and privacy.