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

Channel-Adaptive Coding, Scheduling, and Routing for Quantum Communication Networks

MD. MONZURUL HAQUE

Published Jan 1, 2026• 0 citations
OpenAlex

Related papers

Predictive Fidelity-Aware Routing and Adaptive Scheduling in Distributed NISQ Quantum Networks via Actor–Critic Reinforcement Learning

P. Prabu

Abstract Quantum communication plays a key role in enabling distributed Noisy Intermediate-Scale Quantum (NISQ) systems; however, practical quantum networks are often affected by link fluctuations, limited quantum resources, and entanglement degradation. These factors make reliable routing and scheduling difficult, particularly in large-scale and dynamically changing environments. Classical methods such as Historical Weighted Fidelity Routing (HWFR) and Dynamic Multi-Priority Quantum Scheduling (DMPQS) generally perform well only when network conditions remain stable, and their performance degrades when entanglement success rates vary or relay nodes become congested. A major challenge therefore lies in operating under uncertain and time-varying fidelity conditions. Most existing approaches focus on either routing or scheduling in isolation and do not explicitly consider future fidelity variations, which can lead to inefficient resource usage and increased end-to-end latency. In this work, we propose a Deep Reinforcement Learning-based Quantum Communication Optimization Framework (DRL-QCOF) that jointly addresses routing and scheduling. The framework employs a Bi-LSTM-based Quantum Fidelity Prediction Network (QFPN) to estimate future link fidelity F_"pred" (t)from time-series features including link length, noise coefficient, entanglement success probability, and relay utilization. These predictions are then used by a Deep Reinforcement Learning-based Adaptive Quantum Scheduling Agent (DRAQS-Agent), implemented using an Actor–Critic architecture with a continuous reward formulation, to guide routing and scheduling decisions across distributed nodes. Simulation results indicate that the proposed approach improves the average link fidelity to a maximum of 0.88, compared to 0.78–0.86 achieved by existing methods. The end-to-end latency is reduced from 104 ms to 83 ms, while baseline schemes remain above 110 ms under the same conditions. In addition, the average response time is reduced to approximately 147 ms, resource utilization increases to 71–83%, and the success ratio improves from 93% to 97%, resulting in improved end-to-end reliability. The cumulative reward stabilizes at around 16.0, with convergence observed within 300 training episodes, and the achieved throughput reaches 118–121 entangled pairs per second, confirming the effectiveness of the proposed framework in dynamic NISQ network scenarios.

•Jul 15, 2026•0 citations

Routing protocols for quantum communication networks: Taxonomy, design, and open challenges

Binayak Kar, Pankaj Kumar

Journal of Network and Computer Applications•Jul 24, 2026•0 citations

Quantum Communication Networks: Design and Simulation

Riccardo Bassoli, Holger Boche, Christian Deppe +4 more

Foundations in signal processing, communications and networking•Oct 30, 2020•10 citations

Scheduling Concurrent Entanglement Requests in Quantum Networks

Gongyu Ni, Lester Ho

This paper investigates resource allocation for entanglement distribution in multi-node, multi-channel quantum networks at the metropolitan scale. A multi-slot quantum network simulation framework is developed across physical and network layers, incorporating heterogeneous link characteristics, limited quantum memories, request queuing, retry mechanisms, and concurrent entanglement distribution. Based on this framework, a centralized scheduling architecture is proposed to coordinate quantum memories, communication channels, and routing paths for multiple simultaneous entanglement requests. Three classes of resource allocation strategies are evaluated: heuristic approaches, a mixed-integer linear programming (MILP) optimization method, and a Proximal Policy Optimization (PPO)-based reinforcement learning approach. The heuristic schemes reveal fundamental trade-offs between request delay and entanglement success rate: Dynamic Efficient minimizes delay, Success Enhancement improves success probability through adaptive multi-path allocation, and Static Efficient provides a balance between these objectives. The MILP approach achieves optimized resource allocation by jointly considering request handling and multi-path assignment, while the PPO-based method learns adaptive scheduling policies to improve overall performance. Simulation results demonstrate that these approaches provide different performance advantages in terms of request delay, entanglement success rate, capacity utilization, and request handling rate, highlighting the trade-offs between efficiency and reliability in metropolitan-scale quantum network scheduling.

quant-pharXiv:2605.04767•May 7, 2026•0 citations

Quantum-Inspired Deep Reinforcement Learning Framework for Secure, Energy-Efficient Resource Optimization in Next-Generation Quantum Communication Networks

Thanuja R, Dr. Jaswant Kumar Khatik, S. Hemajothi +3 more

Quantum communication networks are a revolutionary approach to secure data transmission using quantum mechanics like entanglement and quantum key distribution. Nonetheless, the evolution of the quantum network infrastructure creates substantial problems related to secure data transmission, energy reduction, and efficient management of scarce quantum resources. The inefficiency of traditional approaches that show little flexibility regarding quantum channel dynamics and different traffic patterns leads to low communication efficiency and high operational cost. To address these limitations, this study proposes a Quantum-Inspired Energy-Aware Secure Deep Reinforcement Optimization (QESDRO) framework. The proposed method is combining the quantum-inspired evolutionary optimization with the Deep Reinforcement Learning (DRL) to achieve intelligent routing, adaptive resource allocation, and energy-aware security management in quantum communication networks. Quantuminspired operators is improving global exploration, while the DRL agent is learning optimal routing and scheduling policies, which is based on channel fidelity, energy availability, congestion levels, and security risks. A multi-objective reward mechanism simultaneously maximizes quantum transmission fidelity, minimizes latency and energy consumption, and is strengthening communication resilience against the malicious attacks. Experimental evaluation is showing that QESDRO is achieving 98.9% communication reliability, 97.5% secure routing accuracy, and 96.6% resource utilization efficiency, while it is reducing energy consumption to 52 J and transmission latency to 18 ms when it is compared with the Conventional optimization approaches. These results are confirming the effectiveness of the proposed framework in simultaneously enhancing communication security, operational efficiency, and energy-aware resource management for the next-generation quantum communication networks.

