Quantum reservoir computing (QRC) inherits from classical reservoir computing the property that only a linear readout is trained, but unlike a classical reservoir its state is never directly observable: every feature is an expectation value estimated from a finite number of measurement shots. The shot budget is therefore a first-class hyperparameter with no classical analogue. Its effect on QRC has recently begun to be studied; what remains unsettled is how a required budget should be defined, and whether competing definitions agree. This paper argues that they do not, and that the disagreement is systematic rather than incidental. This paper distinguishes a \emph{precision budget} $N_\varepsilon$, the shots needed to estimate the reservoir features to a fixed relative accuracy, from a \emph{convergence budget} $N_\star$, the shots needed for the trained readout to approach its own noise-free ceiling. Proposition~\ref{prop:confound} shows that $N_\star$ depends on the noise-free error floor by construction, so that a configuration with a worse floor appears cheaper, and that configurations should therefore be compared at a fixed measurement budget rather than by the budget each needs to reach its own ceiling.
Quantum reservoir computing (QRC) inherits from classical reservoir computing the property that only a linear readout is trained, but unlike a classical reservoir its state is never directly observable: every feature is an expectation value estimated from a finite number of measurement shots. The shot budget is therefore a first-class hyperparameter with no classical analogue. Its effect on QRC has recently begun to be studied; what remains unsettled is how a required budget should be defined, and whether competing definitions agree. This paper argues that they do not, and that the disagreement is systematic rather than incidental. This paper distinguishes a \emph{precision budget} Nε, the shots needed to estimate the reservoir features to a fixed relative accuracy, from a \emph{convergence budget} N⋆, the shots needed for the trained readout to approach its own noise-free ceiling. Proposition~\ref{prop:confound} shows that N⋆ depends on the noise-free error floor by construction, so that a configuration with a worse floor appears cheaper, and that configurations should therefore be compared at a fixed measurement budget rather than by the budget each needs to reach its own ceiling.
Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout. This separation reduces reliance on repeated quantum parameter updates and avoids the barren plateaus associated with variational circuit training. Its computational power is often attributed to the exponentially large Hilbert space of the quantum system. However, the memory, nonlinearity, and expressivity that determine what a reservoir can actually compute depend jointly on the input encoding, quantum evolution, observables, measurement, and readout, not on Hilbert space dimension alone. On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables, so a large state space alone does not guarantee useful computation. In this survey, we develop a common system model that connects these components and use it to organize QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations. We examine spin, photonic, superconducting, bosonic, neutral atom, and other analog platforms, together with applications, software and high performance computing support, benchmarking, and reproducibility. The analysis distinguishes hardware demonstrations from simulations and identifies the assumptions and resources that govern comparisons across implementations. Current results do not establish a broad quantum advantage over well matched classical reservoirs. We therefore specify the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.
Abstract Quantum reservoir computing promises an exponentially large feature map at no training cost, but reported advantages rest on classical baselines of unmatched size or tuning, on exact expectation values, or on resource counts that omit measurement. Here we introduce a benchmark protocol that charges shots, experiment restarts and readout size together and apply it to 3451 exactly simulated cells (57 quantum reservoirs, 49 tasks) against three tuned classical reservoir families. No classical- or quantum-input task yields a win in both accuracy and resource scaling; the only winning cells are Forrelation estimators on oracle pairs drawn fresh at every step with no exposed structure, which beat every implemented classical estimator in every seed from field sizes of 16 thousand, with a matching classical query budget growing as the square root of the field size. Few-photon Kerr dynamics beats its mean-field twin only until the twin is tuned, spin readouts pay up to three orders of magnitude in shot noise where quadrature readouts pay threefold, and every structured oracle family falls to a classical shortcut. Quantum reservoir advantage therefore lives in the input access model, not in the reservoir; we give the superconducting-circuit parameters at which the protocol can be run.
Quantum reservoir computing (QRC) uses fixed quantum dynamics to encode a time series and trains only a classical readout, but a benchmark capacity alone does not reveal whether task information is lost in the reservoir, the measurement, feature compression, or finite sampling. We introduce \emph{task-resolved Fisher spectroscopy}, in which prediction targets define orthonormal score coordinates on the stationary distribution of input histories. Reweighting labeled histories along these scores generates an exactly affine family of reservoir states and measurement outcomes. In the same coordinates, we obtain a many-body Fisher-information hierarchy relating the state quantum Fisher information, the Fisher information of the complete measurement record, and moment matrices retained through many-body order r. The quadratic form of each moment matrix is exactly the stationary capacity of the optimal linear readout, while a finite-measurement extension predicts the approach from one-shot records to ideal expectation-value features. The measurement-level quantities require only stationary labeled records and measured outcome strings, not an input model or quantum-state tomography. In a five-spin open reservoir, interactions route fourth-order temporal information into higher-body correlations, so low-order compression can incur orders-of-magnitude sampling overhead even when a conventional parity target remains accessible. For correlated inputs and outputs, record-defined task scores predict held-out capacities, the required feature order, and measurement-budget dependence; optimizing the local measurement axis recovers otherwise hidden task information. The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation.
Quantum Reservoir Computing (QRC) exploits quantum dynamical systems as high-dimensional reservoirs for temporal sequence modeling. This work investigates QRC based on Rydberg atom arrays and evaluates its performance on both synthetic and real-world datasets. We analyze the effects of lattice geometry, readout mechanisms, and measurement shot count on predictive accuracy. Our results show that QRC achieves performance comparable to, and in some cases exceeding, classical Reservoir Computing (RC), particularly for tasks involving complex temporal dependencies. Reservoir geometry plays a size-dependent role: honeycomb lattices yield higher accuracy at small reservoir sizes, while square lattices scale more effectively as the number of atoms increases. Among readout strategies, Support Vector Regression consistently outperforms Ridge Regression and Neural Networks in extracting nonlinear structure from reservoir states. Increasing the number of measurement shots improves accuracy, with diminishing returns beyond a saturation threshold. Overall, this study delineates the conditions under which QRC offers advantages over classical RC and identifies regimes where classical approaches remain competitive. These findings provide practical guidance for optimizing QRC architectures and contribute to the development of quantum-enhanced time-series modeling.
Quantum fidelity kernels and quantum extreme learning machines share the same basic architecture: a fixed quantum device generates features that are combined through a classically trained linear model. We refer to this broad non-variational setting as quantum linear regression. A defining aspect of these models is that the quantum features are not directly available, but must be estimated from a finite number of shots. We show that finite statistics makes quantum linear regression unavoidably ill-conditioned. Ideal feature vectors are confined to a subspace determined by the dimension of the Hilbert space, whereas finite-shot estimates generically acquire components outside this subspace. Training then attempts to fit directions that disappear in the infinite-statistics limit, making the learned model increasingly sensitive to sampling noise. We analyze this mechanism for quantum extreme learning machines trained on ntr states with N shots per state. Despite the ill-conditioning, predictions remain controlled when the training targets are exact. Finite sampling produces a systematic prediction error that decreases quadratically with N, while fluctuations induced by the random training measurements decrease inversely with the total training budget. Thus, unlike in standard linear regression with exactly known features, increasing the dataset size alone cannot remove the error caused by sampling noise. If the training targets are also noisy, due for instance to state-preparation errors, the otherwise hidden directions become active. The test error can then increase with N, a behavior that we ascribe to a form of quantum overfitting. Our results expose a fundamental tradeoff between dataset size and per-state statistics in non-variational quantum learning and provide a baseline for resource-aware training and regularization strategies.
Quantum Reservoir Computing (QRC) uses fixed quantum dynamics as a high-dimensional feature map. Still, standard pipelines flatten reservoir measurements and train a linear readout, ignoring the natural tensor structure across time steps, qubits, and observables. We propose a multilinear readout for quantum reservoir computing (ML-QRC), a tensor-structured neural readout compressed through mode-wise projections. Relative to a dense hidden-width-64 neural readout, this reduces the feature-to-hidden parameter count from 64TnF to d(T+n+F)+64d3, giving a 12.1× feature-block compression at T=50, n=6, d=8, and F=n+(2n). Across Mackey-Glass forecasting and TFIM phase classification, ML-QRC remains statistically competitive with Ridge on Mackey-Glass and obtains the numerically highest full-data TFIM accuracy among tested methods, while using 12.0× fewer parameters than the full dense MLP. Its clearest benefit is improved low-data stability relative to neural MLP readouts on Mackey-Glass; this advantage does not transfer to TFIM, where Ridge performs best at 50\% data. Overall, ML-QRC is best viewed as a tensor-structured neural readout that compresses dense MLP readouts while preserving QRC tensor structure, rather than as a replacement for simple linear/Ridge readouts in the tested regime.