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:2609.31027

When Can Quantum Extreme Learning Machines Replace Quantum Reservoirs?

Markus Baumann, Gerhard Stenzel, Jonas Stein, Claudia Linnhoff-Popien

quant-phSubmitted Sep 25, 2026• Announced Sep 28, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks when a reset-window quantum extreme learning machine (QELM), receiving only the latest $d$ inputs, can reproduce a quantum reservoir computer’s outputs. It separates unavailable history from limited representation capacity and measurement noise. Define $D_d$ as the largest output difference between histories sharing their last $d$ inputs. For scalar outputs, the optimal worst-case window-only error is exactly $D_d/2$, attained by the midpoint of compatible outputs. Under finite-dimensional, compact-input, continuity and freely concatenable-input assumptions, a uniformly universal QELM family approaches this bound with exact expectations. Arbitrarily accurate emulation is therefore possible iff $D_d\to0$. A reachable–observable reduction connects this condition to a joint spectral radius $r_{\mathrm{vis}}<1$, with $\lim_d D_d^{1/d}=r_{\mathrm{vis}}$. For $0<r_{\mathrm{vis}}<1$, the required context scales asymptotically as $\log(1/\varepsilon)/[-\log r_{\mathrm{vis}}]$. A two-qubit counterexample stores an old pulse in a protected singlet population: a persistent gap $\delta$ forces error at least $\delta/2$ for every fixed window over unbounded delays. A one-radian pulse gives $\delta\approx0.1149$. Proofs, Bernstein-based QELM constructions, analytical one-qubit benchmarks and small-system simulations establish or illustrate these statements. The guarantees concern representability, not efficient learning or resource savings. One construction uses $rd$ qubits and up to $(r+1)^d$ readout coefficients, whose computation is excluded from resource counts. Finite-shot bounds are pointwise, not simultaneous over histories. Simulations do not estimate worst-case memory decay, omit hardware errors and measurement backaction, and include classical controls outperforming the tested quantum models. The separation concerns retained memory versus finite context, not quantum versus classical computation.

Some signs of AI-generated textAI use disclosedIncrementalUnclear novelty
OpenAI Codex assisted with ideation, manuscript wording, and code and figure preparation, including debugging.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
12 pages, 3 figures

Related papers

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

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•2 citations

Theory and interpretability of Quantum Extreme Learning Machines: a Pauli transfer matrix approach

Markus Gross, Hans-Martin Rieser

Quantum reservoir computers (QRCs) have emerged as a promising approach to quantum machine learning, since they utilize the natural dynamics of quantum systems for data processing and are simple to train. Here, we consider $n$-qubit quantum extreme learning machines (QELMs) with initial-state encoding and continuous-time reservoir dynamics. Applying the Pauli transfer matrix (PTM) formalism reveals the encoding-generated features and their linear transformation by quantum channels, and thereby provides a nonlinear vector autoregression model as an interpretable classical representation of a QELM. We show that the nonlinear information processing capacity of a QELM factorizes into the ability of the encoding to represent a given target function and the decodability of the relevant Pauli features after the effective PTM. Comparing geometric and statistical decodability reveals features that are algebraically hidden yet recoverable through data correlations. We relate the decodability of Pauli features to the spreading of measurement operators under Heisenberg evolution (Krylov growth). Focusing on the unitary channel, we discuss how structured Hamiltonians, when paired with certain observables, can impair model performance, as reflected in a low rank of the readout and the effective PTMs. We trace this effect to Hamiltonian symmetries and derive asymptotic rank estimates for symmetry-resolved observable families. Our decodability analysis disentangles the contributions of encoding, reservoir dynamics, and measurement observables, and thus provides interpretable diagnostics that can inform the design of QELMs and reduce reliance on exhaustive hyperparameter search. As a specific application, we consider forecasting nonlinear dynamical systems and show that the readout of a trained QELM closely matches the expression of the underlying flow map at leading orders.

quant-pharXiv:2602.18377•Physical Review A•Feb 23, 2026•2 citations

On fundamental aspects of quantum extreme learning machines

Weijie Xiong, Giorgio Facelli, Mehrad Sahebi +4 more

Abstract Quantum extreme learning machines (QELMs) have emerged as a promising framework for quantum machine learning. Their appeal lies in the rich feature map induced by the dynamics of a quantum substrate—the quantum reservoir—and the efficient post-measurement training via linear regression. Here, we study the expressivity of QELMs by decomposing the prediction of QELMs into a Fourier series. We show that the achievable Fourier frequencies are determined by the data encoding scheme, while Fourier coefficients depend on both the reservoir and the measurement. Notably, the expressivity of QELMs is fundamentally limited by the number of Fourier frequencies and the number of observables, while the complexity of the prediction hinges on the reservoir. As a cautionary note on scalability, we identify four sources that can lead to the exponential concentration of the observables as the system size grows (randomness, hardware noise, entanglement, and global measurements) and show how this can turn QELMs into useless input-agnostic oracles. In particular, our result on the reservoir-induced concentration strongly indicates that quantum reservoirs drawn from a highly random ensemble make QELM models unscalable. Our analysis elucidates the potential and fundamental limitations of QELMs and lays the groundwork for systematically exploring quantum reservoir systems for other machine learning tasks.

