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

IEEE Wireless Communications and Networking Conference

mQUIET: Maximum Quantum Communication Network Transmission Under Reliability Constraint

Wei An, Yanni Han, Ying Ding, Haiyong Xu, Jibin Wang, Xin Wang, Bo An

Published Apr 21, 2024• 1 citation
Publisher

Abstract

Quantum communications using entangled photons as qubits offer a promising approach to quantum key distribution, enhancing network security. However, establishing successful entanglement links between distant nodes is challenging due to factors like distance and rapid entanglement decay, resulting in low network transmission efficiency for quantum key distribution. This paper studies the problem of finding the maximum quantum communication network transmission scheme for multiple source-destination pairs with considering the success rate of quantum entangle establishments. We propose the Feasible Quantum Communication Network Transmission (fQUIET) algorithm, which leverages network transformation and auxiliary network construction. The Maximum Quantum commUnIcation nEtwork Transmission (mQUIET) algorithm is further proposed by iteratively searching for augmenting paths. Through theoretical analysis, we demonstrate that the mQUIET algorithm is capable of achieving the maximum QCN transmission scheme. Extensive experiments are carried out and the results reveal that our suggested algorithms have superior performance compared to existing methods.

DOI
10.1109/wcnc57260.2024.10570729

Related papers

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

Maximization of Entanglement Sharing in Quantum Communication Networks with Fidelity Requirements

Zain Ali, Zouheir Rezki, Hamid R. Sadjadpour

The unbreakable security and higher data rates offered by quantum communication networks have made quantum communication an inevitable necessity of the future. Many quantum communication frameworks, such as quantum key distribution and super dense coding, require entangled pairs to be shared between the source and destination nodes. Communication nodes in quantum networks have a minimum fidelity requirement for the entangled pairs. If the fidelity requirement is not satisfied, the entangled pairs may not be used for the desired operations. Successful sharing of the entangled pairs between the nodes is a crucial step in making quantum communication practical. In this work, we propose a framework to maximize entanglement sharing between a source and multiple destination nodes in a fair manner. We consider a system that takes advantage of the purification process to improve the fidelity of the entangled pairs when necessary. The proposed solution framework provides the optimal number of entangled pairs required for the purification process and the optimal transmission rate at the source node to achieve the desired system objective. The non-convex problem is first transformed into a convex form, and then a Lagrangian dual-based framework is proposed to find the optimal solution values. Moreover, to optimize the number of entangled pairs for purification at each link, we derive a closed-form expression that provides the optimal value in a single step. Selected simulation results demonstrate that the proposed framework exhibits excellent performance.

Globecom•Dec 8, 2024•1 citation

Constant Fidelity Entanglement Flow in Quantum Communication Networks

Tan Bacinoglu, Burhan Gülbahar, Özgür B. Akan

Entanglement distribution over long distances is one of the main problems in the existing quantum communication networks. Most of the existing methods of establishing entanglement paired link (Einstein, Podolsky, Rosen - EPR pairs) between distant nodes assume symmetric network topologies comprised of links with identical EPR generation capacities. In this work, the entanglement rate capacity of randomly distributed quantum ad hoc networks is investigated. To this end, constant fidelity maximum flow (CFMF) of entanglement problem is defined, and its theoretical analysis is presented. A new heuristic algorithm, i.e., Entanglement Swapping Scheme Search (ESSS), is presented to find the best possible swapping scheme over a multi-hop entanglement path. Furthermore, Shortest Path Entanglement Flow (SPEF) algorithm is introduced as an effective heuristic solution for this problem. Analysis shows that there is a trade-off between the desired constant target fidelity and the entanglement generation rate (maximum flow) of the network.

Globecom•Dec 1, 2010•12 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

Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks

