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.
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 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.
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 (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.
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.
Quantum machine learning sits at the intersection of quantum computing and artificial intelligence, seeking to exploitquantum mechanical phenomena -- superposition, entanglement, and interference -- to achieve computationaladvantages for learning tasks. This study presents a systematic evaluation of five quantum ML approaches -- variationalquantum classifiers (VQC), quantum kernel methods, quantum reservoir computing, quantum Boltzmann machines, andhybrid quantum-classical neural networks -- benchmarked against classical counterparts on both simulated quantumhardware (up to 30 qubits) and real NISQ devices (IBM Quantum, 27 qubits). Evaluations spanned four task categories:binary classification on structured datasets (6 UCI benchmarks), quantum chemistry property prediction (QM9 molecularenergies), generative modelling (learning probability distributions), and optimisation (Max-Cut on random graphs). A totalof 1,920 experiments were conducted. On classical structured datasets, no quantum method outperformed the bestclassical baseline (XGBoost or SVM) at any problem size accessible to current quantum hardware (up to 30 features),with quantum kernel methods achieving parity at 0.4 +- 0.8% accuracy difference but at 100-1000x higher computationalcost. On quantum chemistry, variational quantum eigensolvers showed a genuine advantage for small molecules (H2,LiH, BeH2): achieving chemical accuracy (1 kcal/mol) with 4-12 qubits where classical methods required exponentiallymore compute for equivalent accuracy. Noise on real NISQ devices degraded all quantum ML methods by 8.4-22.6%relative to noiseless simulation, with error mitigation recovering 42-68% of the noise-induced loss. The quantumadvantage threshold -- the problem size at which quantum methods become faster than classical for equivalent accuracy-- was estimated at 50-100 logical qubits for quantum chemistry and 200+ logical qubits for general ML tasks, placingpractical quantum ML advantage beyond current NISQ capabilities but within plausible reach of fault-tolerant devices. Apractical assessment framework mapping task type, problem structure, and available quantum hardware to expectedquantum advantage is proposed.
The emerging technology of Quantum Reservoir Computing (QRC) stands out in the noisy-intermediate scale quantum era for its efficiency, adaptability, and compatibility with current quantum hardware. By harnessing quantum dynamics for feature extraction, QRC offers a promising alternative for complex forecasting tasks — such as predicting agri-commodity price fluctuations — central to addressing food price crises and supply chain sustainability. In this work, we systematically investigate the design of quantum reservoirs and identify circuit complexity, quantified via the majorization criterion, as a practical indicator of forecasting performance. Unlike alternative complexity measures that require full state tomography or time-reversed dynamics, majorization can be evaluated from measurement statistics alone, making it particularly suited for near-term quantum devices. We demonstrate that quantum reservoirs built from a universal gate family composed of Hadamard, controlled-NOT, and T gates achieve strong predictive accuracy while requiring significantly fewer gates than the widely used transverse-field Ising model. Our results show that quantum reservoirs outperform deep learning and statistical baselines, and achieve comparable, slightly superior, performance to classical reservoir computing—an improvement consistent with the compact model structure of QRC, which, with significantly fewer trainable parameters, is better suited to prevent overfitting in data-scarce regimes. We further explore robustness under realistic noise conditions, showing that certain types of quantum noise, such as amplitude damping, can even enhance performance at low error rates. These findings suggest that QRC is a promising tool for time series prediction in data-limited, high-impact domains.