In the field of quantum reservoir computing (QRC), many different computational models and architectures have been proposed. From these models, we identify feedback-based models -- which use a feedback mechanism to re-embed classical measurements from the QRC -- and recurrent models -- which use a multi-register approach with memory and readout qubits -- as the two major competing architectures that have been discussed and validated on hardware. In this paper, we advance upon the recurrent architectures, which employ a two register approach to endow the QRC with a fading memory. While these approaches have been validated on hardware and have demonstrated great real-world performance on noisy-intermediate-scale-quantum (NISQ) quantum processing units (QPUs), the exact mechanism through which the memory capacity arises is not completely understood or fully controllable. With this, we augment the recurrent approaches and present a hardware-realizable mechanism, which we call a tunable partial-SWAP, that allows for the direct control of the rate of memory dissipation from a QRN implemented on a gate-based QPU. The theory behind this mechanism is discussed in terms of a controlled amplitude-damping channel and validation experiments using a randomized short-term memory capacity (STMC) recall benchmark and the NARMA-5 dataset are conducted using simulation and IBM QPUs, respectively.
In the field of quantum reservoir computing (QRC), many different computational models and architectures have been proposed. From these models, we identify feedback-based models -- which use a feedback mechanism to re-embed classical measurements from the QRC -- and recurrent models -- which use a multi-register approach with memory and readout qubits -- as the two major competing architectures that have been discussed and validated on hardware. In this paper, we advance upon the recurrent architectures, which employ a two register approach to endow the QRC with a fading memory. While these approaches have been validated on hardware and have demonstrated great real-world performance on noisy-intermediate-scale-quantum (NISQ) quantum processing units (QPUs), the exact mechanism through which the memory capacity arises is not completely understood or fully controllable. With this, we augment the recurrent approaches and present a hardware-realizable mechanism, which we call a tunable partial-SWAP, that allows for the direct control of the rate of memory dissipation from a QRN implemented on a gate-based QPU. The theory behind this mechanism is discussed in terms of a controlled amplitude-damping channel and validation experiments using a randomized short-term memory capacity (STMC) recall benchmark and the NARMA-5 dataset are conducted using simulation and IBM QPUs, respectively.
Quantum reservoir computing (QRC) offers a promising paradigm for harnessing quantum systems for machine learning tasks, especially in the era of noisy intermediate-scale quantum devices. While information-theoretical benchmarks like short-term memory capacity (STMC) are widely used to evaluate QRC performance, they fail to provide insights into the physical mechanisms underlying these quantum neural networks. We establish a quantitative connection between the optical absorption spectrum of a quantum reservoir and its memory performance, revealing that optimal STMC aligns directly with maximal absorption, providing a physical explanation for the previously reported "sweet-spot" behavior in QRC performance as a function of dissipation. This connection bridges quantum information theory with experimentally accessible physical properties, opening pathways for targeted engineering of quantum reservoir computers with optimized performance for specific tasks.
Quantum Reservoir Computing (QRC) processes temporal data by retaining a memory of past inputs in the recurrent state of a quantum system, whereas a Quantum Extreme-Learning Machine (QELM) discards that memory, resetting the system at every step so that only the most recent input shapes the response. The two are usually treated as separate computational paradigms. We show that they are the two limits of a single architecture, connected by the input-encoding length, that is, the number of qubits overwritten with fresh data at each step. When a single qubit is re-encoded the system operates as a standard QRC, when the whole register is re-encoded it operates as a QELM, and intermediate lengths interpolate between them. The overwritten qubits hold the recent past in an explicit register, while the remaining qubits are never reset and carry older inputs forward in their evolving quantum state, so the encoding length redistributes memory between explicit and recurrent storage at fixed system size. Tuning the reservoir Hamiltonian and the evolution time with Bayesian optimization at each encoding length, we find that recurrent quantum memory is essential when a task must reach far into the past, and dispensable when the relevant history is short, where the memoryless reset limit already suffices. For every task the best reservoirs operate at the edge of chaos, where they perform as well as a densely connected reservoir with random all-to-all couplings of the same size, indicating that what temporal processing requires is the dynamical regime rather than the connectivity.
Quantum Reservoir Computing (QRC) exploits the rich dynamics of quantum many-body systems to process time-dependent information with high-dimensional state spaces. While neutral atom arrays offer a scalable platform for this paradigm, realizing intrinsic temporal memory without relying on external classical buffering requires precise control over the relaxation dynamics of the system. We address the necessity of specific non-unitary dynamics for enforcing fading memory while overcoming the lack of separability. This study simulates and empirically identifies the specific dynamical regimes required to maximize the computational capacity of the reservoir, addressing the amount of dissipation, the effectiveness of lying at the edge of quantum chaos, and that of time-multiplexing compared to the scaling of the physical size of the system. Here we show that controlled dissipation is strictly necessary to induce echo state property, fading memory, and separability, in neutral atom arrays. Computational performance increases at the edge of quantum chaos. The counter-intuitive residual memory provided by the unital phase damping channel is justified by introducing a model based on pure outputs. The consequent implementation enables the solution of complex non-linear tasks, such as the Mackey-Glass time series, with as few as N=5 atoms. We establish a rigorous framework for engineering dissipative quantum reservoirs required for intrinsic temporal processing on near-term quantum devices.
Abstract We introduce and test two measurement-free training primitives for quantum reservoir computers (QRC). Protocol~A encodes the loss gradient in an auxiliary phase that is fed back coherently before a dissipative reset; Protocol~B realizes gradient descent as relaxation of an engineered open system. Both match exact-gradient training in simulation---the ancilla and reset simulated as channels in a de-risk stage, their validated error model applied at the benchmark stage---on a minimal transverse-field Ising reservoir, with the coherent cost oracle emulated classically and its realization costed. A fully coherent update loop (quantum parameter register, unitary controlled update, no readout anywhere) descends the true landscape, its feedback drift attenuated by exactly 2F−1 with the fixed point unchanged. Benchmarked against classical reservoir computing--- including the memory-augmented hybrid---they improve one-step chaotic prediction, though a thirty-seed study finds no autonomous-prediction advantage; we therefore make no quantum-advantage claim. The study instead addresses three questions that gate this route. First, within the channel model studied, the reset fidelity already demonstrated in measurement-free quantum error correction [Butt \textit{et al.}, Nat.\Commun.\\textbf{17}, 995 (2026)] suffices: reset is not the bottleneck. Second, the binding constraint is coherent cost-oracle precision, set by a finite-difference catastrophic cancellation that the exact parameter-shift rule removes, loosening the oracle-precision target 2.5-fold in a like-for-like comparison. Third, a fault-tolerant realization---arithmetic and synthesis costs taken from real circuits---needs only ∼104 physical qubits and is runtime-, not qubit-bound. On three free IBM Quantum 156-qubit Heron backends at three error-mitigation levels the simulation-optimized state survives device noise (RMSE 0.016--0.057, i.e.$7$--26% of the signal spread, correlation ≥0.97). All code, seeds, and job identifiers are released.
Quantum reservoir computing (QRC) harnesses driven quantum dynamics for time-series processing, yet the mechanisms behind the differing performance levels across its many implementations remain unclear. We show that apparently unrelated approaches-including memory restriction, weak measurements, operation near the edge of quantum chaos, and dissipative dynamics-are in fact governed by the same underlying principle, namely a tunable balance between memory retention and nonlinear response. Using the information processing capacity, a dynamical measure from nonlinear systems theory, we place these behaviors in a unified framework and identify the regimes in which quantum reservoirs surpass the standard protocol. Our results reveal a fundamental connection between memory and nonlinear response. This provides a general design principle for enhanced information processing and enables systematic analysis and optimization inspired by classical dynamical quantifiers.
Quantum Reservoir Computing (QRC) has emerged as a powerhouse for Noisy Intermediate-Scale Quantum (NISQ) machine learning, offering the ability to process complex temporal data with minimal training overhead by leveraging the high-dimensional dynamics of quantum states. This paper introduces QRC-Lab, an open-source, modular Python framework designed specifically to facilitate the transition from theoretical quantum dynamics to applied machine learning research. We provide a rigorous definition of QRC, contrasting physical and gate-based approaches, and detail the mathematical foundations of the reservoir mapping. QRC-Lab’s gate-based architecture is presented as a flexible laboratory for exploring data encoding, reservoir connectivity, and measurement strategies. We validate the framework through diverse case studies, including Short-Term Memory capacity, non-linear Parity check, and NARMA-type forecasting. Furthermore, we discuss the framework’s future roadmap towards multi-platform hardware support and its role in visualizing theoretical risk bounds, positioning QRC-Lab as a vital tool for the next generation of quantum computing education.