arXiv Machine Learning

Quantum Gaussian processes for prediction of channel observations

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.

arXiv Machine Learning
5d ago

Theory and interpretability of Quantum Extreme Learning Machines: a Pauli transfer matrix approach

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 Machine Learning
Jul 13

Is data-efficient learning feasible with quantum models?

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 Machine Learning
Sep 16

Towards Surrogate Based Dequantization of Quantum Reinforcement Learning

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 Machine Learning
Sep 25

Task-Resolved Fisher Spectroscopy for Quantum Reservoir Computing

The paper introduces task‑resolved Fisher spectroscopy for quantum reservoir computing, defining orthonormal score coordinates from prediction targets that reweight labeled histories to produce an affine family of reservoir states and measurement outcomes. It establishes a Fisher‑information hierarchy linking state quantum Fisher information, measurement record Fisher information, and moment matrices up to many‑body order, providing a quadratic form that equals the stationary capacity of the optimal linear readout. The method requires only stationary labeled records and measured outcomes, enabling predictions of held‑out capacities, necessary feature order, and measurement‑budget dependence, and demonstrates how optimizing local measurement axes can recover hidden task information in a five‑spin open reservoir.

By Yang Peng