Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Secure Cyber Computing and Communications (ICSCCC)

Modular Quantum Recurrent Neural Networks: Scalable Reservoir Computing with High Noise Resilience

Rakesh Sengupta

Published May 29, 2026• 0 citations
Publisher

Abstract

We introduce a modular architecture for Quantum Recurrent Neural Networks (QRNNs) that reconciles temporal learning with the resource constraints of Noisy Intermediate-Scale Quantum (NISQ) devices. A product-state approximation decomposes Hamiltonian dynamics into locally entangled clusters, yielding an exponential reduction in simulation memory—up to 341× at N = 8 qubits, from $\mathcal{O}\left( {{2^{2N}}} \right)$ to $\mathcal{O}\left( {k\cdot {\text{ }}{2^{2m}}} \right)$ per module—while preserving critical intra-module correlations. Benchmarked on a Quantum Reservoir Computing (QRC) Memory Capacity task, the modular approach retains ≈ 85% of temporal memory capacity at N = 8. At N = 4 it outperforms the monolithic baseline (MC= 0.65 vs. 0.53), revealing a noise compartmentalization effect that shields the reservoir from global decoherence. Zero-Noise Extrapolation (ZNE) recovers single-qubit expectations to within ±0.005, and Trotterized gate-level estimates give 896 CNOTs for N = 8, placing implementation within current NISQ reach.

DOI
10.1109/icsccc69031.2026.11600184

Related papers

Reservoir Computing via Quantum Recurrent Neural Networks

Samuel Yen-Chi Chen, Daniel Fry, Deshmukh, Amol +2 more

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.

arXiv:2211.02612•Nov 4, 2022•32 citations

Scalable Quantum Reservoir Computing over Distributed Quantum Architectures

Ioannis Liliopoulos, Georgios D. Varsamis, Konstantinos Rallis +4 more

Reservoir computing provides an alternative to recurrent neural networks by overcoming the common problems of backpropagation through time and by training only a simple readout layer. The emerging field of quantum computing offers a new computing paradigm that promises to enhance learning through richer feature representations. In this work, we investigate quantum reservoir computing for time-series forecasting. We explore and benchmark four different architectures that combine single or multiple (distributed) reservoirs with single or multiple (distributed) ridge-regression readout layers. We evaluate these architectures using ideal and hardware-informed noisy simulations, and include both hybrid and fully quantum variants, with classical reservoir counterparts serving as a baseline. The results indicate that quantum-enhanced configurations consistently improve forecasting accuracy by reducing the mean absolute error (MAE) and the root mean squared error (RMSE) up to 78.8% and 72.3%, respectively, while distributed architectures effectively enable scaling by utilizing multiple quantum resources in a hardware-agnostic manner. These findings support distributed quantum reservoir computing as a promising, modular approach for forecasting on the quantum platforms of the noisy intermediate-scale quantum (NISQ) era.

quant-pharXiv:2605.04991•May 7, 2026•1 citation

Feedback-driven recurrent quantum neural network universality

Lukas Gonon, Martínez-Peña, Rodrigo, Juan‐Pablo Ortega

Quantum reservoir computing uses the dynamics of quantum systems to process temporal data, making it particularly well-suited for machine learning with noisy intermediate-scale quantum devices. Recent developments have introduced feedback-based quantum reservoir systems, which process temporal information with comparatively fewer components and enable real-time computation while preserving the input history. Motivated by their promising empirical performance, in this work, we study the approximation capabilities of feedback-based quantum reservoir computing. More specifically, we are concerned with recurrent quantum neural networks, which are quantum analogues of classical recurrent neural networks. Our results show that regular state-space systems can be approximated using quantum recurrent neural networks without the curse of dimensionality and with the number of qubits only growing logarithmically in the reciprocal of the prescribed approximation accuracy. Notably, our analysis demonstrates that quantum recurrent neural networks are universal with linear readouts, making them both powerful and experimentally accessible. These results pave the way for practical and theoretically grounded quantum reservoir computing with real-time processing capabilities.

arXiv:2506.16332•Jun 19, 2025•7 citations

A fully quantum-native recurrent neural network for end-to-end sequential learning on NISQ hardware

Rui Huang, Haibo Yi

Abstract Modeling temporal dependencies within quantum systems remains a key challenge for quantum machine learning. Current quantum neural networks largely depend on classical recurrent modules, which introduce optimization bottlenecks and coherence loss during sequence processing. To address this, we propose a fully quantum-native recurrent neural network (QRNN) for end-to-end sequential learning. Our architecture captures temporal dynamics through coherent unitary operations, avoiding external classical recurrence and mid-circuit state collapse. The proposed model was benchmarked against a classical recurrent neural network (RNN), quantum tensor networks, and state-of-the-art hybrid QRNN using the Origin Quantum superconducting platform. Experimental evaluations on nonlinear functions, complex dynamical systems, and meteorological datasets demonstrate that our quantum-native QRNN achieves improved prediction accuracy and exhibits enhanced capability in forecasting complex temporal features. For instance, on the relative humidity forecasting task, the proposed QRNN achieves a 73.5% reduction in Root mean square error compared to the hybrid VQRNN. This work establishes a robust framework for preserving coherence in pure quantum sequential processing, offering a scalable path for time-series forecasting on near-term quantum hardware.

