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

arXiv:2608.28440

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ń

quant-phSubmitted Aug 28, 2026• Announced Aug 31, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Related papers

When Can Quantum Extreme Learning Machines Replace Quantum Reservoirs?

Markus Baumann, Gerhard Stenzel, Jonas Stein +1 more

Quantum reservoir computers (QRCs) retain information from earlier inputs, whereas reset-window quantum extreme learning machines (QELMs) start afresh and receive only a recent input window. We establish when this window can replace the reservoir's memory. Under our stated assumptions and with exact expectation values, sufficiently expressive QELMs can reproduce reservoir outputs arbitrarily accurately as their windows grow precisely when the influence of the omitted past becomes uniformly negligible. However, longer windows do not always solve the problem. We construct a simple two-qubit reservoir that performs temporal recall exactly, while every fixed-window predictor faces the same positive worst-case error over unbounded delays, regardless of model capacity. Analytical benchmarks and simulations distinguish missing history from limited features and finite measurements. The central conclusion is simple: better representations can improve how available information is used, but cannot recover a past the model never receives.

quant-pharXiv:2609.31027•Sep 28, 2026•0 citations

Theory of the Edge-of-Chaos Advantage in Quantum Reservoir Computing

Shuaifan Cao, Wei Xia, Xiaopeng Li

Numerical studies suggest that quantum reservoir computing performs optimally near the edge of chaos, a behavior commonly attributed to a balance between memory retention and nonlinear information processing. Here we develop an explicit quantum reservoir model and rigorously analyze its chaotic regime and integrable point. In the chaotic regime, we show that Gaussian-unitary-ensemble statistics lead to rapid memory loss: learning performance decays exponentially with the storage time required by a temporal task. This decay limits the ability of chaotic reservoirs to learn long-range temporal dependencies. At the integrable point, described by a free-fermion model, we prove that amplitude encoding and a linear readout of fermionic two-point correlations cannot learn a representative class of nonlinear tasks coupling present and past inputs. Introducing interactions alleviates this obstruction. By identifying distinct limitations on memory retention in the chaotic regime and nonlinear processing at the integrable point, our analysis provides a theoretical basis for the observed edge-of-chaos advantage and guides the design of quantum reservoirs for temporal learning.

quant-pharXiv:2610.05213•Oct 6, 2026•0 citations

Quantum reservoir computing on random regular graphs

Moein N. Ivaki, Achilleas Lazarides, Tapio Ala-Nissilä

Quantum reservoir computing (QRC) is a low-complexity learning paradigm that combines the inherent dynamics of input-driven many-body quantum systems with classical learning techniques for nonlinear temporal data processing. Optimizing the QRC process and computing device is a complex task due to the dependence of many-body quantum systems on various factors. To explore this, we introduce a strongly interacting spin model on random regular graphs as the quantum component and investigate the interplay between static disorder, interactions, and graph connectivity, revealing their critical impact on quantum memory capacity and learnability accuracy. We tackle linear quantum and nonlinear classical tasks, and identify optimal learning and memory regimes through studying information localization, dynamical quantum correlations, and the many-body structure of the disordered Hamiltonian. In particular, we uncover the role of previously overlooked network connectivity and demonstrate how the presence of quantum correlations can significantly enhance the learning performance. Our findings thus provide guidelines for the optimal design of disordered analog quantum learning platforms.

arXiv:2409.03665•Physical Review A•Jul 14, 2025•9 citations

Breaking concentration barriers for quantum extreme learning on digital quantum processors

Timothée Dao, Ege Yilmaz, Ibrahim Shehzad +8 more

Reservoir computing leverages rich, non-linear dynamics to process temporal data. Quantum variants promise enhanced expressivity from high-dimensional Hilbert spaces, yet their practical applicability is hindered by hardware noise and concentration effects that can erase input-output distinguishability at large system sizes. In this work, we present and experimentally demonstrate a Quantum Extreme Learning Machine (QELM) tailored to state-of-the-art superconducting platforms, employing up to 124 qubits and circuits with more than 5,000 two-qubit gates on IBM Quantum computers. We introduce a practical multi-objective hyperparameter tuning strategy that jointly monitors observable variability, capacity, and task performance to identify noise-robust operating points. In addition, we develop a local eigentask analysis that enables computationally efficient feature selection and effective information retrieval. We report evidence of a regime of optimality that is identifiable at small scales and transferable across tasks and larger systems, and we achieve performances competitive with leading classical baselines on representative benchmarks for time-series forecasting and satellite image classification. Together, our results establish a viable and robust framework for large-scale, pre-fault-tolerant quantum machine learning and provide a foundation for extending reservoir-based methods to more expressive architectures and real-world scenarios.

quant-pharXiv:2603.13005•Mar 16, 2026•0 citations

Memory-augmented hybrid quantum reservoir computing

J. Settino, Luca Salatino, L. Mariani +10 more

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.

arXiv:2409.09886•Physical Review Applied•Jul 14, 2025•12 citations

Memory-enhanced quantum extreme learning machines for characterizing non-Markovian dynamics

Hajar Assil, Abderrahim El Allati, Gian Luca Giorgi