International Conference on Networks, Computers and Communications (ICNCCom)•Jul 1, 2026•0 citations

Quantum Coding and Quantum Communications

Michael Reck, Klaus Mattle, Harald Weinfurter +2 more

European Quantum Electronics Conference (EQEC)•Jan 1, 1996•0 citations
Abstract Quantum communication plays a key role in enabling distributed Noisy Intermediate-Scale Quantum (NISQ) systems; however, practical quantum networks are often affected by link fluctuations, limited quantum resources, and entanglement degradation. These factors make reliable routing and scheduling difficult, particularly in large-scale and dynamically changing environments. Classical methods such as Historical Weighted Fidelity Routing (HWFR) and Dynamic Multi-Priority Quantum Scheduling (DMPQS) generally perform well only when network conditions remain stable, and their performance degrades when entanglement success rates vary or relay nodes become congested. A major challenge therefore lies in operating under uncertain and time-varying fidelity conditions. Most existing approaches focus on either routing or scheduling in isolation and do not explicitly consider future fidelity variations, which can lead to inefficient resource usage and increased end-to-end latency. In this work, we propose a Deep Reinforcement Learning-based Quantum Communication Optimization Framework (DRL-QCOF) that jointly addresses routing and scheduling. The framework employs a Bi-LSTM-based Quantum Fidelity Prediction Network (QFPN) to estimate future link fidelity F_"pred" (t)from time-series features including link length, noise coefficient, entanglement success probability, and relay utilization. These predictions are then used by a Deep Reinforcement Learning-based Adaptive Quantum Scheduling Agent (DRAQS-Agent), implemented using an Actor–Critic architecture with a continuous reward formulation, to guide routing and scheduling decisions across distributed nodes. Simulation results indicate that the proposed approach improves the average link fidelity to a maximum of 0.88, compared to 0.78–0.86 achieved by existing methods. The end-to-end latency is reduced from 104 ms to 83 ms, while baseline schemes remain above 110 ms under the same conditions. In addition, the average response time is reduced to approximately 147 ms, resource utilization increases to 71–83%, and the success ratio improves from 93% to 97%, resulting in improved end-to-end reliability. The cumulative reward stabilizes at around 16.0, with convergence observed within 300 training episodes, and the achieved throughput reaches 118–121 entangled pairs per second, confirming the effectiveness of the proposed framework in dynamic NISQ network scenarios.
This paper investigates resource allocation for entanglement distribution in multi-node, multi-channel quantum networks at the metropolitan scale. A multi-slot quantum network simulation framework is developed across physical and network layers, incorporating heterogeneous link characteristics, limited quantum memories, request queuing, retry mechanisms, and concurrent entanglement distribution. Based on this framework, a centralized scheduling architecture is proposed to coordinate quantum memories, communication channels, and routing paths for multiple simultaneous entanglement requests. Three classes of resource allocation strategies are evaluated: heuristic approaches, a mixed-integer linear programming (MILP) optimization method, and a Proximal Policy Optimization (PPO)-based reinforcement learning approach. The heuristic schemes reveal fundamental trade-offs between request delay and entanglement success rate: Dynamic Efficient minimizes delay, Success Enhancement improves success probability through adaptive multi-path allocation, and Static Efficient provides a balance between these objectives. The MILP approach achieves optimized resource allocation by jointly considering request handling and multi-path assignment, while the PPO-based method learns adaptive scheduling policies to improve overall performance. Simulation results demonstrate that these approaches provide different performance advantages in terms of request delay, entanglement success rate, capacity utilization, and request handling rate, highlighting the trade-offs between efficiency and reliability in metropolitan-scale quantum network scheduling.
Quantum communication networks are a revolutionary approach to secure data transmission using quantum mechanics like entanglement and quantum key distribution. Nonetheless, the evolution of the quantum network infrastructure creates substantial problems related to secure data transmission, energy reduction, and efficient management of scarce quantum resources. The inefficiency of traditional approaches that show little flexibility regarding quantum channel dynamics and different traffic patterns leads to low communication efficiency and high operational cost. To address these limitations, this study proposes a Quantum-Inspired Energy-Aware Secure Deep Reinforcement Optimization (QESDRO) framework. The proposed method is combining the quantum-inspired evolutionary optimization with the Deep Reinforcement Learning (DRL) to achieve intelligent routing, adaptive resource allocation, and energy-aware security management in quantum communication networks. Quantuminspired operators is improving global exploration, while the DRL agent is learning optimal routing and scheduling policies, which is based on channel fidelity, energy availability, congestion levels, and security risks. A multi-objective reward mechanism simultaneously maximizes quantum transmission fidelity, minimizes latency and energy consumption, and is strengthening communication resilience against the malicious attacks. Experimental evaluation is showing that QESDRO is achieving 98.9% communication reliability, 97.5% secure routing accuracy, and 96.6% resource utilization efficiency, while it is reducing energy consumption to 52 J and transmission latency to 18 ms when it is compared with the Conventional optimization approaches. These results are confirming the effectiveness of the proposed framework in simultaneously enhancing communication security, operational efficiency, and energy-aware resource management for the next-generation quantum communication networks.