Existing approaches to quantum reservoir computing can be broadly categorized into restart-based and continuous protocols. Restart-based methods require reinitializing the quantum circuit for each time step, while continuous protocols use mid-circuit measurements to enable uninterrupted information processing. A gap exists between these two paradigms: while restart-based methods naturally have high execution times due to the need for circuit reinitialization, they can employ novel feedback connections to enhance performance. In contrast, continuous methods have significantly faster execution times but typically lack such feedback mechanisms. In this work, we investigate a novel quantum reservoir computing scheme that integrates feedback connections, which can operate within the coherence time of a qubit. We demonstrate our architecture using a minimal example and evaluate memory capacity and predictive capabilities. We show that the correlation coefficient for the shortterm memory task on past inputs is nonzero, indicating that feedback connections can effectively operate during continuous processing to allow the model to remember past inputs.
Existing approaches to quantum reservoir computing can be broadly categorized into restart-based and continuous protocols. Restart-based methods require reinitializing the quantum circuit for each time step, while continuous protocols use mid-circuit measurements to enable uninterrupted information processing. A gap exists between these two paradigms: while restart-based methods naturally have high execution times due to the need for circuit reinitialization, they can employ novel feedback connections to enhance performance. In contrast, continuous methods have significantly faster execution times but typically lack such feedback mechanisms. In this work, we investigate a novel quantum reservoir computing scheme that integrates feedback connections, which can operate within the coherence time of a qubit. We demonstrate our architecture using a minimal example and evaluate memory capacity and predictive capabilities. We show that the correlation coefficient for the shortterm memory task on past inputs is nonzero, indicating that feedback connections can effectively operate during continuous processing to allow the model to remember past inputs.
Quantum reservoir computing (QRC) is a highly promising computational paradigm that leverages quantum systems as a computational resource for nonlinear information processing. While its application to time-series analysis is eagerly anticipated, prevailing approaches suffer from the collapse of the quantum state upon measurement, resulting in the erasure of temporal input memories. Neither repeated initializations nor weak measurements offer a fundamental solution, as the former escalates the time complexity while the latter restricts the information extraction from the Hilbert space. To address this issue, we propose the feedback-driven QRC framework. This methodology employs projective measurements on all qubits for unrestricted access to the quantum state, with the measurement outcomes subsequently fed back into the reservoir to restore the memory of prior inputs. We demonstrate that our QRC successfully acquires the fading-memory property through the feedback connections, a critical aspect in time-series processing. Notably, analysis of measurement trajectories reveals three distinct phases depending on the feedback strength, with the memory performance maximized at the edge of chaos. We also evaluate the predictive capabilities of our QRC, demonstrating its suitability for forecasting signals originating from quantum spin systems. Published by the American Physical Society 2024
Reservoir computing promises a fast method for handling large amounts of temporal data. This hinges on constructing a good reservoir--a dynamical system capable of transforming inputs into a high-dimensional representation while remembering properties of earlier data. In this work, we introduce a reservoir based on recurrent quantum feature maps where a fixed quantum circuit is reused to encode both current inputs and a classical feedback signal derived from previous outputs. We evaluate the model on the Mackey-Glass time-series prediction task using our recently introduced CP feature map, and find that it achieves lower mean squared error than standard classical baselines, including echo state networks and multilayer perceptrons, while maintaining compact circuit depth and qubit requirements. We further analyze memory capacity and show that the model effectively retains temporal information, consistent with its forecasting accuracy. Finally, we study the impact of realistic noise and find that performance is robust to several noise channels but remains sensitive to two-qubit gate errors, identifying a key limitation for near-term implementations.
We propose a scheme that can enhance the performance and reduce the computational cost of quantum reservoir computing. Quantum reservoir computing is a computing approach which aims at utilizing the complexity and high dimensionality of small quantum systems, together with the fast trainability of reservoir computing, in order to solve complex tasks. The suitability of quantum reservoir computing for solving temporal tasks is hindered by the collapse of the quantum system when measurements are made. This leads to the erasure of the memory of the reservoir. Hence, for every output, the entire input signal is needed to reinitialize the reservoir, leading to quadratic time complexity. Another critical issue for the hardware implementation of quantum reservoir computing is the need for an experimentally accessible means of tuning the nonlinearity of the quantum reservoir. We present an approach which addresses both of these issues. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs to reinitialize the reservoir after measurements are performed. This strongly influences the nonlinearity of the reservoir response due to the influence of the initial reservoir state, while also substantially reducing the number of quantum operations needed to perform time-series prediction tasks due to the linear rather than quadratic time complexity. The reinitialization length therefore provides an experimental accessible means of tuning the nonlinearity of the response of the reservoir, which can lead to significant task-specific performance improvement. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model. Published by the American Physical Society 2024
Reservoir computing (RC) is an effective method for predicting chaotic systems by using a high-dimensional dynamic reservoir with fixed internal weights, while keeping the learning phase linear, which simplifies training and reduces computational complexity compared to fully trained recurrent neural networks (RNNs). Quantum reservoir computing (QRC) uses the exponential growth of Hilbert spaces in quantum systems, allowing for greater information processing, memory capacity, and computational power. However, the original QRC proposal requires coherent injection of inputs multiple times, complicating practical implementation. We present a hybrid quantum-classical approach that implements memory through classical post-processing of quantum measurements. This approach avoids the need for multiple coherent input injections and is evaluated on benchmark tasks, including the chaotic Mackey-Glass time series prediction. We tested our model on two physical platforms: a fully connected Ising model and a Rydberg atom array. The optimized model demonstrates promising predictive capabilities, achieving a higher number of steps compared to previously reported approaches.
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 computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it exploits the large computational capacity of qubits without suffering from typical issues arising when training variational quantum circuits. In particular, quantum gate-based echo state networks have proven effective when the evolution of the reservoir circuit is non-unital. Nonetheless, a method for ensuring a tunable and stable non-unital circuit evolution was lacking. We propose an algorithm that induces damping by applying a controlled rotation to each qubit in the reservoir. It enables tunable, circuit-level amplitude amplification of the zero state, maintaining the system away from the maximally mixed state and preventing information loss caused by repeated mid-circuit measurements. The algorithm is inherently stable over time, as it can process arbitrarily long input sequences, beyond the coherence time of individual qubits, by inducing arbitrary damping on each qubit. Moreover, we show that quantum correlations between qubits improve memory retention, underscoring the potential utility of a quantum system as a computational reservoir. We demonstrate, through standard reservoir computing benchmarks, that this algorithm enables robust and scalable quantum random computing on fault-tolerant quantum hardware.