We use a Quantum Extreme Learning Machine for characterizing and estimating parameters of quantum dynamics generated by a tunable collision model. The input to the learning protocol consists of quantum states produced by successive system environment interactions, while the reservoir is implemented as a disordered many body quantum system evolving under a fixed Hamiltonian. We systematically explore how extending the QELM feature space, through the inclusion of temporal information and additional observables, affects estimation performance. Our results demonstrate that temporal extensions of the feature vector consistently and significantly enhance estimation accuracy relative to the baseline protocol. Notably, incorporating memory from earlier time steps yields the most substantial and robust improvements, whereas extensions based solely on additional observables offer only marginal gains. Crucially, the advantage conferred by temporal memory becomes increasingly pronounced as the dynamics become more strongly non Markovian, indicating that environmental memory effects serve as a constructive resource for learning.

quant-pharXiv:2603.17182•Physical Review Research•Mar 19, 2026•0 citations
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 computers (QRCs) retain information from earlier inputs, whereas reset-window quantum extreme learning machines (QELMs) start afresh and receive only a recent input window. We establish when this window can replace the reservoir's memory. Under our stated assumptions and with exact expectation values, sufficiently expressive QELMs can reproduce reservoir outputs arbitrarily accurately as their windows grow precisely when the influence of the omitted past becomes uniformly negligible. However, longer windows do not always solve the problem. We construct a simple two-qubit reservoir that performs temporal recall exactly, while every fixed-window predictor faces the same positive worst-case error over unbounded delays, regardless of model capacity. Analytical benchmarks and simulations distinguish missing history from limited features and finite measurements. The central conclusion is simple: better representations can improve how available information is used, but cannot recover a past the model never receives.
Numerical studies suggest that quantum reservoir computing performs optimally near the edge of chaos, a behavior commonly attributed to a balance between memory retention and nonlinear information processing. Here we develop an explicit quantum reservoir model and rigorously analyze its chaotic regime and integrable point. In the chaotic regime, we show that Gaussian-unitary-ensemble statistics lead to rapid memory loss: learning performance decays exponentially with the storage time required by a temporal task. This decay limits the ability of chaotic reservoirs to learn long-range temporal dependencies. At the integrable point, described by a free-fermion model, we prove that amplitude encoding and a linear readout of fermionic two-point correlations cannot learn a representative class of nonlinear tasks coupling present and past inputs. Introducing interactions alleviates this obstruction. By identifying distinct limitations on memory retention in the chaotic regime and nonlinear processing at the integrable point, our analysis provides a theoretical basis for the observed edge-of-chaos advantage and guides the design of quantum reservoirs for temporal learning.
Quantum reservoir computing (QRC) is a low-complexity learning paradigm that combines the inherent dynamics of input-driven many-body quantum systems with classical learning techniques for nonlinear temporal data processing. Optimizing the QRC process and computing device is a complex task due to the dependence of many-body quantum systems on various factors. To explore this, we introduce a strongly interacting spin model on random regular graphs as the quantum component and investigate the interplay between static disorder, interactions, and graph connectivity, revealing their critical impact on quantum memory capacity and learnability accuracy. We tackle linear quantum and nonlinear classical tasks, and identify optimal learning and memory regimes through studying information localization, dynamical quantum correlations, and the many-body structure of the disordered Hamiltonian. In particular, we uncover the role of previously overlooked network connectivity and demonstrate how the presence of quantum correlations can significantly enhance the learning performance. Our findings thus provide guidelines for the optimal design of disordered analog quantum learning platforms.
Reservoir computing leverages rich, non-linear dynamics to process temporal data. Quantum variants promise enhanced expressivity from high-dimensional Hilbert spaces, yet their practical applicability is hindered by hardware noise and concentration effects that can erase input-output distinguishability at large system sizes. In this work, we present and experimentally demonstrate a Quantum Extreme Learning Machine (QELM) tailored to state-of-the-art superconducting platforms, employing up to 124 qubits and circuits with more than 5,000 two-qubit gates on IBM Quantum computers. We introduce a practical multi-objective hyperparameter tuning strategy that jointly monitors observable variability, capacity, and task performance to identify noise-robust operating points. In addition, we develop a local eigentask analysis that enables computationally efficient feature selection and effective information retrieval. We report evidence of a regime of optimality that is identifiable at small scales and transferable across tasks and larger systems, and we achieve performances competitive with leading classical baselines on representative benchmarks for time-series forecasting and satellite image classification. Together, our results establish a viable and robust framework for large-scale, pre-fault-tolerant quantum machine learning and provide a foundation for extending reservoir-based methods to more expressive architectures and real-world scenarios.
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.
We use a Quantum Extreme Learning Machine for characterizing and estimating parameters of quantum dynamics generated by a tunable collision model. The input to the learning protocol consists of quantum states produced by successive system environment interactions, while the reservoir is implemented as a disordered many body quantum system evolving under a fixed Hamiltonian. We systematically explore how extending the QELM feature space, through the inclusion of temporal information and additional observables, affects estimation performance. Our results demonstrate that temporal extensions of the feature vector consistently and significantly enhance estimation accuracy relative to the baseline protocol. Notably, incorporating memory from earlier time steps yields the most substantial and robust improvements, whereas extensions based solely on additional observables offer only marginal gains. Crucially, the advantage conferred by temporal memory becomes increasingly pronounced as the dynamics become more strongly non Markovian, indicating that environmental memory effects serve as a constructive resource for learning.