The paper introduces Q‑MET, a quantum‑assisted framework that uses a hybrid quantum‑classical neural network to generate parameters for Wi‑Fi‑based human activity recognition models, drastically cutting the number of trainable parameters. By combining this approach with structured pruning during training, Q‑MET achieves 90–95% fewer trainable parameters than traditional backpropagation while preserving or improving classification accuracy. The method also yields 75–85% model sparsity for lightweight inference with less than 2% accuracy loss, enabling deployment on resource‑constrained devices.
By To Truong An, Jie Zhang, Guolin Yin, Junqing Zhang, Yanjiao Li, Trung Q. Duong, Simon L. Cotton
Quantum Reinforcement Learning for Cost and Delay Tradeoffs in Quantum Cloud Orchestration proposes QRLQ, a scheduling framework that integrates parameterised quantum circuits with a dueling double deep Q‑network to balance execution cost and delay in quantum‑as‑a‑service environments. Simulation results show QRLQ outperforms heuristic baselines, achieving 5‑11% lower mean cost and up to 82% lower mean delay while maintaining fidelity within 2% of a fidelity‑greedy policy. Compared to a classical deep reinforcement learning baseline, QRLQ delivers comparable performance with 72% fewer trainable parameters.
By An N. H. Phan, Dang Van Huynh, Muhammad Usman, Hoa T. Nguyen
arXiv:2606. 04328v1 Announce Type: cross Abstract: Future wireless networks demand rapid adaptation to highly heterogeneous environments and dynamic task configurations, necessitating a shift from conventional rule-based and optimization-driven radio resource management (RRM) toward artificial intelligence (AI)-driven RRM.
By Fatih Temiz, Shavbo Salehi, Melike Erol-Kantarci
The paper presents a reinforcement‑learning approach to schedule link‑level entanglement in quantum networks, using a Markov Decision Process and double deep Q‑networks with message‑passing neural networks. The resulting policies achieve 100% success rates even when the link activation probability is reduced by up to 71% compared to baseline heuristics, and maintain at least 80% success when task placements are hardware‑restricted. The authors also develop metrics to interpret the learned policy and employ a large language model to generate a heuristic that matches the DQN performance, suggesting a scalable method for extracting interpretable strategies in large quantum networks.
By Leon Rode, Sumeet Khatri, Supartha Podder
arXiv:2607. 29491v1 Announce Type: cross Abstract: Reinforcement-learning-based quantum architecture search (RL-QAS) repeatedly optimizes a variational quantum eigensolver (VQE) after extending a circuit, although circuit construction and action legality are deterministic and known.
By Jiayang Niu, Yan Wang, Jie Li, Ke Deng, Azadeh Alavi, Muhammad Usman, Yongli Ren
The paper introduces Adaptive Policy-Guided Error Mitigation (APGEM), a context-aware layer that dynamically selects error mitigation strategies—such as ZNE, PEC, CDR, and REM—during quantum reinforcement learning (QRL) training on NISQ devices. APGEM uses policy-level indicators (quantum-state fidelity, policy entropy, cumulative reward, and approximation ratio) to choose the most suitable mitigation method and integrates it directly into the reinforcement learning loop. Evaluated on the Capacitated Vehicle Routing Problem under various NISQ noise models, APGEM outperforms static mitigation techniques, achieving about 94% of an oracle strategy’s utility, maintaining higher fidelity as noise increases, and producing more stable learning behavior.
By Bisma Majid, Shabir Ahmed Sofi, Mir Mohammad Yousuf