Quantum reservoir computing uses a fixed quantum circuit as a feature generator and trains only a simple linear readout on top of it. This makes it cheap to train and free of the optimisation problems that affect many quantum machine-learning models. A natural worry is that the very large feature space the circuit produces might inflate apparent performance without adding anything real. This paper provides two things. First, it gives a complete, reproducible recipe for one such reservoir applied to forecasting chaotic systems, including how data is fed in, how the circuit is built, and how the readout is trained. Second, it gives a way to tell whether the reservoir's high dimension is actually doing useful work. We grow the size of the prediction problem and the size of the quantum reservoir together, so that extra capacity cannot be the explanation for any improvement, and we track a single stability number that measures how well behaved the readout fit is. On two chaotic test systems, a spatiotemporal chain and a shallow-water fluid model, the quantum reservoir keeps a flat, stable error as both sizes grow, while a matched classical reservoir does not. We report where the classical baseline is in fact stronger, so the comparison is honest. The result is a clean specification plus a diagnostic that other groups can apply to any reservoir whose features have a known scale.
Quantum reservoir computing uses a fixed quantum circuit as a feature generator and trains only a simple linear readout on top of it. This makes it cheap to train and free of the optimisation problems that affect many quantum machine-learning models. A natural worry is that the very large feature space the circuit produces might inflate apparent performance without adding anything real. This paper provides two things. First, it gives a complete, reproducible recipe for one such reservoir applied to forecasting chaotic systems, including how data is fed in, how the circuit is built, and how the readout is trained. Second, it gives a way to tell whether the reservoir's high dimension is actually doing useful work. We grow the size of the prediction problem and the size of the quantum reservoir together, so that extra capacity cannot be the explanation for any improvement, and we track a single stability number that measures how well behaved the readout fit is. On two chaotic test systems, a spatiotemporal chain and a shallow-water fluid model, the quantum reservoir keeps a flat, stable error as both sizes grow, while a matched classical reservoir does not. We report where the classical baseline is in fact stronger, so the comparison is honest. The result is a clean specification plus a diagnostic that other groups can apply to any reservoir whose features have a known scale.
Can a small quantum computer forecast a changing signal better than an ordinary classical method? Many studies say yes, but the classical methods they compare against are often left in a basic, untuned state while the quantum model is carefully optimised. We ask what happens when the classical competitor is given exactly the same care: the same size and the same amount of tuning effort. We study two popular reasons a quantum reservoir is thought to help, using exact simulations of small quantum systems (up to eleven qubits) on prediction tasks. In both cases the quantum advantage disappears once the comparison is fair. In the first, extra quantum measurements add nothing that a simple classical formula of the same size does not already provide. In the second, a feedback loop genuinely helps the quantum model, turning a useless setup into a working predictor, yet a well-tuned classical network still predicts slightly more accurately, and the gap is statistically reliable. Our point is not that quantum reservoirs can never win, but that two of their commonly cited advantages do not hold up against fair classical competitors at this scale. We provide these matched comparisons as a simple, reusable checklist for honest benchmarking. All results are fully reproducible from fixed random seeds.
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.
In chaotic dynamical systems, extreme events manifest in time series as unpredictable large-amplitude peaks. Although deterministic, extreme events appear seemingly randomly, which makes their forecasting difficult. By learning the dynamics from observables (data), reservoir computers can time accurately predict extreme events and chaotic dynamics, but they may require many degrees of freedom (large reservoirs). In this paper, by exploiting quantum-computer ansätze and entanglement, we design reservoir computers with compact reservoirs and accurate prediction capabilities. First, we propose the recurrence-free quantum reservoir computer (RF-QRC) architecture. By developing quantum feature maps and removing recurrent connections, the RF-QRC has quantum circuits with smaller depths. This allows the RF-QRC to scale well with higher-dimensional chaotic systems, which makes it suitable for hardware implementation. Second, we forecast the temporal chaotic dynamics and their long-term statistics of low- and higher-dimensional dynamical systems. We find that RF-QRC requires smaller reservoirs than classical reservoir computers for higher-dimensional systems and the same predictability. Third, we apply the RF-QRC to the time prediction of extreme events in a model of a turbulent shear flow with turbulent bursts. We find that the RF-QRC has longer predictability than the classical reservoir computer for extreme events forecasting. The results and analyses indicate that quantum-computer ansätze offers nonlinear expressivity and computational scalability, which are useful for forecasting chaotic dynamics and extreme events. This work opens new opportunities for using quantum machine learning on near-term quantum computers. Published by the American Physical Society 2024
Quantum reservoir computing (QRC) offers a train-light approach to temporal learning by keeping the quantum dynamics fixed and training only a classical readout. Most QRC studies use linear readouts, potentially leaving nonlinear structure in measured reservoir states under-exploited. Inspired by recent reservoir-computing Kolmogorov–Arnold networks (RCKAN), we study Kolmogorov–Arnold Network (KAN)-style spline readouts for stateful QRC. Our QRCKAN architecture combines a refreshed-input, persistent-memory density-matrix reservoir with correlation observables, a shallow spline KAN readout, an optional current-state skip, and a residual formulation that adds a validation-weighted nonlinear correction to ridge regression. We summarize five seeded runs on Lorenz-63 and Mackey–Glass against matched linear QRC, stateless quantum feature maps, no-QRC controls, echo-state networks (ESNs), lag-based regressors, LSTM, and Transformer baselines. On Lorenz-63, residual QRCKAN reduces mean one-step NRMSE by 51.6% relative to QRC+Linear+Skip (0.000820 vs. 0.001696) and raises mean valid prediction time (VPT) from 102 to 218 steps. On Mackey–Glass, QRCKAN reduces mean one-step NRMSE by 78.2% and rollout NRMSE by 81.0%, while increasing mean VPT from 118 to 262 steps. Matched no-skip QRC–QFF comparisons and matched no-QRC controls support contributions from temporal state and reservoir features under the tested configurations. Because seed 0 informed architecture selection and is included in these summaries, all intervals and tests are exploratory rather than independent confirmatory inference. Strong ESNs remain superior in one-step accuracy. We claim an exploratory nonlinear-readout improvement within simulated QRC, not a general quantum advantage.
Forecasting neural activity from short recordings remains a fundamental challenge. Reservoir computing may offer an efficient paradigm for temporal prediction, however classical reservoirs typically underperform in small-data regimes. Here we investigate whether quantum reservoir computing (QRC) can help overcome this limitation. Building on recent advances, we introduce a quantum reservoir based on a transverse-field Ising model, combined with heterogeneous quantum measurements and polynomial ridge regression. On a standard benchmark task, results show that the quantum reservoir outperforms a classical counterpart overall, with prediction accuracy strongly dependent on reservoir parameters. We further demonstrate feasibility by running the same task on quantum hardware. To assess performance on biological signals, we evaluate QRC on simulated human electroencephalography (EEG) data with a parallel reservoir architecture. On this challenging task, the tested quantum reservoir did not match the performance of the classical one, but it produced stable, convergent predictions. This is a meaningful first step toward forecasting of biologically realistic neural data using a quantum reservoir. Overall, our findings indicate that although current quantum hardware and parallel reservoir architectures do not yet surpass classical methods on complex neural signals, QRC can be executed on near-term devices and does converge with realistic EEG-like data. This work establishes a practical baseline for future algorithmic and hardware developments aimed at clinical time-series forecasting with quantum systems.
Quantum reservoir computing is a machine-learning framework that offers ease of training compared to other quantum neural networks, as it does not rely on gradient-based optimization. Learning is performed in a single step on the output features measured from the quantum system. Various implementations of quantum reservoir computing have been explored in simulations, with different measured features. Although simulations have shown that quantum reservoirs present advantages in performance compared to classical reservoirs, experimental implementations have remained scarce. This is due to the challenge of obtaining a large number of output features that are nonlinear transformations of the input data. In this work, we show that even with a circuit quantum electrodynamics system as simple as a single transmon coupled to a readout resonator, we can implement a proof-of-concept realization of quantum reservoir computing. We obtain a large number of nonlinear features from a single physical system by encoding the input data in the amplitude of a coherent drive and measuring the cavity state in the Fock basis. We demonstrate classification of two classical tasks with significantly smaller hardware resources and fewer measured features compared to classical neural networks. Our experimental results are supported by numerical simulations that show additional Kerr nonlinearity is beneficial to reservoir performance. Our work demonstrates a hardware-efficient quantum neural-network implementation that can be further scaled up and generalized to other quantum machine-learning models.