Prediction and Classification with minimal QRC and QELMs

Menghan Chen, Chao‐Hua Yu, Gongde Guo +1 more

Markus Gross, Hans-Martin Rieser

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.

James P. Crutchfield, Sarah Marzen

Osama Ahmed, Felix Tennie, Luca Magri

Abstract In the current Noisy Intermediate Scale Quantum (NISQ) era, the presence of noise deteriorates the performance of quantum computing algorithms. Quantum reservoir computing (QRC) is a type of quantum machine learning algorithm, which, however, can benefit from different types of tuned noise. In this paper, we analyze how finite sampling noise affects the chaotic time series prediction of the gate-based QRC and recurrence-free quantum reservoir computing (RF-QRC) models. First, we examine RF-QRC and show that, even without a recurrent loop, it contains temporal information about previous reservoir states using leaky integrated neurons. This makes RF-QRC different from quantum extreme learning machines (QELM). Second, we show that finite sampling noise degrades the prediction capabilities of both QRC and RF-QRC while affecting QRC more due to the propagation of noise. Third, we optimize the training of the finite-sampled quantum reservoir computing framework using two methods: (a) singular value decomposition (SVD) applied to the data matrix containing noisy reservoir activation states and (b) data-filtering techniques to remove the high frequencies from the noisy reservoir activation states. We show that denoising reservoir activation states improves the signal-to-noise ratios with smaller training loss. Finally, we demonstrate that the training and denoising of the noisy reservoir activation signals in RF-QRC are highly parallelizable on multiple quantum processing units (QPUs) as compared to the QRC architecture with recurrent connections. The analyses are numerically showcased on prototypical chaotic dynamical systems with relevance to turbulence. This work opens opportunities for using quantum reservoir computing with finite samples for time series forecasting on near-term quantum hardware.

Markus Baumann, Gerhard Stenzel, Jonas Stein +1 more

Quantum reservoir computers (QRCs) retain information from earlier inputs, whereas reset-window quantum extreme learning machines (QELMs) start afresh and receive only a recent input window. We establish when this window can replace the reservoir's memory. Under our stated assumptions and with exact expectation values, sufficiently expressive QELMs can reproduce reservoir outputs arbitrarily accurately as their windows grow precisely when the influence of the omitted past becomes uniformly negligible. However, longer windows do not always solve the problem. We construct a simple two-qubit reservoir that performs temporal recall exactly, while every fixed-window predictor faces the same positive worst-case error over unbounded delays, regardless of model capacity. Analytical benchmarks and simulations distinguish missing history from limited features and finite measurements. The central conclusion is simple: better representations can improve how available information is used, but cannot recover a past the model never receives.

Emmanuel Zambrini Cruzeiro, Christine De Mol, Serge Massar +1 more