Abstract Combining the benefits of quantum computing and artificial neural networks, quantum reservoir computing shows potential for handling complex tasks due to its access to the Hilbert space in exponential dimensions. In this study, the quantum Fourier transform algorithm is implemented utilizing quantum reservoir computing, demonstrating its unique advantages. For the random interactions within the reservoirs, quantum reservoir computing avoids the cost of precise control of the physical system. The proposed model only requires to optimize a linear readout layer, thus significantly reducing the computational cost required for training. The accuracy of the implementation is numerically demonstrated and the model is integrated into quantum circuits to correctly execute the quantum phase estimation algorithm. Additionally, the impacts of different reservoir structures and dissipation intensities within the reservoir, and the results indicate the robustness of the model are discussed.
Abstract Combining the benefits of quantum computing and artificial neural networks, quantum reservoir computing shows potential for handling complex tasks due to its access to the Hilbert space in exponential dimensions. In this study, the quantum Fourier transform algorithm is implemented utilizing quantum reservoir computing, demonstrating its unique advantages. For the random interactions within the reservoirs, quantum reservoir computing avoids the cost of precise control of the physical system. The proposed model only requires to optimize a linear readout layer, thus significantly reducing the computational cost required for training. The accuracy of the implementation is numerically demonstrated and the model is integrated into quantum circuits to correctly execute the quantum phase estimation algorithm. Additionally, the impacts of different reservoir structures and dissipation intensities within the reservoir, and the results indicate the robustness of the model are discussed.
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 Quantum computers require precise control over parameters and careful engineering of the underlying physical system. In contrast, neural networks have evolved to tolerate imprecision and inhomogeneity. Here, using a reservoir computing architecture we show how a random network of quantum nodes can be used as a robust hardware for quantum computing. Our network architecture induces quantum operations by optimising only a single layer of quantum nodes, a key advantage over the traditional neural networks where many layers of neurons have to be optimised. We demonstrate how a single network can induce different quantum gates, including a universal gate set. Moreover, in the few-qubit regime, we show that sequences of multiple quantum gates in quantum circuits can be compressed with a single operation, potentially reducing the operation time and complexity. As the key resource is a random network of nodes, with no specific topology or structure, this architecture is a hardware friendly alternative paradigm for quantum computation.
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.
Accelerating computation with quantum resources is limited by the challenges of high-fidelity control of quantum systems. Reservoir computing presents an attractive alternative, as precise control and full calibration of system dynamics are not required. Instead, complex internal trajectories in a large state space are leveraged as a computational resource. Quantum systems offer a unique venue for reservoir computing, given the presence of interactions unavailable in classical systems and a potentially exponentially-larger computational space. With a reservoir comprised of a single d-dimensional quantum system, we demonstrate clear performance improvement with Hilbert space dimension at two benchmark tasks and advantage over the physically analogous classical reservoir. Quantum reservoirs as realized by current-era quantum hardware offer immediate practical implementation and a promising outlook for increased performance in larger systems.
Recent developments in quantum computing and machine learning have propelled the interdisciplinary study of quantum machine learning. Sequential modeling is an important task with high scientific and commercial value. Existing VQC or QNN-based methods require significant computational resources to perform the gradient-based optimization of a larger number of quantum circuit parameters. The major drawback is that such quantum gradient calculation requires a large amount of circuit evaluation, posing challenges in current near-term quantum hardware and simulation software. In this work, we approach sequential modeling by applying a reservoir computing (RC) framework to quantum recurrent neural networks (QRNN-RC) that are based on classical RNN, LSTM and GRU. The main idea to this RC approach is that the QRNN with randomly initialized weights is treated as a dynamical system and only the final classical linear layer is trained. Our numerical simulations show that the QRNN-RC can reach results comparable to fully trained QRNN models for several function approximation and time series prediction tasks. Since the QRNN training complexity is significantly reduced, the proposed model trains notably faster. In this work we also compare to corresponding classical RNN-based RC implementations and show that the quantum version learns faster by requiring fewer training epochs in most cases. Our results demonstrate a new possibility to utilize quantum neural network for sequential modeling with greater quantum hardware efficiency, an important design consideration for noisy intermediate-scale quantum (NISQ) computers.
Abstract Quantum reservoir networks combine the intelligence of neural networks with the potential of quantum computing in a single platform. This platform operates on the architecture of reservoir computing, which can function even with random connections between neural nodes. This is a major advantage for hardware implementation. Herein is described how reservoir computing is brought into the quantum domain to perform various tasks, including characterization of quantum states, quantum estimation, quantum state preparation, and quantum computing. It shows quantum enhancement in classical data processing, and creates the opportunity for quantum information processing within the robust paradigm of neural networks. It is friendly for implementation in a wide range of physical systems, including quantum dots, superconductors, trapped ions, cold atoms, and exciton‐polaritons.