arXiv:2312.15124•Quantum Machine Intelligence•Feb 13, 2025•75 citations

Recurrent Quantum Feature Maps for Reservoir Computing

Utkarsh Singh, Aaron Z. Goldberg, Christoph Simon +1 more

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.

quant-pharXiv:2604.03469•Apr 7, 2026•0 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•5 citations
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.
The paper asks when a reset-window quantum extreme learning machine (QELM), receiving only the latest ddd inputs, can reproduce a quantum reservoir computer’s outputs. It separates unavailable history from limited representation capacity and measurement noise.
Define DdD_dDd​ as the largest output difference between histories sharing their last ddd inputs. For scalar outputs, the optimal worst-case window-only error is exactly Dd/2D_d/2Dd​/2, attained by the midpoint of compatible outputs. Under finite-dimensional, compact-input, continuity and freely concatenable-input assumptions, a uniformly universal QELM family approaches this bound with exact expectations. Arbitrarily accurate emulation is therefore possible iff Dd→0D_d\to0Dd​→0. A reachable–observable reduction connects this condition to a joint spectral radius rvis<1r_{\mathrm{vis}}<1rvis​<1, with lim⁡dDd1/d=rvis\lim_d D_d^{1/d}=r_{\mathrm{vis}}limd​Dd1/d​=rvis​. For 0<rvis<10<r_{\mathrm{vis}}<10<rvis​<1, the required context scales asymptotically as log⁡(1/ε)/[−log⁡rvis]\log(1/\varepsilon)/[-\log r_{\mathrm{vis}}]log(1/ε)/[−logrvis​].
A two-qubit counterexample stores an old pulse in a protected singlet population: a persistent gap δ\deltaδ forces error at least δ/2\delta/2δ/2 for every fixed window over unbounded delays. A one-radian pulse gives δ≈0.1149\delta\approx0.1149δ≈0.1149. Proofs, Bernstein-based QELM constructions, analytical one-qubit benchmarks and small-system simulations establish or illustrate these statements.
The guarantees concern representability, not efficient learning or resource savings. One construction uses rdrdrd qubits and up to (r+1)d(r+1)^d(r+1)d readout coefficients, whose computation is excluded from resource counts. Finite-shot bounds are pointwise, not simultaneous over histories. Simulations do not estimate worst-case memory decay, omit hardware errors and measurement backaction, and include classical controls outperforming the tested quantum models. The separation concerns retained memory versus finite context, not quantum versus classical computation.
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.
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.
Quantum reservoir computers (QRCs) have emerged as a promising approach to quantum machine learning, since they utilize the natural dynamics of quantum systems for data processing and are simple to train. Here, we consider nnn-qubit quantum extreme learning machines (QELMs) with initial-state encoding and continuous-time reservoir dynamics. Applying the Pauli transfer matrix (PTM) formalism reveals the encoding-generated features and their linear transformation by quantum channels, and thereby provides a nonlinear vector autoregression model as an interpretable classical representation of a QELM. We show that the nonlinear information processing capacity of a QELM factorizes into the ability of the encoding to represent a given target function and the decodability of the relevant Pauli features after the effective PTM. Comparing geometric and statistical decodability reveals features that are algebraically hidden yet recoverable through data correlations. We relate the decodability of Pauli features to the spreading of measurement operators under Heisenberg evolution (Krylov growth). Focusing on the unitary channel, we discuss how structured Hamiltonians, when paired with certain observables, can impair model performance, as reflected in a low rank of the readout and the effective PTMs. We trace this effect to Hamiltonian symmetries and derive asymptotic rank estimates for symmetry-resolved observable families. Our decodability analysis disentangles the contributions of encoding, reservoir dynamics, and measurement observables, and thus provides interpretable diagnostics that can inform the design of QELMs and reduce reliance on exhaustive hyperparameter search. As a specific application, we consider forecasting nonlinear dynamical systems and show that the readout of a trained QELM closely matches the expression of the underlying flow map at leading orders.
Abstract Quantum extreme learning machines (QELMs) have emerged as a promising framework for quantum machine learning. Their appeal lies in the rich feature map induced by the dynamics of a quantum substrate—the quantum reservoir—and the efficient post-measurement training via linear regression. Here, we study the expressivity of QELMs by decomposing the prediction of QELMs into a Fourier series. We show that the achievable Fourier frequencies are determined by the data encoding scheme, while Fourier coefficients depend on both the reservoir and the measurement. Notably, the expressivity of QELMs is fundamentally limited by the number of Fourier frequencies and the number of observables, while the complexity of the prediction hinges on the reservoir. As a cautionary note on scalability, we identify four sources that can lead to the exponential concentration of the observables as the system size grows (randomness, hardware noise, entanglement, and global measurements) and show how this can turn QELMs into useless input-agnostic oracles. In particular, our result on the reservoir-induced concentration strongly indicates that quantum reservoirs drawn from a highly random ensemble make QELM models unscalable. Our analysis elucidates the potential and fundamental limitations of QELMs and lays the groundwork for systematically exploring quantum reservoir systems for other machine learning tasks.
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.
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.