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 International Symposium on Local and Metropolitan Area Networks (LANMAN)

A Comparative Analysis of Quantum Genetic Algorithms and Deep Reinforcement Learning for Resource Allocation Optimization

Khalid Abualsaud, Elias E. Yaacoub, Aiman Erbad

Published Jun 1, 2026• 0 citations
Publisher

Abstract

Quantum networks depend critically on the efficient management of inherently unstable quantum resources, primarily entanglement. Traditional resource allocation methods often fail to account for the complex, dynamic trade-offs between entanglement distribution distance, fidelity, and decoherence, leading to significant wastage and underutilization. This paper studies the quantum resource allocation problem as a machinelearning optimization problem. We compare two distinct dynamic solvers: a Genetic Algorithm-based solver (Q-GA) and a Deep Reinforcement Learning-based solver (Q-DRL) in their ability to optimize resource allocation and address the resource allocation optimization framework. The Q-GA evolves a population of allocation strategies over time, whereas the Q-DRL agent learns a policy to make real-time distribution decisions. Our comparative analysis focuses on a multi-objective function designed to maximize the successful delivery of entangled pairs and their fidelity, while minimizing resource wastage due to decoherence, operational noise, the probabilistic nature of entanglement generation, and swapping operations. The study shows that in a variety of quantum resource allocation environments, both ML-based approaches significantly outperform conventional static heuristics. Notably, the Q-DRL solver exhibits superior adaptability to network dynamics, achieving a higher success rate and reduced resource wastage than the Q-GA. These findings establish their efficacy as a robust solution for the next-generation quantum resource allocation management.

DOI
10.1109/lanman69841.2026.11623589

Related papers

Entangled Resource Allocation Algorithm for Quantum Networks

Jincheng Zhang

This paper presents a novel algorithm for optimizing the allocation of entangled resources within quantum networks. The core of the approach lies in employing a reinforcement learning (RL) framework to dynamically manage and distribute entanglement, addressing the inherent challenges of maximizing utilization and enhancing quantum communication efficiency. Unlike traditional static allocation methods, the proposed RL agent learns optimal allocation strategies through iterative interaction with a simulated quantum network environment. The algorithm considers factors such as node connectivity, qubit availability, and communication delays to minimize resource wastage and improve overall network performance. The key performance indicator (KPI) is the entanglement fidelity between communicating nodes. The developed algorithm offers a promising pathway towards realizing the full potential of quantum networks by intelligently managing their most valuable asset: entanglement. The primary goal is to achieve higher fidelity entanglement distribution and improved communication rates. The effectiveness of the algorithm is evaluated through simulations, demonstrating its ability to outperform existing allocation schemes in various network topologies and operational scenarios.

•Aug 31, 2026•0 citations

Dynamic Quantum Network Resource Allocation Optimization

Jincheng Zhang

This paper addresses the critical challenge of optimizing resource allocation within dynamic quantum networks (QNs). The inherent complexities of QNs, including fluctuating demands, evolving topologies, and the fragility of quantum states, necessitate adaptive resource management strategies. We propose a novel algorithm leveraging reinforcement learning (RL) to dynamically adjust resource allocation based on real-time network conditions. The algorithm learns an optimal policy by iteratively interacting with a simulated QN environment, maximizing the overall quantum channel throughput while minimizing the probability of quantum error. Specifically, the core mechanism involves formulating the resource allocation problem as a Markov Decision Process (MDP), where the state represents the network's current configuration, the action represents the allocation of quantum resources (e.g., qubits, entanglement), and the reward reflects the successful completion of quantum communication tasks. The RL agent utilizes a Q-learning algorithm to estimate the optimal Q-function, guiding the allocation process. We demonstrate, through simulation, that our algorithm significantly outperforms static allocation strategies in terms of throughput and reliability, even under highly dynamic network conditions. The key contributions of this work lie in the integration of RL with the unique characteristics of QNs and the development of a practical algorithm for adaptive resource management. Further research will explore the scalability of this approach and its application to larger, more complex QN topologies.