Mahdi M. Chehimi, Walid Saad

Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. These networks have an inherent feature of parallelism that allows them to boost the capacity and enhance the security of communication systems. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes. However, to reap the benefits of entanglement and enable efficient quantum communication, the number of generated entangled pairs must be optimized. Indeed, if the entanglement generation rates are not optimized, then some of these valuable resources will be discarded and lost. In this paper, the problem of optimizing the entanglement generation rates and their distribution over a quantum memory is studied. In particular, a quantum network in which users have heterogeneous distances and applications is considered. This problem is posed as a mixed integer nonlinear programming optimization problem whose goal is to efficiently utilize the available quantum memory by distributing the quantum entangled pairs in a way that maximizes the user satisfaction. An interior point optimization method is used to solve the optimization problem and extensive simulations are conducted to evaluate the effectiveness of the proposed system. Simulation results show the key design considerations for efficient quantum networks, and the effect of different network parameters on the network performance.

arXiv:2105.14507•International Symposium on Wireless Communication Systems•Sep 6, 2021•32 citations

Rethinking Quantum Network Design Using a Verification-Based Quantum Transmission Protocol

Yiming Zeng, Zhengyu Wu, Xuan Du Trinh +3 more

Quantum networking is poised to enable a distributed quantum Internet, connecting many quantum processors to exchange information securely and efficiently. Quantum networks use quantum repeaters for long-distance communication to mitigate the noise that accumulates over distance. However, today's quantum network protocols still face fundamental limitations: most rely on establishing end-to-end entanglement before teleportation, which is costly to establish and is extremely shortlived. While hop-by-hop teleportation provides more flexibility, existing designs assume ideal, noise-free conditions. In effect, noise emerges as the fundamental bottleneck that affects the scalability and reliability of multi-hop quantum transmission. We present a verification-based quantum transmission (VBQT) protocol that addresses noise as a first-class design goal. This new protocol couples entanglement verification with a new hopby-hop teleportation protocol to deliver robust, long-distance quantum communication. Our verification algorithm provably detects and filters low-quality pair-wise entanglements, ensuring that only high-fidelity pairs are used for communication. Once multiple verified pairs are available, the transmission protocol at each repeater decides which verified pair to use for pairwise teleportation that is consistent across hops so that the destination can recover the qubit successfully. Using the NetSquid simulator under real experiment parameters, we show that VBQT improves average qubit fidelity by up to 42.8% over end-to-end and 34.7% over hop-by-hop teleportation, and increases goodput by up to 870% and 167%, respectively. These results establish a practical foundation for reliable, scalable quantum communication within near-term quantum networks.

