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