Machine Learning Science and Technology•Apr 15, 2026•3 citations

From quantum reservoirs to quantum extreme learning machines through a nearest-neighbor spin chain with tunable quantum memory

Carlos Ramon-Escandell, Arnau Riera, Marcin Płodzień

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.

quant-pharXiv:2608.28440•Aug 31, 2026•0 citations

QRC-Lab: An Educational Toolbox for Quantum Reservoir Computing

Anderson Fernandes Pereira dos Santos

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.

•Feb 3, 2026•0 citations
We introduce a modular architecture for Quantum Recurrent Neural Networks (QRNNs) that reconciles temporal learning with the resource constraints of Noisy Intermediate-Scale Quantum (NISQ) devices. A product-state approximation decomposes Hamiltonian dynamics into locally entangled clusters, yielding an exponential reduction in simulation memory—up to 341× at N = 8 qubits, from O(22N)\mathcal{O}\left( {{2^{2N}}} \right)O(22N) to O(k⋅ 22m)\mathcal{O}\left( {k\cdot {\text{ }}{2^{2m}}} \right)O(k⋅ 22m) per module—while preserving critical intra-module correlations. Benchmarked on a Quantum Reservoir Computing (QRC) Memory Capacity task, the modular approach retains ≈ 85% of temporal memory capacity at N = 8. At N = 4 it outperforms the monolithic baseline (MC= 0.65 vs. 0.53), revealing a noise compartmentalization effect that shields the reservoir from global decoherence. Zero-Noise Extrapolation (ZNE) recovers single-qubit expectations to within ±0.005, and Trotterized gate-level estimates give 896 CNOTs for N = 8, placing implementation within current NISQ reach.
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.
Reservoir computing provides an alternative to recurrent neural networks by overcoming the common problems of backpropagation through time and by training only a simple readout layer. The emerging field of quantum computing offers a new computing paradigm that promises to enhance learning through richer feature representations. In this work, we investigate quantum reservoir computing for time-series forecasting. We explore and benchmark four different architectures that combine single or multiple (distributed) reservoirs with single or multiple (distributed) ridge-regression readout layers. We evaluate these architectures using ideal and hardware-informed noisy simulations, and include both hybrid and fully quantum variants, with classical reservoir counterparts serving as a baseline. The results indicate that quantum-enhanced configurations consistently improve forecasting accuracy by reducing the mean absolute error (MAE) and the root mean squared error (RMSE) up to 78.8% and 72.3%, respectively, while distributed architectures effectively enable scaling by utilizing multiple quantum resources in a hardware-agnostic manner. These findings support distributed quantum reservoir computing as a promising, modular approach for forecasting on the quantum platforms of the noisy intermediate-scale quantum (NISQ) era.
Quantum reservoir computing uses the dynamics of quantum systems to process temporal data, making it particularly well-suited for machine learning with noisy intermediate-scale quantum devices. Recent developments have introduced feedback-based quantum reservoir systems, which process temporal information with comparatively fewer components and enable real-time computation while preserving the input history. Motivated by their promising empirical performance, in this work, we study the approximation capabilities of feedback-based quantum reservoir computing. More specifically, we are concerned with recurrent quantum neural networks, which are quantum analogues of classical recurrent neural networks. Our results show that regular state-space systems can be approximated using quantum recurrent neural networks without the curse of dimensionality and with the number of qubits only growing logarithmically in the reciprocal of the prescribed approximation accuracy. Notably, our analysis demonstrates that quantum recurrent neural networks are universal with linear readouts, making them both powerful and experimentally accessible. These results pave the way for practical and theoretically grounded quantum reservoir computing with real-time processing capabilities.
Abstract Modeling temporal dependencies within quantum systems remains a key challenge for quantum machine learning. Current quantum neural networks largely depend on classical recurrent modules, which introduce optimization bottlenecks and coherence loss during sequence processing. To address this, we propose a fully quantum-native recurrent neural network (QRNN) for end-to-end sequential learning. Our architecture captures temporal dynamics through coherent unitary operations, avoiding external classical recurrence and mid-circuit state collapse. The proposed model was benchmarked against a classical recurrent neural network (RNN), quantum tensor networks, and state-of-the-art hybrid QRNN using the Origin Quantum superconducting platform. Experimental evaluations on nonlinear functions, complex dynamical systems, and meteorological datasets demonstrate that our quantum-native QRNN achieves improved prediction accuracy and exhibits enhanced capability in forecasting complex temporal features. For instance, on the relative humidity forecasting task, the proposed QRNN achieves a 73.5% reduction in Root mean square error compared to the hybrid VQRNN. This work establishes a robust framework for preserving coherence in pure quantum sequential processing, offering a scalable path for time-series forecasting on near-term quantum hardware.
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) 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.