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

World Conference on Communication & Computing (WCONF)

An Ultimate Benchmark for the Optimal Performance of Quantum Communication Network Using Multi Path Routing Protocol

Jatin Khurana

Published Jul 14, 2023• 0 citations
Publisher

Abstract

In recent years, quantum communication networks have emerged as a promising alternative to classical communication networks for the transmission of quantum information. One of the challenges for achieving optimal performance in quantum communication networks is the efficient routing of quantum signals across multiple paths. To address this, a variety of routing protocols have been proposed, including multi-path routing protocols. Multi-path routing involves sending a quantum signal through multiple distinct paths simultaneously to reduce delays in the transmission of quantum information. By distributing the quantum information over multiple paths, this approach can provide significant performance improvements, including reduced latency and higher throughput. In addition, multi-path routing can enable new possibilities for the security of quantum communication networks, such as more secure entanglement swapping protocols and improved protection against eavesdropping. In this paper, we investigate the performance of multi-path routing protocols in multi-node quantum communication networks. We consider two approaches to multi-path routing, a basic routing approach based on shortest path optimization, and a more advanced approach based on graph partitions. We evaluate the performance of these protocols in a range of multi-node networks, with focus on the trade-off between latency and throughput. The results show that multi-path routing yields significant performance improvements in such networks and provides an efficient way for routing quantum signals across multiple paths.

DOI
10.1109/wconf58270.2023.10235158

Related papers

Quantum Network Multi-Path Communication Optimization

Jincheng Zhang

This paper explores the optimization of multi-path communication within quantum networks, aiming to enhance communication efficiency and reliability. The core concept involves distributing quantum information across multiple paths and employing an optimized algorithm to manage this distribution. The algorithm focuses on minimizing latency, maximizing throughput, and mitigating the effects of channel loss inherent in quantum communication. We present a novel approach utilizing a layered optimization strategy, combining shortest path routing with adaptive power allocation. Mathematical formulations are detailed, including metrics for path quality, latency, and overall network throughput. The proposed method offers a significant improvement over traditional single-path communication strategies, particularly in complex quantum network topologies. Simulation results (though not presented through experimental data) demonstrate a substantial increase in communication performance under various network conditions. Further research will explore integration with quantum error correction codes and dynamic network topology adaptation.

•Sep 5, 2026•0 citations

Multi-path Security in Quantum Networks with Trusted Nodes

Muhammad Kumail Haider, Aeysha Khalique

Quantum communication networks promise information-theoretic security but this security collapses if intermediate relay nodes are compromised, a risk that grows sharply when compromised nodes cannot be identified. We address this twofold: first, we show that multi-path routing provides quantifiable protection against unidentified compromised nodes. Second, we provide a comprehensive statistical and graph-theoretic analysis of network and node security under compromise, covering full and partial node compromise, optimal placement of additional edges via an iterative method, and comparative hacking-probability analysis across network topologies. Together, these results identify the topology and multi-path routing strategy that most improves security for a given network. We apply this framework to quantum key distribution across multiple network topologies, demonstrating a scalable route to secure, reliable quantum communication under realistic, unidentified adversarial threats, without relying on quantum memory.

quant-pharXiv:2610.26120•Oct 20, 2026•0 citations

Quantum Multi-Path Communication Protocol Based on Maximum Flow Theory

Jihao Fan, Liang Huang, Jun Li +2 more

Quantum networks are an actively researched and promising field, aiming to achieve efficient quantum information transmission by interconnecting quantum nodes. In large-scale quantum networks, end-to-end throughput is a critical factor that affects the overall performance of the network. The maximum flow problem, extensively studied in classical network theory, identifies a set of paths between the source and destination nodes that maximizes the total flow. This study extends the maximum flow problem to quantum networks, focusing on coordinating multiple paths for multi-path quantum communication. We propose a Quantum Multi-Path Communication Protocol (QMCP) that employs maximum flow theory to allocate transmission resources across multiple nodes efficiently, thus maximizing the total transmission capacity from the source to the destination. Our evaluation demonstrates that QMCP significantly enhances end-to-end throughput in quantum networks.

IEEE International Conference on Acoustics Speech and Signal Processing•Mar 12, 2025•0 citations

Optimizing Grover's Algorithm for Routing in Quantum Wireless Communication Networks

Lisha Liu, Xincan Fan

