This paper studies temporal learning with quantum reservoirs driven by continuous-time dynamics. Our goal is to model long-range dependencies under irregular sampling while avoiding backpropagation through time and repeated numerical ODE integration. We formulate a Continuous-time Quantum Reservoir (CQR) framework in which an input-modulated Hamiltonian drives Schrödinger evolution, and a classical linear readout is fitted from sampled quantum features. We analyze three variants: (i) CQR-unitary, which uses expectation values of Hermitian observables; (ii) CQR-measurement, which uses projective-measurement probabilities; and (iii) CQR-trainable, which additionally tunes input-coupling Hamiltonian parameters via parameter-shift updates. Experiments on Lorenz forecasting, human-activity classification, and two regression benchmarks show competitive accuracy, improved memory capacity, and clear compute-accuracy trade-offs across variants. We also provide a Stone-Weierstrass-based universality result for the induced feature algebra and discuss practical design limitations.
This paper studies temporal learning with quantum reservoirs driven by continuous-time dynamics. Our goal is to model long-range dependencies under irregular sampling while avoiding backpropagation through time and repeated numerical ODE integration. We formulate a Continuous-time Quantum Reservoir (CQR) framework in which an input-modulated Hamiltonian drives Schrödinger evolution, and a classical linear readout is fitted from sampled quantum features. We analyze three variants: (i) CQR-unitary, which uses expectation values of Hermitian observables; (ii) CQR-measurement, which uses projective-measurement probabilities; and (iii) CQR-trainable, which additionally tunes input-coupling Hamiltonian parameters via parameter-shift updates. Experiments on Lorenz forecasting, human-activity classification, and two regression benchmarks show competitive accuracy, improved memory capacity, and clear compute-accuracy trade-offs across variants. We also provide a Stone-Weierstrass-based universality result for the induced feature algebra and discuss practical design limitations.
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 We study quantum state-space models (QSSMs) as recurrent architectures for sequence pro cessing, with an emphasis on the interplay between quantum dynamics, measurement design, and readout expressivity. We consider a delayed XOR benchmark, a canonical task for probing long-range memory and parity-based dependencies, and implement a noiseless, statevector-based quantum reservoir driven by input-conditioned unitary evolution. Using expectation values of local Pauli observables as features, we find that quantum state space dynamics alone remain near chance level on the delayed XOR task, despite the high dimensional and nonlinear nature of the underlying quantum evolution. This result highlights a fundamental observability limitation: parity information is encoded in higher-order correlations that are not linearly accessible through simple expectation-value measurements. We then demonstrate that augmenting the quantum features with a minimal tapped-delay readout, including a bilinear interaction term between delayed inputs, restores perfect gener alization. This augmentation does not modify the quantum dynamics, but instead aligns the observation model with the algebraic structure of the task. Our findings clarify the respective roles of quantum dynamics and measurement interfaces in quantum recurrent models, and suggest that performance gains arise not solely from quantum evolution, but from the coherent integration of dynamics, observability, and readout design.
Quantum learning provides a versatile paradigm for information processing by exploiting the intrinsic representational capacity of high-dimensional Hilbert spaces. Here, we investigate a Hamiltonian-encoding framework for quantum reservoir computing that simultaneously addresses three key challenges in quantum learning: trainability, hardware efficiency, and information stability. In this framework, input data are directly mapped onto a fixed Hamiltonian and transformed into expressive nonlinear features through quantum dynamical evolution. By employing the reservoir-computing paradigm, the approach naturally circumvents the barren plateau problem in quantum learning landscapes. We validate the framework across two complementary platforms: an analog superconducting array processor and a digital gate-based quantum circuit implementation. Despite their fundamentally different realizations, both platforms exhibit comparable representational power and achieve competitive learning performance, establishing a unified framework for cross-platform quantum learning. While both implementations achieve comparable performance, the analog processor may offer a more hardware-efficient realization by bypassing the temporal overhead of gate-based decomposition and thereby making more effective use of finite coherence times, albeit at the expense of universality. Furthermore, we find that finite dissipation suppresses quantum-scrambling-induced instabilities at long evolution times and can enhance learning performance, revealing a constructive role for environmental coupling in stabilizing quantum learning dynamics. Collectively, these results establish Hamiltonian-encoded reservoir computing as a compact, expressive, and hardware-efficient paradigm for quantum learning on current-generation quantum platforms.
The paradigm of reservoir computing exploits the nonlinear dynamics of a physical reservoir to perform complex time-series processing tasks such as speech recognition and forecasting. Unlike other machine-learning approaches, reservoir computing relaxes the need for optimization of intra-network parameters, and is thus particularly attractive for near-term hardware-efficient quantum implementations. However, the complete description of practical quantum reservoir computers requires accounting for their placement in a quantum measurement chain, and its conditional evolution under measurement. Consequently, training and inference has to be performed using finite samples from obtained measurement records. Here we describe a framework for reservoir computing with nonlinear quantum reservoirs under continuous heterodyne measurement. Using an efficient truncated-cumulants representation of the complete measurement chain enables us to sample stochastic measurement trajectories from reservoirs of several coupled nonlinear bosonic modes under strong excitation. This description also offers a mathematical basis to directly compare the computational capabilities of a given physical reservoir operated across classical and quantum regimes. Applying this framework to the classification of quantum states of systems that are part of the same measurement chain as the quantum reservoir computer, we assess and explain measurement-contingent advantages and disadvantages of reservoir processing in quantum regimes. Our results also identify the vicinity of bifurcation points as presenting optimal nonlinear processing regimes of an oscillator-based quantum reservoir. The considered models are directly realizable in modern circuit QED experiments, while the framework is applicable to more general quantum nonlinear reservoirs.
Quantum reservoir computing offers a promising route for time series learning by modelling sequential data via rich quantum dynamics while the only training required happens at the level of a lightweight classical readout. However, studies featuring efficient and implementable quantum reservoir architectures along with model learning guarantees remain scarce in the literature. To close this gap, we introduce QuaRK, an end-to-end framework that couples a hardware-realistic quantum reservoir featurizer with a kernel-based readout scheme. Given a sequence of sample points, the reservoir injects the points one after the other to yield a compact feature vector from efficiently measured k-local observables using classical shadow tomography, after which a classical kernel-based readout learns the target mapping with explicit regularization and fast optimization. The resulting pipeline exposes clear computational knobs -- circuit width and depth as well as the measurement budget -- while preserving the flexibility of kernel methods to model nonlinear temporal functionals and being scalable to high-dimensional data. We further provide learning-theoretic generalization guarantees for dependent temporal data, linking design and resource choices to finite-sample performance, thereby offering principled guidance for building reliable temporal learners. Empirical experiments validate QuaRK and illustrate the predicted interpolation and generalization behaviours on synthetic beta-mixing time series tasks.
Reservoir models offer a hardware-efficient learning paradigm for noisy intermediate-scale quantum devices by exploiting untrained quantum dynamics as a fixed feature map and restricting optimization to a simple classical readout layer. We propose a quantum extreme learning machine implemented using gaussian boson sampling and an encoding strategy that achieves high classification accuracy while reducing optical resource requirements. Classical inputs are jointly encoded in the squeezing parameters and in the interferometer unitary, enabling sampling-based, highly nonlinear feature maps while leveraging large-scale GBS output statistics, which are conjectured to be classically intractable. We systematically compare multiple families of quantum features accessible in the same setup and find that photon-number sampling probabilities provide the best performance, consistent with their higher effective feature dimensionality. Finally, we benchmark against classical nonlinear baselines and analyse robustness under noisy scenarios, showing competitive performance with fewer trainable parameters and indicating practical promise for near-term photonic implementations.