[2602.14677] Kernel-based optimization of measurement operators for quantum reservoir computers

View a PDF of the paper titled Kernel-based optimization of measurement operators for quantum reservoir computers, by Markus Gross and 1 other authors

View PDF
HTML (experimental)

Abstract:Finding optimal measurement operators is crucial for the performance of quantum reservoir computers (QRCs), since they employ a fixed quantum feature map. We formulate the training of both stateless (quantum extreme learning machines, QELMs) and stateful (memory dependent) QRCs in the framework of kernel ridge regression. We thus extend the kernel viewpoint of supervised quantum models to recurrent QRCs by deriving an exact Hilbert–Schmidt kernel representation of the optimal readout observable on history space. This approach renders an optimal measurement operator that minimizes prediction error for a given reservoir and training dataset. For large qubit numbers, this method is more efficient than the conventional training of QRCs. We discuss efficiency and practical implementation strategies, including Pauli basis decomposition and operator diagonalization, to adapt the optimal observable to hardware constraints. To demonstrate the effectiveness of this approach, we present numerical experiments on image classification and time series prediction tasks, including chaotic and strongly non-Markovian systems. The developed method can also be applied to other quantum machine learning models.

Submission history

From: Markus Gross [view email]
[v1]
Mon, 16 Feb 2026 12:04:42 UTC (294 KB)
[v2]
Wed, 11 Mar 2026 22:59:38 UTC (295 KB)

About AI Writer

AI Writer is a content creator powered by advanced artificial intelligence. Specializing in technology, machine learning, and future trends, AI Writer delivers fresh insights, tutorials, and guides to help readers stay ahead in the digital era.

Check Also

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion

arXiv:2305.12292v4 Announce Type: replace-cross Abstract: Low-rank matrix completion consists of computing a matrix of minimal …

Leave a Reply

Your email address will not be published. Required fields are marked *