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

arXiv:2601.20688 · IEEE Wireless Communications and Networking Conference

Grover's Search-Inspired Quantum Reinforcement Learning for Massive MIMO User Scheduling

Ruining Fan, Xingyu Huang, Mouli Chakraborty, Avishek Nag, Anshu Mukherjee

Published Apr 13, 2026• 0 citations
arXivHTMLPDF

Abstract

The efficient user scheduling policy in the massive Multiple Input Multiple Output (mMIMO) system remains a significant challenge in the field of 5 G and Beyond 5 G (B5G) due to its high computational complexity, scalability, and Channel State Information (CSI) overhead. This paper proposes a novel Grover's search-inspired Quantum Reinforcement Learning (QRL) framework for mMIMO user scheduling. The QRL agent can explore the exponentially large scheduling space effectively by applying Grover's search to the reinforcement learning process. The model is implemented using our designed quantum-gate-based circuit, which imitates the layered architecture of reinforcement learning, where quantum operations act as policy updates and decision-making units. Moreover, the simulation results demonstrate that the proposed method achieves proper convergence and significantly outperforms classical Convolutional Neural Networks (CNN) and Quantum Deep Learning (QDL) benchmarks by 51 % and 43 %, respectively.

DOI
10.1109/wcnc65185.2026.11555408

Related papers

Quantum Deep Learning for Massive MIMO User Scheduling

Xingyu Huang, Ruining Fan, Mouli Chakraborty +2 more

We introduce a hybrid Quantum Neural Networks (QNN) architecture for the efficient user scheduling in 5G/Beyond 5G (B5G) massive Multiple Input Multiple Output (MIMO) systems, addressing the scalability issues of traditional methods. By leveraging statistical Channel State Information (CSI), our model reduces computational overhead and enhances spectral efficiency. It integrates classical neural networks with a variational quantum circuit kernel, outperforming classical Convolutional Neural Networks (CNN) and maintaining robust performance in noisy channels. This demonstrates the potential of quantum-enhanced Machine Learning (ML) for wireless scheduling.

arXiv:2508.03327•IEEE Vehicular Technology Conference•Oct 19, 2025•1 citation

A Survey on Quantum Reinforcement Learning for Cloud Task Scheduling

Khusbu Pradhan, Santanu Kumar Mishra

Modern cloud systems demand efficient task scheduling to optimize resource utilization and meet QoS requirements amid unpredictable workloads. Classical Reinforcement Learning (RL) struggles with slow convergence and poor scalability in these complex environments due to exponentially growing state-action spaces. Quantum Reinforcement Learning (QRL) addresses these limitations by exploiting superposition and entanglement to enable parallel policy exploration and faster learning. This survey analyzes recent QRL and quantum-inspired schedulers across cloud, edge, and fog computing, highlighting their superior performance over classical Deep Reinforcement Learning (DRL) baselines in simulated settings. Key findings reveal persistent methodological gaps, including an exclusive reliance on noise-free quantum simulators, an absence of real hardware validation, and limited scalability testing. Future research directions include prioritizing noise-resilient designs, developing hybrid quantum-classical systems for NISQ-era deployment and integrating data-aware scheduling algorithms.

International Conference on Pervasive Computing and Social Networking (ICPCSN)•May 6, 2026•0 citations

Quantum-Inspired Reinforcement Learning for Edge-Driven Cyber-Physical Systems

Jagjit Singh Dhatterwal, Sandeep Kumar, Shilpa Choudhary

The integration of Quantum-Inspired Reinforcement Learning (QiRL) into Edge-Driven CyberPhysical Systems (CPS) presents a transformative approach to enhance real-time decision-making in distributed environments. While classical reinforcement learning (RL) struggles with scalability and computational complexity in edge-CPS, quantum-inspired Quantum-Inspired Reinforcement Learning for Edge-Driven Cyber-Physical Systems algorithms leverage superposition and entanglement principles to optimize policy exploration and convergence. This paper proposes a novel QiRL framework that combines quantum-inspired optimization with deep RL, enabling efficient resource allocation and adaptive control in latency-sensitive applications (e.g., smart grids, autonomous drones). We formalize the mathematical foundations of QiRL, design a hybrid neural-quantum architecture for edge deployment, and evaluate its performance under dynamic CPS constraints. Simulations on IoT-based case studies demonstrate $\mathbf{2 0}-\mathbf{3 5 \%}$ faster convergence and $\mathbf{1 5 \%}$ higher energy efficiency compared to classical Deep Q-Networks (DQN). Key challenges, such as quantum noise simulation and edge-hardware limitations, are discussed to guide future research. This work bridges quantum computing principles with edge intelligence, offering a scalable pathway for nextgeneration CPS.

