Q-CMAPO: A quantum-classical framework for balancing exploration and exploitation in multi-agent reinforcement learning
Mohammad Taghavi, Javad Vahidi
Abstract In this paper, we propose a novel approach, Q-CMAPO (Quantum-Classical Multi-agent Policy Optimization), for tackling complex decision-making problems in multi-agent systems. By leveraging quantum-inspired optimization techniques, Q-CMAPO efficiently addresses the exploration-exploitation tradeoff, enhancing the scalability and performance of reinforcement learning (RL) algorithms in partially observable, non-stationary environments. We introduce an innovative framework that combines centralized training with decentralized execution (CTDE), enabling seamless cooperation between agents while preserving their autonomy during execution. Through extensive empirical evaluation, including various UAV deployment scenarios, we demonstrate that Q-CMAPO consistently outperforms existing baselines in both computational efficiency and classification accuracy. Our experiments show significant improvements in performance metrics, as well as substantial gains in runtime efficiency and memory utilization. Furthermore, we provide a comprehensive theoretical analysis, proving the convergence and stability of the proposed method in non-stationary environments. We also conduct an ablation study, shedding light on the importance of different components of Q-CMAPO in optimizing agent cooperation. While promising, the proposed approach faces several challenges, including its sensitivity to hyperparameters and scalability in large-scale systems, suggesting opportunities for future refinement and expansion. The integration of Q-CMAPO into real-world applications, such as autonomous robotics, and UAV-based surveillance, opens new avenues for research, bridging the gap between quantum-inspired optimization and practical deployment in multi-agent systems.
Quantum Machine Intelligence•Feb 3, 2026•3 citations