A common system model is developed that connects QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations and specifies the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.
Abstract
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.
A theoretical framework in Pauli-Liouville space is developed that provides a unified analytical treatment of the echo state property (ESP), nonlinear expressive power, and quantum resources and shows that the ESP is natively guaranteed by the Liouvillian spectral gap, decoupling it from quantum magic.
Quantum reservoir computing (QRC) provides a powerful framework for processing temporal data using quantum dynamics, but incorporating measurements into the reservoir remains a fundamental challenge and distinctive feature with respect to classical settings. The induced back-action can vary from a source of disturbance to a computational resource, as measurement deeply modifies the dynamics underlying temporal processing. Existing approaches have treated specific monitoring schemes independently, missing the common physical principles governing online quantum reservoirs. Here we develop a general theory of monitored quantum reservoir computing based on indirect quantum measurements, which unifies projective, weak, partial, and dissipative monitoring protocols within a single operational framework. Measurement back-action can serve as a controllable resource, providing the effective dissipation and non-unital dynamics required for successful QRC, even when the underlying unmonitored evolution is unsuitable. We derive general criteria under which monitored dynamics satisfy the echo-state property, fading memory, and input separability, including a necessary and sufficient condition for emergent strict contractivity. By comparing different monitoring schemes under a common reference dynamics, we show that these protocols are not interchangeable parameterizations to be optimized for peak performance, but rather constitute qualitatively distinct routes to computational capability, each enabled by the interplay between information extraction and measurement-induced disturbance -- a trade-off that can be further shaped through time multiplexing. Our results provide a unified theoretical foundation for online monitored quantum reservoir computing and establish quantum measurement engineering as a systematic approach for designing reservoir architectures across different quantum platforms.
Oriol Morguí-Sancho, Gonzalo Manzano, G. Giorgi et al.· 2 citations
Quantum reservoir computing processes temporal information through driven many-body dynamics, but its performance is ultimately limited by how accurately past inputs can be extracted from finite measurements. Here we formulate this limitation as a local multiparameter estimation problem and introduce a delay-space quantum Fisher information matrix to quantify the distinguishability of information stored at different delays. This perspective identifies Fisher-orthogonal memory as a measurement-efficient design principle: different delays should perturb the reservoir state along mutually Fisher-orthogonal directions. We first analyze the single-qubit limit using the Gill--Massar bound, revealing an optimal write-store-routing trade-off. Guided by this structure, we construct solvable multi-qubit reservoirs based on Clifford routing orbits and Singer-cycle Pauli algebra. The resulting dynamics yield diagonal delay-space QFIMs with analytically programmable fading profiles. Under finite-shot local Pauli readout, these reservoirs retain sharp memory windows that are absent in a validation-selected Ising baseline. Their product-task behavior is governed by second-order responses inherited from the same Pauli-routing algebra. Our results provide an analytically controlled route toward measurement-efficient quantum reservoir computing.
Group Reservoir Computing is introduced, an efficient machine-learning paradigm for learning temporal dynamics whose training reduces to a single linear regression, to reduce the resources required.
F. Caravelli, Roberto Menta, Antonio Sannia· 0 citations
For an open quantum reservoir, how the system forgets is part of how it computes. Quantum reservoir computing processes input streams with fixed quantum dynamics and trains only a linear readout. Dissipation can make old inputs fade, but prior studies commonly fix the environmental process and tune only its strength. Here we show numerically that the coupling pattern, meaning whether transitions connect to separate or shared environmental channels, changes which parts of the input history remain accessible. Paired simulations of finite spin reservoirs keep the Hamiltonian, inputs, measurements, and readout fixed. The tested patterns produce distinct task profiles, with no universal winner. Shared relaxation preserves more recent input history than independent local loss, and the retained memory changes when the qubits contribute with different relative phases to the shared decay channel. This ordering recurs across system sizes, Hamiltonians, input protocols, and targeted controls. Environmental coupling is therefore more than a damping parameter: it is a design layer that shapes not only how quickly information fades, but which input history remains available for computation.
M. Baumann, Itamar Fink, Johannes Wittmann et al.· 0 citations
Quantum reservoir computing (QRC) offers a powerful approach to exploit the rich dynamics of quantum systems for information processing. However, the computational performance of conventional Hermitian reservoirs is inherently constrained by their nonlinearity and information-spreading ability. In this work, we propose a non-Hermitian QRC in which non-Hermitian dynamics are employed as a tunable resource to significantly enhance the QRC performance. By incorporating an imaginary interaction term into the one-dimensional XY spin model, the reservoir's information propagation extends beyond the Lieb-Robinson bound, resulting in accelerated information scrambling. Through spectral analysis and memory evaluation, we demonstrate that the non-Hermitian reservoir can be tuned toward the edge of chaos by varying a single parameter that controls the non-Hermitian strength. This tuning optimizes both memory and computational capacities, which are crucial for processing temporal sequences. For applications, we evaluate the predictive performance of both classical and quantum chaotic time series. Our results demonstrate superior performance compared with the Hermitian counterpart, with particularly notable advantages in predicting signals generated by the Sachdev-Ye-Kitaev model.
Yusen Wu, Chuan Wang, Lufan Zhang et al.· Quantum Science and Technolo...· 0 citations