The paper develops a theoretical framework for quantum extreme learning machines (QELMs) using the Pauli transfer matrix (PTM) formalism. It shows how encoding, reservoir dynamics, and measurement observables jointly determine the nonlinear information processing capacity of a QELM, and provides interpretable diagnostics that can guide model design. The authors apply their analysis to forecasting nonlinear dynamical systems, demonstrating that a trained QELM’s readout closely reproduces the underlying flow map at leading orders.
By Markus Gross, Hans-Martin Rieser
arXiv:2606. 28833v1 Announce Type: new Abstract: Quantum kernel estimation on near-term hardware is shot-budgeted: every entry of the kernel Gram matrix is a Bernoulli expectation that must be sampled with a finite number of circuit executions.
By Jian Xu, Delu Zeng, Qibin Zhao
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
arXiv:2508. 19437v2 Announce Type: replace-cross Abstract: The importance of analyzing nontrivial datasets when testing quantum machine learning (QML) models is becoming increasingly prominent in literature, yet a cohesive framework for understanding dataset characteristics remains elusive.
By Alona Sakhnenko, Christian B. Mendl, Jeanette M. Lorenz
arXiv:2607. 01080v1 Announce Type: new Abstract: We investigate Gaussian process (GP) bandit optimization with quantum kernels, assuming the mean reward function lies in the reproducing kernel Hilbert space (RKHS) induced by the quantum kernel.
By Yuqi Huang, Vincent Y. F. Tan, Sharu Theresa Jose
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