arXiv:2509. 08654v2 Announce Type: replace-cross Abstract: Quantum network routing requires online decisions under probabilistic entanglement generation, finite quantum memories, decoherence, imperfect operations, and classical feedback, while the controller has incomplete knowledge of the physical state.
By Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab, Mazen Hasna
arXiv:2606. 10448v1 Announce Type: cross Abstract: The financial market is a typical low signal-to-noise ratio (SNR) setting, which often destabilizes off-policy maximum-entropy methods like Soft Actor-Critic (SAC).
By Zeyu Liu, Xuanzhi Feng, Sing Kwong Lai, Yuanchen Gao, Xiaoyi Pang, Hualei Zhang, Jingcai Guo, Jie Zhang, Song Guo
The paper proposes a quantum federated learning framework that extends parameter-space geometry to mixed states, using the Bures metric as a local preconditioner and the mean Uhlmann curvature to create an aggregation rule that down‑weights unreliable clients. It provides theoretical convergence guarantees and demonstrates through trapped‑ion quantum emulator experiments that the method retains high accuracy under device heterogeneity and outperforms standard federated averaging, which suffers under strong noise.
By Haruki Emori, Masaki Uchihara, Yuuki Tokunaga
arXiv:2607. 01197v1 Announce Type: new Abstract: Quantum computing has emerged as a promising computational paradigm for machine learning (ML), with the potential to offer computational advantages over classical approaches.
By Chuanming Yu, Jiaming Liu, Zihao Ge, Xiongfei Wu, Lulu Zhu, Pengzhan Zhao, Jianjun Zhao
arXiv:2511. 17228v2 Announce Type: replace-cross Abstract: Artificial intelligence in dynamic, real-world environments requires the capacity for continual learning.
By Yu-Qin Chen, Shi-Xin Zhang
The paper investigates whether quantum reinforcement learning algorithms can be matched by efficient classical methods. It focuses on a simplified reinforcement learning setting with a uniform generative model, providing finite‑sample guarantees for classical kernelized Fitted Q‑Iteration that uses kernels aligned with parameterized quantum circuits. The authors identify sufficient conditions on data encoding, kernel choice, and problem structure under which this classical approach dequantizes quantum Q‑learning, and suggest using kernelized Fitted Q‑Iteration as a heuristic when those conditions cannot be verified.
By Pablo Rodriguez-Grasa, Sofiene Jerbi, Mikel Sanz, Ryan Sweke
arXiv:2606. 19947v1 Announce Type: cross Abstract: Reliable quantum control in the presence of decoherence requires policies that combat the effect of environmental noise on the controlled dynamics.
By Merijn Moody, Zier Mensch, Miranda C. N. Cheng, Peter G. Bolhuis, Max Welling
arXiv:2608. 19306v1 Announce Type: cross Abstract: Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited number of measurements.
By Jonas J\"ager, Yaroslav Khmelnitskiy, Paolo Braccia, Artur Miroszewski, Diego Garc\'ia-Mart\'in, M. Cerezo, Piotr Czarnik
The paper introduces a hybrid quantum–classical regression framework that uses a lightweight classical embedding as a learnable geometric preconditioner to improve the conditioning of a downstream variational quantum circuit. It further incorporates a curriculum optimization protocol that gradually increases circuit depth and switches from SPSA-based exploration to Adam-based fine‑tuning. Experiments on PDE‑informed and standard regression datasets show that this approach consistently outperforms pure QNN baselines, yielding more stable convergence and reduced structured errors, especially in data‑limited regimes.
By Qingyu Meng, Yangshuai Wang
arXiv:2606. 09778v1 Announce Type: cross Abstract: Hard safety filters are increasingly placed downstream of learned controllers to guarantee constraint satisfaction at run time.
By Yifan Wang
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
arXiv:2606. 08276v1 Announce Type: cross Abstract: Quantum reinforcement learning (QRL) is a promising approach to learn effective decision strategies across several applications with stochastic environments.
By Alexander DeRieux, Walid Saad