International Conference on Mobile Networks and Wireless Communications (ICMNWC)•Dec 10, 2025•0 citations

Quantum Reinforcement Learning with Quantum World Model

Peigen Zeng, Ying He, Fei Richard Yu +1 more

Quantum reinforcement learning (QRL) can outperform classical reinforcement learning (RL) by utilizing quantum parallel theory and quantum phenomena such as superposition and entanglement. Although some excellent work has been done on QRL, most existing works either fail to show the exponential advantage of quantum computation over classical computation in terms of performance or are too demanding on quantum devices. In this paper, we provide a novel perspective on combining quantum computing and RL with faster convergence speed and relatively relaxed demands on quantum devices. Specifically, we propose a method to construct a world model with quantum circuit that allows it to interact in a quantum way. In addition, we use Grover's algorithm to efficiently extract high-value information from the quantum world model. Extensive simulation results show that the proposed method can have superior performance compared to classical RL algorithms.

Globecom•Dec 4, 2023•2 citations

Quantum-Inspired Optimization for Reinforcement Learning Policy Gradient Methods

Jincheng Zhang

Reinforcement learning (RL) policy gradient methods, while effective, frequently encounter challenges related to instability and the sensitivity of their performance to the learning rate hyperparameter. This work introduces a novel approach leveraging quantum-inspired optimization techniques to address these issues. Specifically, we propose a quantum-inspired learning rate scheduler designed to dynamically adapt the update step size during policy gradient training. This scheduler, rooted in principles of quantum measurement and superposition, aims to provide a more robust and efficient learning process. The core claim of this paper is that the integration of this quantum-inspired learning rate scheduler significantly improves the stability and convergence speed of policy gradient methods. We present a theoretical framework and explore the potential of this approach, demonstrating its promise for enhancing RL performance. The proposed method offers a new direction in RL optimization, potentially bridging the gap between classical and quantum-inspired approaches.

•Sep 7, 2026•0 citations

Quantum Policy Iteration via Amplitude Estimation and Grover Search -- Towards Quantum Advantage for Reinforcement Learning

Simon M. Wiedemann, Daniel M. Hein, Steffen Udluft +1 more

We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows that, given access to error-free, efficient quantum realizations of the agent and environment, quantum methods can yield provable improvements over classical Monte-Carlo based methods in terms of sample complexity. Our approach shows in detail how to combine amplitude estimation and Grover search into a policy evaluation and improvement scheme. We first develop quantum policy evaluation (QPE) which is quadratically more efficient compared to an analogous classical Monte Carlo estimation and is based on a quantum mechanical realization of a finite Markov decision process (MDP). Building on QPE, we derive a quantum policy iteration that repeatedly improves an initial policy using Grover search until the optimum is reached. Finally, we present an implementation of our algorithm for a two-armed bandit MDP which we then simulate.

