Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Resource map of quantum reservoir computing against tuned classical baselines

Hikaru Wakaura

Published Nov 2, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

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.

DOI
10.21203/rs.3.rs-11548214/v1

Related papers

Quantum Reservoir Computing: Recent Advances and Future Directions

Shehbaz Tariq, Muhammad Talha, Arshid Ali +2 more

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.

quant-pharXiv:2607.18552•Jul 22, 2026•5 citations

When Classical Baselines Are Tuned as Carefully as the Quantum Model, Does Quantum Reservoir Computing Still Win?

Tushar Pandey

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.

quant-pharXiv:2607.09905•Jul 14, 2026•2 citations

Quantum Reservoir Autoencoder: Conditions, Protocol, and Noise Resilience

Hikaru Wakaura, Taiki Tanimae

Quantum reservoir computing exploits fixed quantum dynamics and a trainable linear readout to process temporal data, yet reversing the transformation -- reconstructing the input from the reservoir output -- has been considered intractable due to the recursive nonlinearity of sequential quantum state evolution. We introduce the quantum reservoir autoencoder, a four-equation encode--decode protocol with cross-key pairing, and constructively empirically demonstrate that satisfying reservoir--key combinations can be found using a full XYZ Hamiltonian reservoir (10~data qubits, feature dimension~76, 16~random Hamiltonian realizations). Under ideal conditions the mean-squared error (MSE) reaches ${\sim}10^{-17}$ for data lengths up to 30; under shot noise (1\,000~shots) and depolarizing noise ($p = 0.005$), the MSE degrades to $10^{-3}$--$10^{-1}$. Asymmetric resource allocation -- 10~shots for encoding, $10^5$ for decoding -- yields a 102-fold MSE improvement (16~seeds $\times$ 3~trials). Comparison of single-body features (dimension~31) with the full feature set and six baselines identifies the iterative protocol structure -- not the feature dimension -- as the dominant noise bottleneck: baselines solving the linear system in a single step retain machine precision under identical noise, whereas per-iteration noise inconsistency in the coupled solver limits the MSE to ${\sim}10^{-1}$. The current protocol requires plaintext access during decoder training, restricting practical deployment. These results establish a proof-of-concept for bidirectional information transformation within quantum reservoir computing and identify iterative noise mismatch and blind decryption as the principal open challenges.

quant-pharXiv:2602.19700•Feb 24, 2026•0 citations

How Many Shots Does a Quantum Reservoir Need? Measurement Cost and Its Scaling in Buffered Quantum Reservoir Computing

Raman Khurana

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.

arXiv:2611.08632•Nov 5, 2026•0 citations

A Quantum Reservoir Architecture for Chaotic Forecasting and a Test of Whether Its High Dimension Helps

Tushar Pandey

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.

quant-pharXiv:2607.07978•Jul 10, 2026•2 citations

Task-Resolved Fisher Spectroscopy for Quantum Reservoir Computing

Yang Peng

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.

quant-pharXiv:2609.29570•Aug 28, 2026•0 citations
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 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.
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 exploits fixed quantum dynamics and a trainable linear readout to process temporal data, yet reversing the transformation -- reconstructing the input from the reservoir output -- has been considered intractable due to the recursive nonlinearity of sequential quantum state evolution. We introduce the quantum reservoir autoencoder, a four-equation encode--decode protocol with cross-key pairing, and constructively empirically demonstrate that satisfying reservoir--key combinations can be found using a full XYZ Hamiltonian reservoir (10~data qubits, feature dimension~76, 16~random Hamiltonian realizations). Under ideal conditions the mean-squared error (MSE) reaches ∼10−17{\sim}10^{-17}∼10−17 for data lengths up to 30; under shot noise (1\,000~shots) and depolarizing noise (p=0.005p = 0.005p=0.005), the MSE degrades to 10−310^{-3}10−3--10−110^{-1}10−1. Asymmetric resource allocation -- 10~shots for encoding, 10510^5105 for decoding -- yields a 102-fold MSE improvement (16~seeds ×\times× 3~trials). Comparison of single-body features (dimension~31) with the full feature set and six baselines identifies the iterative protocol structure -- not the feature dimension -- as the dominant noise bottleneck: baselines solving the linear system in a single step retain machine precision under identical noise, whereas per-iteration noise inconsistency in the coupled solver limits the MSE to ∼10−1{\sim}10^{-1}∼10−1. The current protocol requires plaintext access during decoder training, restricting practical deployment. These results establish a proof-of-concept for bidirectional information transformation within quantum reservoir computing and identify iterative noise mismatch and blind decryption as the principal open challenges.
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εN_\varepsilonNε​, the shots needed to estimate the reservoir features to a fixed relative accuracy, from a \emph{convergence budget} N⋆N_\starN⋆​, the shots needed for the trained readout to approach its own noise-free ceiling. Proposition~\ref{prop:confound} shows that N⋆N_\starN⋆​ 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 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 (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 rrr. 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.