IEEE International Conference on Distributed Computing Systems (ICDCS)•Jun 1, 2026•0 citations
Quantum communications using entangled photons as qubits offer a promising approach to quantum key distribution, enhancing network security. However, establishing successful entanglement links between distant nodes is challenging due to factors like distance and rapid entanglement decay, resulting in low network transmission efficiency for quantum key distribution. This paper studies the problem of finding the maximum quantum communication network transmission scheme for multiple source-destination pairs with considering the success rate of quantum entangle establishments. We propose the Feasible Quantum Communication Network Transmission (fQUIET) algorithm, which leverages network transformation and auxiliary network construction. The Maximum Quantum commUnIcation nEtwork Transmission (mQUIET) algorithm is further proposed by iteratively searching for augmenting paths. Through theoretical analysis, we demonstrate that the mQUIET algorithm is capable of achieving the maximum QCN transmission scheme. Extensive experiments are carried out and the results reveal that our suggested algorithms have superior performance compared to existing methods.
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.
The unbreakable security and higher data rates offered by quantum communication networks have made quantum communication an inevitable necessity of the future. Many quantum communication frameworks, such as quantum key distribution and super dense coding, require entangled pairs to be shared between the source and destination nodes. Communication nodes in quantum networks have a minimum fidelity requirement for the entangled pairs. If the fidelity requirement is not satisfied, the entangled pairs may not be used for the desired operations. Successful sharing of the entangled pairs between the nodes is a crucial step in making quantum communication practical. In this work, we propose a framework to maximize entanglement sharing between a source and multiple destination nodes in a fair manner. We consider a system that takes advantage of the purification process to improve the fidelity of the entangled pairs when necessary. The proposed solution framework provides the optimal number of entangled pairs required for the purification process and the optimal transmission rate at the source node to achieve the desired system objective. The non-convex problem is first transformed into a convex form, and then a Lagrangian dual-based framework is proposed to find the optimal solution values. Moreover, to optimize the number of entangled pairs for purification at each link, we derive a closed-form expression that provides the optimal value in a single step. Selected simulation results demonstrate that the proposed framework exhibits excellent performance.
Entanglement distribution over long distances is one of the main problems in the existing quantum communication networks. Most of the existing methods of establishing entanglement paired link (Einstein, Podolsky, Rosen - EPR pairs) between distant nodes assume symmetric network topologies comprised of links with identical EPR generation capacities. In this work, the entanglement rate capacity of randomly distributed quantum ad hoc networks is investigated. To this end, constant fidelity maximum flow (CFMF) of entanglement problem is defined, and its theoretical analysis is presented. A new heuristic algorithm, i.e., Entanglement Swapping Scheme Search (ESSS), is presented to find the best possible swapping scheme over a multi-hop entanglement path. Furthermore, Shortest Path Entanglement Flow (SPEF) algorithm is introduced as an effective heuristic solution for this problem. Analysis shows that there is a trade-off between the desired constant target fidelity and the entanglement generation rate (maximum flow) of the network.
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.
Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. These networks have an inherent feature of parallelism that allows them to boost the capacity and enhance the security of communication systems. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes. However, to reap the benefits of entanglement and enable efficient quantum communication, the number of generated entangled pairs must be optimized. Indeed, if the entanglement generation rates are not optimized, then some of these valuable resources will be discarded and lost. In this paper, the problem of optimizing the entanglement generation rates and their distribution over a quantum memory is studied. In particular, a quantum network in which users have heterogeneous distances and applications is considered. This problem is posed as a mixed integer nonlinear programming optimization problem whose goal is to efficiently utilize the available quantum memory by distributing the quantum entangled pairs in a way that maximizes the user satisfaction. An interior point optimization method is used to solve the optimization problem and extensive simulations are conducted to evaluate the effectiveness of the proposed system. Simulation results show the key design considerations for efficient quantum networks, and the effect of different network parameters on the network performance.
Quantum networking is poised to enable a distributed quantum Internet, connecting many quantum processors to exchange information securely and efficiently. Quantum networks use quantum repeaters for long-distance communication to mitigate the noise that accumulates over distance. However, today's quantum network protocols still face fundamental limitations: most rely on establishing end-to-end entanglement before teleportation, which is costly to establish and is extremely shortlived. While hop-by-hop teleportation provides more flexibility, existing designs assume ideal, noise-free conditions. In effect, noise emerges as the fundamental bottleneck that affects the scalability and reliability of multi-hop quantum transmission. We present a verification-based quantum transmission (VBQT) protocol that addresses noise as a first-class design goal. This new protocol couples entanglement verification with a new hopby-hop teleportation protocol to deliver robust, long-distance quantum communication. Our verification algorithm provably detects and filters low-quality pair-wise entanglements, ensuring that only high-fidelity pairs are used for communication. Once multiple verified pairs are available, the transmission protocol at each repeater decides which verified pair to use for pairwise teleportation that is consistent across hops so that the destination can recover the qubit successfully. Using the NetSquid simulator under real experiment parameters, we show that VBQT improves average qubit fidelity by up to 42.8% over end-to-end and 34.7% over hop-by-hop teleportation, and increases goodput by up to 870% and 167%, respectively. These results establish a practical foundation for reliable, scalable quantum communication within near-term quantum networks.