This paper presents a novel approach to optimizing Grover’s algorithm for addressing the routing problem in quantum wireless communication networks. We begin by conducting a comprehensive analysis of key quantum communication technologies, including quantum teleportation and quantum entanglement swapping, and subsequently construct a quantum wireless communication network model grounded in these principles. Building on this foundation, we design and implement a multi-level quantum wireless network information transmission mechanism, incorporating quantum channels for identity authentication to ensure secure communication. Focusing on the routing challenges in quantum wireless communication networks, we propose innovative applications and optimizations of Grover’s quantum search algorithm. Specifically, we introduce an improved algorithm that efficiently searches for routing paths with maximal metrics within a limited number of hops. This enhancement not only significantly increases routing efficiency but also mitigates the risk of quantum channel disconnection caused by the depletion of entangled quantum pairs, thereby improving the overall success rate of communication. Simulation and experimental results demonstrate that the proposed optimization algorithm substantially enhances the routing performance of quantum wireless communication networks while maintaining robust security measures. This study offers a new solution to the routing challenges in quantum wireless communication networks and significantly optimizes Grover’s algorithm, contributing to the development of more efficient and reliable quantum communication networks.

網際網路技術學刊•Nov 26, 2024•2 citations

Quantum networks with coherent routing of information through multiple nodes

Hlér Kristjánsson, Yan Zhong, Anthony Munson +1 more

Large-scale communication networks, such as the Internet, rely on routing packets of data through multiple intermediate nodes to transmit information from a sender to a receiver. In this paper, we develop a model of a quantum communication network that routes information simultaneously along multiple paths passing through intermediate stations. We demonstrate that a quantum routing approach can in principle extend the distance over which information can be transmitted reliably. Surprisingly, the benefit of quantum routing also applies to the transmission of classical information: even if the transmitted data is purely classical, delocalising it on multiple routes can enhance the achievable transmission distance. Our findings highlight the potential of a future quantum internet not only for achieving secure quantum communication and distributed quantum computing but also for extending the range of classical data transmission.

arXiv:2208.00480•npj Quantum Information•Dec 20, 2024•9 citations

Quantum Entanglement-Routed Algorithms

Jincheng Zhang

This paper proposes a novel approach to network routing leveraging the unique properties of quantum entanglement. The core claim is that quantum entanglement provides the potential for instantaneous information routing, surpassing the limitations imposed by classical communication channels. The proposed algorithm, a entanglement-based routing method, encodes data across multiple entangled quantum particles, exploiting the correlations inherent in entanglement to achieve instantaneous data transmission and routing within a network. This approach offers the possibility of drastically improved throughput and enhanced security compared to conventional routing protocols. The theoretical framework presented demonstrates the potential for a fundamentally new paradigm in network architecture and communication. Key parameters influencing performance are analyzed, including entanglement fidelity, number of entangled particles, and network topology. The ultimate goal is to establish a robust and scalable quantum routing system.