arXiv:2206.04741•Jun 9, 2022•26 citations
The efficient user scheduling policy in the massive Multiple Input Multiple Output (mMIMO) system remains a significant challenge in the field of 5 G and Beyond 5 G (B5G) due to its high computational complexity, scalability, and Channel State Information (CSI) overhead. This paper proposes a novel Grover's search-inspired Quantum Reinforcement Learning (QRL) framework for mMIMO user scheduling. The QRL agent can explore the exponentially large scheduling space effectively by applying Grover's search to the reinforcement learning process. The model is implemented using our designed quantum-gate-based circuit, which imitates the layered architecture of reinforcement learning, where quantum operations act as policy updates and decision-making units. Moreover, the simulation results demonstrate that the proposed method achieves proper convergence and significantly outperforms classical Convolutional Neural Networks (CNN) and Quantum Deep Learning (QDL) benchmarks by 51 % and 43 %, respectively.
We introduce a hybrid Quantum Neural Networks (QNN) architecture for the efficient user scheduling in 5G/Beyond 5G (B5G) massive Multiple Input Multiple Output (MIMO) systems, addressing the scalability issues of traditional methods. By leveraging statistical Channel State Information (CSI), our model reduces computational overhead and enhances spectral efficiency. It integrates classical neural networks with a variational quantum circuit kernel, outperforming classical Convolutional Neural Networks (CNN) and maintaining robust performance in noisy channels. This demonstrates the potential of quantum-enhanced Machine Learning (ML) for wireless scheduling.
Modern cloud systems demand efficient task scheduling to optimize resource utilization and meet QoS requirements amid unpredictable workloads. Classical Reinforcement Learning (RL) struggles with slow convergence and poor scalability in these complex environments due to exponentially growing state-action spaces. Quantum Reinforcement Learning (QRL) addresses these limitations by exploiting superposition and entanglement to enable parallel policy exploration and faster learning. This survey analyzes recent QRL and quantum-inspired schedulers across cloud, edge, and fog computing, highlighting their superior performance over classical Deep Reinforcement Learning (DRL) baselines in simulated settings. Key findings reveal persistent methodological gaps, including an exclusive reliance on noise-free quantum simulators, an absence of real hardware validation, and limited scalability testing. Future research directions include prioritizing noise-resilient designs, developing hybrid quantum-classical systems for NISQ-era deployment and integrating data-aware scheduling algorithms.
The integration of Quantum-Inspired Reinforcement Learning (QiRL) into Edge-Driven CyberPhysical Systems (CPS) presents a transformative approach to enhance real-time decision-making in distributed environments. While classical reinforcement learning (RL) struggles with scalability and computational complexity in edge-CPS, quantum-inspired Quantum-Inspired Reinforcement Learning for Edge-Driven Cyber-Physical Systems algorithms leverage superposition and entanglement principles to optimize policy exploration and convergence. This paper proposes a novel QiRL framework that combines quantum-inspired optimization with deep RL, enabling efficient resource allocation and adaptive control in latency-sensitive applications (e.g., smart grids, autonomous drones). We formalize the mathematical foundations of QiRL, design a hybrid neural-quantum architecture for edge deployment, and evaluate its performance under dynamic CPS constraints. Simulations on IoT-based case studies demonstrate 20−35%\mathbf{2 0}-\mathbf{3 5 \%}20−35% faster convergence and 15%\mathbf{1 5 \%}15% higher energy efficiency compared to classical Deep Q-Networks (DQN). Key challenges, such as quantum noise simulation and edge-hardware limitations, are discussed to guide future research. This work bridges quantum computing principles with edge intelligence, offering a scalable pathway for nextgeneration CPS.
Quantum reinforcement learning (QRL) can outperform classical reinforcement learning (RL) by utilizing quantum parallel theory and quantum phenomena such as superposition and entanglement. Although some excellent work has been done on QRL, most existing works either fail to show the exponential advantage of quantum computation over classical computation in terms of performance or are too demanding on quantum devices. In this paper, we provide a novel perspective on combining quantum computing and RL with faster convergence speed and relatively relaxed demands on quantum devices. Specifically, we propose a method to construct a world model with quantum circuit that allows it to interact in a quantum way. In addition, we use Grover's algorithm to efficiently extract high-value information from the quantum world model. Extensive simulation results show that the proposed method can have superior performance compared to classical RL algorithms.
Reinforcement learning (RL) policy gradient methods, while effective, frequently encounter challenges related to instability and the sensitivity of their performance to the learning rate hyperparameter. This work introduces a novel approach leveraging quantum-inspired optimization techniques to address these issues. Specifically, we propose a quantum-inspired learning rate scheduler designed to dynamically adapt the update step size during policy gradient training. This scheduler, rooted in principles of quantum measurement and superposition, aims to provide a more robust and efficient learning process. The core claim of this paper is that the integration of this quantum-inspired learning rate scheduler significantly improves the stability and convergence speed of policy gradient methods. We present a theoretical framework and explore the potential of this approach, demonstrating its promise for enhancing RL performance. The proposed method offers a new direction in RL optimization, potentially bridging the gap between classical and quantum-inspired approaches.
We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows that, given access to error-free, efficient quantum realizations of the agent and environment, quantum methods can yield provable improvements over classical Monte-Carlo based methods in terms of sample complexity. Our approach shows in detail how to combine amplitude estimation and Grover search into a policy evaluation and improvement scheme. We first develop quantum policy evaluation (QPE) which is quadratically more efficient compared to an analogous classical Monte Carlo estimation and is based on a quantum mechanical realization of a finite Markov decision process (MDP). Building on QPE, we derive a quantum policy iteration that repeatedly improves an initial policy using Grover search until the optimum is reached. Finally, we present an implementation of our algorithm for a two-armed bandit MDP which we then simulate.