•Aug 28, 2026•0 citations

Quantum Channel Optimization: Integrating Quantum-Inspired Machine Learning With Genetic Adaptive Strategies

R. Vijay Anand, G. Magesh, I. Alagiri +3 more

There is an ever-growing need for optimizing efficient nano and quantum communication systems and this demand calls for more advanced optimization techniques than those that have been around for quite some time. The conventional genetic algorithms (GAs) proved to be quite helpful in general but proved to be poor when it comes to fast convergence and adaptability to the changing communication environment. Moreover, fault tolerance and resource efficiency in these communication channels are poorly addressed, giving rise to a huge roadblock to practical implementations in a number of different use cases. This research presents a set of novel hybrid optimization methods aimed at addressing the issues previously mentioned. In the first place, a Quantum-inspired Genetic Algorithm (QIGA) with Simulated Annealing (SA) Initialization is proposed through augmenting traditional genetic operations with the quantum computing paradigm. In the first instance, the hybrid approach works by utilizing the parameters derived from SA while initializing the GA population, hence effective exploration of solution space. Additionally, the Adaptive Genetic Algorithm with Reinforcement Learning (AGA-RL) is presented, which uses real-time feedback from the current environment to modify the GA parameters. This way, the system will be much more adaptive and hence be able to adjust the GA so that it can match the rapidly changing channel conditions. Simultaneously, the Fault-Tolerant Genetic Algorithm with Error-Correcting Codes (FTGA-ECC) is developed to ensure reliable data transmission, especially in an error-prone environment. To make up for resource constraints, the Energy-Aware Genetic Algorithm with Dynamic Resource Allocation (EAGA-DRA) strategy ensures that resources are well-managed by dynamically changing allocation based on the optimization process and the particular needs of the channel, hence reducing energy overhead and spatial overhead without compromising channel quality. A great leap is in the integration of Machine Learning through the Deep Reinforcement Learning-guided Genetic Algorithm (DRL-GA). The above approach exploits deep reinforcement learning to fine-tune the exploration and exploitation strategies of the GA, hence providing faster convergence and improved solution quality. All of these methods are validated by the Quantum-inspired Benchmarking Framework (QIBF), which forms a systematized comparative platform to evaluate different optimization techniques from the perspective of QCA-based communication systems. The above approaches not only provide the improvement in efficiency and reliability but also contribute to enhancing the adaptability of communication systems and provide a very good base for future research and development in the field of quantum communications and beyond, with potential applications extending to secure communication, quantum computing, and nanotechnology-based devices & scenarios. This work is multifold, promising significant advancements in the field of quantum communication and beyond. The empirical findings showed that the suggested algorithms perform significantly better than traditional approaches in several important performance metrics, such as robustness to channel errors, adaptability to changing signal-to-noise ratios, convergence speed under dynamic conditions, and solution quality in highly variable environments.INDEX TERMS Quantum-inspired genetic algorithm, adaptive genetic algorithm, fault-tolerance, energy-efficient optimization, deep reinforcement learning.

IEEE Access•Jan 1, 2024•24 citations

Quantum Resource Allocation with Deep Reinforcement Learning

Jincheng Zhang

This paper explores the application of Deep Reinforcement Learning (DRL) for optimizing quantum resource allocation in quantum computing. Traditional quantum resource allocation often relies on manual design and expert knowledge, which can be computationally expensive and limit scalability. We propose a novel framework utilizing DRL to automate this process, learning optimal strategies for allocating quantum resources (qubits, gates, and time) to maximize the performance of quantum algorithms. The core of our approach involves constructing a DRL model where the agent learns to make decisions regarding resource allocation based on the current state of the quantum system and the desired algorithm outcome. We define a state space representing the quantum system's configuration, action space encompassing various resource allocation options, and a reward function that reflects the algorithm's success. Through this framework, we aim to significantly enhance the efficiency and performance of quantum computations. This work presents a foundational approach, paving the way for more sophisticated DRL-based quantum resource allocation strategies.