•Sep 2, 2026•0 citations
In recent years, quantum communication networks have emerged as a promising alternative to classical communication networks for the transmission of quantum information. One of the challenges for achieving optimal performance in quantum communication networks is the efficient routing of quantum signals across multiple paths. To address this, a variety of routing protocols have been proposed, including multi-path routing protocols. Multi-path routing involves sending a quantum signal through multiple distinct paths simultaneously to reduce delays in the transmission of quantum information. By distributing the quantum information over multiple paths, this approach can provide significant performance improvements, including reduced latency and higher throughput. In addition, multi-path routing can enable new possibilities for the security of quantum communication networks, such as more secure entanglement swapping protocols and improved protection against eavesdropping. In this paper, we investigate the performance of multi-path routing protocols in multi-node quantum communication networks. We consider two approaches to multi-path routing, a basic routing approach based on shortest path optimization, and a more advanced approach based on graph partitions. We evaluate the performance of these protocols in a range of multi-node networks, with focus on the trade-off between latency and throughput. The results show that multi-path routing yields significant performance improvements in such networks and provides an efficient way for routing quantum signals across multiple paths.
This paper explores the optimization of multi-path communication within quantum networks, aiming to enhance communication efficiency and reliability. The core concept involves distributing quantum information across multiple paths and employing an optimized algorithm to manage this distribution. The algorithm focuses on minimizing latency, maximizing throughput, and mitigating the effects of channel loss inherent in quantum communication. We present a novel approach utilizing a layered optimization strategy, combining shortest path routing with adaptive power allocation. Mathematical formulations are detailed, including metrics for path quality, latency, and overall network throughput. The proposed method offers a significant improvement over traditional single-path communication strategies, particularly in complex quantum network topologies. Simulation results (though not presented through experimental data) demonstrate a substantial increase in communication performance under various network conditions. Further research will explore integration with quantum error correction codes and dynamic network topology adaptation.
Quantum communication networks promise information-theoretic security but this security collapses if intermediate relay nodes are compromised, a risk that grows sharply when compromised nodes cannot be identified. We address this twofold: first, we show that multi-path routing provides quantifiable protection against unidentified compromised nodes. Second, we provide a comprehensive statistical and graph-theoretic analysis of network and node security under compromise, covering full and partial node compromise, optimal placement of additional edges via an iterative method, and comparative hacking-probability analysis across network topologies. Together, these results identify the topology and multi-path routing strategy that most improves security for a given network. We apply this framework to quantum key distribution across multiple network topologies, demonstrating a scalable route to secure, reliable quantum communication under realistic, unidentified adversarial threats, without relying on quantum memory.
Quantum networks are an actively researched and promising field, aiming to achieve efficient quantum information transmission by interconnecting quantum nodes. In large-scale quantum networks, end-to-end throughput is a critical factor that affects the overall performance of the network. The maximum flow problem, extensively studied in classical network theory, identifies a set of paths between the source and destination nodes that maximizes the total flow. This study extends the maximum flow problem to quantum networks, focusing on coordinating multiple paths for multi-path quantum communication. We propose a Quantum Multi-Path Communication Protocol (QMCP) that employs maximum flow theory to allocate transmission resources across multiple nodes efficiently, thus maximizing the total transmission capacity from the source to the destination. Our evaluation demonstrates that QMCP significantly enhances end-to-end throughput in quantum networks.
This paper presents a novel approach to optimizing Grover’s algorithm for addressing the routing problem in quantum wireless communication networks. We begin by conducting a comprehensive analysis of key quantum communication technologies, including quantum teleportation and quantum entanglement swapping, and subsequently construct a quantum wireless communication network model grounded in these principles. Building on this foundation, we design and implement a multi-level quantum wireless network information transmission mechanism, incorporating quantum channels for identity authentication to ensure secure communication. Focusing on the routing challenges in quantum wireless communication networks, we propose innovative applications and optimizations of Grover’s quantum search algorithm. Specifically, we introduce an improved algorithm that efficiently searches for routing paths with maximal metrics within a limited number of hops. This enhancement not only significantly increases routing efficiency but also mitigates the risk of quantum channel disconnection caused by the depletion of entangled quantum pairs, thereby improving the overall success rate of communication. Simulation and experimental results demonstrate that the proposed optimization algorithm substantially enhances the routing performance of quantum wireless communication networks while maintaining robust security measures. This study offers a new solution to the routing challenges in quantum wireless communication networks and significantly optimizes Grover’s algorithm, contributing to the development of more efficient and reliable quantum communication networks.
Large-scale communication networks, such as the Internet, rely on routing packets of data through multiple intermediate nodes to transmit information from a sender to a receiver. In this paper, we develop a model of a quantum communication network that routes information simultaneously along multiple paths passing through intermediate stations. We demonstrate that a quantum routing approach can in principle extend the distance over which information can be transmitted reliably. Surprisingly, the benefit of quantum routing also applies to the transmission of classical information: even if the transmitted data is purely classical, delocalising it on multiple routes can enhance the achievable transmission distance. Our findings highlight the potential of a future quantum internet not only for achieving secure quantum communication and distributed quantum computing but also for extending the range of classical data transmission.
This paper proposes a novel approach to network routing leveraging the unique properties of quantum entanglement. The core claim is that quantum entanglement provides the potential for instantaneous information routing, surpassing the limitations imposed by classical communication channels. The proposed algorithm, a entanglement-based routing method, encodes data across multiple entangled quantum particles, exploiting the correlations inherent in entanglement to achieve instantaneous data transmission and routing within a network. This approach offers the possibility of drastically improved throughput and enhanced security compared to conventional routing protocols. The theoretical framework presented demonstrates the potential for a fundamentally new paradigm in network architecture and communication. Key parameters influencing performance are analyzed, including entanglement fidelity, number of entangled particles, and network topology. The ultimate goal is to establish a robust and scalable quantum routing system.