•Sep 5, 2026•0 citations

QPLAN: Deep Reinforcement Learning Assisted Quantum Network Planning

Yuhang Gan, Shiyi Ling, Ruilin Zhou +2 more

Quantum networks attract increasing attention due to their unique advantages over classical networks. However, the challenge of efficiently and economically constructing reliable wide-area quantum networks remains unresolved. This problem, termed network planning, is typically modeled as an Integer Linear Programming (ILP) problem. Existing solver-based solutions for classical networks face scalability issues, while heuristic approaches that sacrifice optimality for scalability heavily rely on human expertise and lack generalizability. Recently, deep reinforcement learning (DRL) has demonstrated potential in adaptive decision-making for classical network planning. However, quantum networks introduce unique constraints due to their end-to-end entanglement distribution requirements. To address this, we propose a two-stage quantum network resource allocation framework, QPLAN, that combines multi-agent DRL with traditional optimization solvers. Our approach uses a novel multi-agent reinforcement learning strategy using graph neural networks (GNNs) and transformers for traffic flow and corresponding hardware resource allocation to minimize hardware cost while cooperatively satisfying problem constraints as much as possible. The output of the DRL algorithm is then used as an initial input to prune the solution space, "warm-starting" the ILP solver and further improving the solution. This hybrid approach effectively reduces manual effort and enhances scalability. Experimental results show that our method yields near-optimal solutions with better scalability than only using ILP solvers.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•1 citation

A Survey of Quantum Deep Reinforcement Learning for Resource Allocation in Future Wireless Networks

Ni Made Erma Pratiwi Astiti, Byung Moo Lee

The significant rise in wireless communication, driven by sixth-generation (6G) networks, underscores the urgent need for innovative resource allocation methods to achieve efficiency, scalability, and reliability. This survey explores the integration of Quantum Deep Reinforcement Learning (QDRL) as a strategy to address the challenges posed by dynamic and complex wireless environments. By leveraging quantum computing features such as superposition and entanglement, QDRL enhances computational efficiency and mitigates the scalability limitations of classical and deep reinforcement learning (DRL) in high-dimensional optimization. The study reviews recent QDRL approaches for key resource allocation tasks, including power distribution, user scheduling, and channel assignment, and examines quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) and Quantum Neural Networks (QNN) for improved decision-making in wireless systems. Furthermore, it emphasizes the connection between quantum computing and DRL, highlighting hybrid architectures that balance computational cost, energy efficiency, and scalability. Finally, the survey identifies research gaps and outlines future directions, paving the way for robust QDRL strategies to support next-generation wireless networks.

IEEE Communications Surveys & Tutorials•Nov 28, 2025•16 citations
Quantum networks depend critically on the efficient management of inherently unstable quantum resources, primarily entanglement. Traditional resource allocation methods often fail to account for the complex, dynamic trade-offs between entanglement distribution distance, fidelity, and decoherence, leading to significant wastage and underutilization. This paper studies the quantum resource allocation problem as a machinelearning optimization problem. We compare two distinct dynamic solvers: a Genetic Algorithm-based solver (Q-GA) and a Deep Reinforcement Learning-based solver (Q-DRL) in their ability to optimize resource allocation and address the resource allocation optimization framework. The Q-GA evolves a population of allocation strategies over time, whereas the Q-DRL agent learns a policy to make real-time distribution decisions. Our comparative analysis focuses on a multi-objective function designed to maximize the successful delivery of entangled pairs and their fidelity, while minimizing resource wastage due to decoherence, operational noise, the probabilistic nature of entanglement generation, and swapping operations. The study shows that in a variety of quantum resource allocation environments, both ML-based approaches significantly outperform conventional static heuristics. Notably, the Q-DRL solver exhibits superior adaptability to network dynamics, achieving a higher success rate and reduced resource wastage than the Q-GA. These findings establish their efficacy as a robust solution for the next-generation quantum resource allocation management.
This paper presents a novel algorithm for optimizing the allocation of entangled resources within quantum networks. The core of the approach lies in employing a reinforcement learning (RL) framework to dynamically manage and distribute entanglement, addressing the inherent challenges of maximizing utilization and enhancing quantum communication efficiency. Unlike traditional static allocation methods, the proposed RL agent learns optimal allocation strategies through iterative interaction with a simulated quantum network environment. The algorithm considers factors such as node connectivity, qubit availability, and communication delays to minimize resource wastage and improve overall network performance. The key performance indicator (KPI) is the entanglement fidelity between communicating nodes. The developed algorithm offers a promising pathway towards realizing the full potential of quantum networks by intelligently managing their most valuable asset: entanglement. The primary goal is to achieve higher fidelity entanglement distribution and improved communication rates. The effectiveness of the algorithm is evaluated through simulations, demonstrating its ability to outperform existing allocation schemes in various network topologies and operational scenarios.
This paper addresses the critical challenge of optimizing resource allocation within dynamic quantum networks (QNs). The inherent complexities of QNs, including fluctuating demands, evolving topologies, and the fragility of quantum states, necessitate adaptive resource management strategies. We propose a novel algorithm leveraging reinforcement learning (RL) to dynamically adjust resource allocation based on real-time network conditions. The algorithm learns an optimal policy by iteratively interacting with a simulated QN environment, maximizing the overall quantum channel throughput while minimizing the probability of quantum error. Specifically, the core mechanism involves formulating the resource allocation problem as a Markov Decision Process (MDP), where the state represents the network's current configuration, the action represents the allocation of quantum resources (e.g., qubits, entanglement), and the reward reflects the successful completion of quantum communication tasks. The RL agent utilizes a Q-learning algorithm to estimate the optimal Q-function, guiding the allocation process. We demonstrate, through simulation, that our algorithm significantly outperforms static allocation strategies in terms of throughput and reliability, even under highly dynamic network conditions. The key contributions of this work lie in the integration of RL with the unique characteristics of QNs and the development of a practical algorithm for adaptive resource management. Further research will explore the scalability of this approach and its application to larger, more complex QN topologies.
There is an ever-growing need for optimizing efficient nano and quantum communication systems and this demand calls for more advanced optimization techniques than those that have been around for quite some time. The conventional genetic algorithms (GAs) proved to be quite helpful in general but proved to be poor when it comes to fast convergence and adaptability to the changing communication environment. Moreover, fault tolerance and resource efficiency in these communication channels are poorly addressed, giving rise to a huge roadblock to practical implementations in a number of different use cases. This research presents a set of novel hybrid optimization methods aimed at addressing the issues previously mentioned. In the first place, a Quantum-inspired Genetic Algorithm (QIGA) with Simulated Annealing (SA) Initialization is proposed through augmenting traditional genetic operations with the quantum computing paradigm. In the first instance, the hybrid approach works by utilizing the parameters derived from SA while initializing the GA population, hence effective exploration of solution space. Additionally, the Adaptive Genetic Algorithm with Reinforcement Learning (AGA-RL) is presented, which uses real-time feedback from the current environment to modify the GA parameters. This way, the system will be much more adaptive and hence be able to adjust the GA so that it can match the rapidly changing channel conditions. Simultaneously, the Fault-Tolerant Genetic Algorithm with Error-Correcting Codes (FTGA-ECC) is developed to ensure reliable data transmission, especially in an error-prone environment. To make up for resource constraints, the Energy-Aware Genetic Algorithm with Dynamic Resource Allocation (EAGA-DRA) strategy ensures that resources are well-managed by dynamically changing allocation based on the optimization process and the particular needs of the channel, hence reducing energy overhead and spatial overhead without compromising channel quality. A great leap is in the integration of Machine Learning through the Deep Reinforcement Learning-guided Genetic Algorithm (DRL-GA). The above approach exploits deep reinforcement learning to fine-tune the exploration and exploitation strategies of the GA, hence providing faster convergence and improved solution quality. All of these methods are validated by the Quantum-inspired Benchmarking Framework (QIBF), which forms a systematized comparative platform to evaluate different optimization techniques from the perspective of QCA-based communication systems. The above approaches not only provide the improvement in efficiency and reliability but also contribute to enhancing the adaptability of communication systems and provide a very good base for future research and development in the field of quantum communications and beyond, with potential applications extending to secure communication, quantum computing, and nanotechnology-based devices & scenarios. This work is multifold, promising significant advancements in the field of quantum communication and beyond. The empirical findings showed that the suggested algorithms perform significantly better than traditional approaches in several important performance metrics, such as robustness to channel errors, adaptability to changing signal-to-noise ratios, convergence speed under dynamic conditions, and solution quality in highly variable environments.INDEX TERMS Quantum-inspired genetic algorithm, adaptive genetic algorithm, fault-tolerance, energy-efficient optimization, deep reinforcement learning.
This paper explores the application of Deep Reinforcement Learning (DRL) for optimizing quantum resource allocation in quantum computing. Traditional quantum resource allocation often relies on manual design and expert knowledge, which can be computationally expensive and limit scalability. We propose a novel framework utilizing DRL to automate this process, learning optimal strategies for allocating quantum resources (qubits, gates, and time) to maximize the performance of quantum algorithms. The core of our approach involves constructing a DRL model where the agent learns to make decisions regarding resource allocation based on the current state of the quantum system and the desired algorithm outcome. We define a state space representing the quantum system's configuration, action space encompassing various resource allocation options, and a reward function that reflects the algorithm's success. Through this framework, we aim to significantly enhance the efficiency and performance of quantum computations. This work presents a foundational approach, paving the way for more sophisticated DRL-based quantum resource allocation strategies.
Quantum networks attract increasing attention due to their unique advantages over classical networks. However, the challenge of efficiently and economically constructing reliable wide-area quantum networks remains unresolved. This problem, termed network planning, is typically modeled as an Integer Linear Programming (ILP) problem. Existing solver-based solutions for classical networks face scalability issues, while heuristic approaches that sacrifice optimality for scalability heavily rely on human expertise and lack generalizability. Recently, deep reinforcement learning (DRL) has demonstrated potential in adaptive decision-making for classical network planning. However, quantum networks introduce unique constraints due to their end-to-end entanglement distribution requirements. To address this, we propose a two-stage quantum network resource allocation framework, QPLAN, that combines multi-agent DRL with traditional optimization solvers. Our approach uses a novel multi-agent reinforcement learning strategy using graph neural networks (GNNs) and transformers for traffic flow and corresponding hardware resource allocation to minimize hardware cost while cooperatively satisfying problem constraints as much as possible. The output of the DRL algorithm is then used as an initial input to prune the solution space, "warm-starting" the ILP solver and further improving the solution. This hybrid approach effectively reduces manual effort and enhances scalability. Experimental results show that our method yields near-optimal solutions with better scalability than only using ILP solvers.
The significant rise in wireless communication, driven by sixth-generation (6G) networks, underscores the urgent need for innovative resource allocation methods to achieve efficiency, scalability, and reliability. This survey explores the integration of Quantum Deep Reinforcement Learning (QDRL) as a strategy to address the challenges posed by dynamic and complex wireless environments. By leveraging quantum computing features such as superposition and entanglement, QDRL enhances computational efficiency and mitigates the scalability limitations of classical and deep reinforcement learning (DRL) in high-dimensional optimization. The study reviews recent QDRL approaches for key resource allocation tasks, including power distribution, user scheduling, and channel assignment, and examines quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) and Quantum Neural Networks (QNN) for improved decision-making in wireless systems. Furthermore, it emphasizes the connection between quantum computing and DRL, highlighting hybrid architectures that balance computational cost, energy efficiency, and scalability. Finally, the survey identifies research gaps and outlines future directions, paving the way for robust QDRL strategies to support next-generation wireless networks.