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

Enhanced Nonlinear Capacity of a Trapped-Ion Quantum Memristor Reservoir

Anna Frolova, Sergey Yu Stremoukhov, П. А. Форш, Ksenia Khabarova, Nikolay Kolachevsky

Published Nov 3, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

Abstract We present a numerical study of a quantum memristor (QM) reservoir based on a trapped-ion platform. The reservoir exploits nonlinear input-output mapping arising from Born-rule nonlinearity, quantum coherences, and feedback-induced fading memory to process classical time-series data.We benchmarked the performance of the QM reservoir on monomial approximation, NARMA, Mackey-Glass, and the Santa Fe time series, standard tasks in reservoir computing and quantum reservoir computing (QRC). The QM reservoir shows a clear memory-nonlinearity trade-off. Its nonlinear capacity scales favorably: two coupled QMs reproduce monomials xd up to degree d=100 with test MSE below 10-2, while classical echo state networks (ESNs) fail beyond d ≈ 40 and show no improvement with increasing size up to 2000 nodes. However, for memory-dominated tasks such as NARMA10, the same two-QM extension provides only marginal gains; the insensitivity of the test MSE to the memory decay parameter confirms that, in the present architecture, nonlinear expressivity rather than dynamical memory is the main computational resource. On standard time-series benchmarks, the QM reservoir matches the accuracy of small ESNs while using a comparable number of readout weights, and it remains robust against gate noise.Our results establish trapped-ion QMs as a competitive QRC platform with particular advantages in tasks dominated by strong nonlinearity.

DOI
10.21203/rs.3.rs-11404134/v1

Related papers

Quantum reservoir computing in Jaynes-Cummings models: Nonlinear memory and time-series prediction

Sreetama Das, Gian Luca Giorgi, Roberta Zambrini

We investigate quantum reservoir computing (QRC) using a hybrid qubit-boson system described by the Jaynes-Cummings (JC) Hamiltonian and its dispersive limit (DJC). These models provide high-dimensional Hilbert spaces and intrinsic nonlinear dynamics, making them powerful substrates for temporal information processing. We systematically benchmark both reservoirs through linear and nonlinear memory tasks, demonstrating that they exhibit an unusual superior nonlinear over linear memory capacity. We further test their predictive performance on the Mackey-Glass time series, a widely used benchmark for chaotic dynamics, and show comparable forecasting ability. We also investigate how memory and prediction accuracy vary with reservoir parameters and show the role of higher-order bosonic observables and time multiplexing in enhancing expressivity, even in minimal spin-boson configurations. Our results establish JC- and DJC-based reservoirs as versatile platforms for time-series processing and as elementary units that overcome the setting of equivalent qubit pairs and offer pathways toward tunable, high-performance quantum machine learning architectures.

arXiv:2510.00171•Physical Review Research•Mar 12, 2026•7 citations

Memory-Augmented Hybrid Quantum Reservoir Computing

J. Settino, L. Salatino, L. Mariani +9 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.

quant-pharXiv:2409.09886•Physical Review Applied•Sep 17, 2024•21 citations

QRCKAN: Kolmogorov–Arnold Readouts for Quantum Reservoir Computing of Chaotic Dynamics

Brianna Jones, Harshita Dua, Harini Muthurengan +1 more

Quantum reservoir computing (QRC) offers a train-light approach to temporal learning by keeping the quantum dynamics fixed and training only a classical readout. Most QRC studies use linear readouts, potentially leaving nonlinear structure in measured reservoir states under-exploited. Inspired by recent reservoir-computing Kolmogorov–Arnold networks (RCKAN), we study Kolmogorov–Arnold Network (KAN)-style spline readouts for stateful QRC. Our QRCKAN architecture combines a refreshed-input, persistent-memory density-matrix reservoir with correlation observables, a shallow spline KAN readout, an optional current-state skip, and a residual formulation that adds a validation-weighted nonlinear correction to ridge regression. We summarize five seeded runs on Lorenz-63 and Mackey–Glass against matched linear QRC, stateless quantum feature maps, no-QRC controls, echo-state networks (ESNs), lag-based regressors, LSTM, and Transformer baselines. On Lorenz-63, residual QRCKAN reduces mean one-step NRMSE by 51.6% relative to QRC+Linear+Skip (0.000820 vs. 0.001696) and raises mean valid prediction time (VPT) from 102 to 218 steps. On Mackey–Glass, QRCKAN reduces mean one-step NRMSE by 78.2% and rollout NRMSE by 81.0%, while increasing mean VPT from 118 to 262 steps. Matched no-skip QRC–QFF comparisons and matched no-QRC controls support contributions from temporal state and reservoir features under the tested configurations. Because seed 0 informed architecture selection and is included in these summaries, all intervals and tests are exploratory rather than independent confirmatory inference. Strong ESNs remain superior in one-step accuracy. We claim an exploratory nonlinear-readout improvement within simulated QRC, not a general quantum advantage.

Proceedings of the AAAI Symposium Series•Nov 6, 2026•0 citations

Enhancing Quantum Reservoir Computing: Optimization Strategies and Real-World Applications

Sanket Shah, E. Wes Bethel

Quantum Reservoir Computing (QRC) exploits quantum dynamical systems as high-dimensional reservoirs for temporal sequence modeling. This work investigates QRC based on Rydberg atom arrays and evaluates its performance on both synthetic and real-world datasets. We analyze the effects of lattice geometry, readout mechanisms, and measurement shot count on predictive accuracy. Our results show that QRC achieves performance comparable to, and in some cases exceeding, classical Reservoir Computing (RC), particularly for tasks involving complex temporal dependencies. Reservoir geometry plays a size-dependent role: honeycomb lattices yield higher accuracy at small reservoir sizes, while square lattices scale more effectively as the number of atoms increases. Among readout strategies, Support Vector Regression consistently outperforms Ridge Regression and Neural Networks in extracting nonlinear structure from reservoir states. Increasing the number of measurement shots improves accuracy, with diminishing returns beyond a saturation threshold. Overall, this study delineates the conditions under which QRC offers advantages over classical RC and identifies regimes where classical approaches remain competitive. These findings provide practical guidance for optimizing QRC architectures and contribute to the development of quantum-enhanced time-series modeling.

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum•May 1, 2026•0 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

Optimizing quantum noise-induced reservoir computing for nonlinear and chaotic time series prediction

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

Quantum reservoir computing is strongly emerging for sequential and time series data prediction in quantum machine learning. We make advancements to the quantum noise-induced reservoir, in which reservoir noise is used as a resource to generate expressive, nonlinear signals that are efficiently learned with a single linear output layer. We address the need for quantum reservoir tuning with a novel and generally applicable approach to quantum circuit parameterization, in which tunable noise models are programmed to the quantum reservoir circuit to be fully controlled for effective optimization. Our systematic approach also involves reductions in quantum reservoir circuits in the number of qubits and entanglement scheme complexity. We show that with only a single noise model and small memory capacities, excellent simulation results were obtained on nonlinear benchmarks that include the Mackey-Glass system for 100 steps ahead in the challenging chaotic regime.

arXiv:2303.05488•Scientific Reports•Nov 7, 2023•35 citations
Abstract We present a numerical study of a quantum memristor (QM) reservoir based on a trapped-ion platform. The reservoir exploits nonlinear input-output mapping arising from Born-rule nonlinearity, quantum coherences, and feedback-induced fading memory to process classical time-series data.We benchmarked the performance of the QM reservoir on monomial approximation, NARMA, Mackey-Glass, and the Santa Fe time series, standard tasks in reservoir computing and quantum reservoir computing (QRC). The QM reservoir shows a clear memory-nonlinearity trade-off. Its nonlinear capacity scales favorably: two coupled QMs reproduce monomials xd up to degree d=100 with test MSE below 10-2, while classical echo state networks (ESNs) fail beyond d ≈ 40 and show no improvement with increasing size up to 2000 nodes. However, for memory-dominated tasks such as NARMA10, the same two-QM extension provides only marginal gains; the insensitivity of the test MSE to the memory decay parameter confirms that, in the present architecture, nonlinear expressivity rather than dynamical memory is the main computational resource. On standard time-series benchmarks, the QM reservoir matches the accuracy of small ESNs while using a comparable number of readout weights, and it remains robust against gate noise.Our results establish trapped-ion QMs as a competitive QRC platform with particular advantages in tasks dominated by strong nonlinearity.
We investigate quantum reservoir computing (QRC) using a hybrid qubit-boson system described by the Jaynes-Cummings (JC) Hamiltonian and its dispersive limit (DJC). These models provide high-dimensional Hilbert spaces and intrinsic nonlinear dynamics, making them powerful substrates for temporal information processing. We systematically benchmark both reservoirs through linear and nonlinear memory tasks, demonstrating that they exhibit an unusual superior nonlinear over linear memory capacity. We further test their predictive performance on the Mackey-Glass time series, a widely used benchmark for chaotic dynamics, and show comparable forecasting ability. We also investigate how memory and prediction accuracy vary with reservoir parameters and show the role of higher-order bosonic observables and time multiplexing in enhancing expressivity, even in minimal spin-boson configurations. Our results establish JC- and DJC-based reservoirs as versatile platforms for time-series processing and as elementary units that overcome the setting of equivalent qubit pairs and offer pathways toward tunable, high-performance quantum machine learning architectures.
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) offers a train-light approach to temporal learning by keeping the quantum dynamics fixed and training only a classical readout. Most QRC studies use linear readouts, potentially leaving nonlinear structure in measured reservoir states under-exploited. Inspired by recent reservoir-computing Kolmogorov–Arnold networks (RCKAN), we study Kolmogorov–Arnold Network (KAN)-style spline readouts for stateful QRC. Our QRCKAN architecture combines a refreshed-input, persistent-memory density-matrix reservoir with correlation observables, a shallow spline KAN readout, an optional current-state skip, and a residual formulation that adds a validation-weighted nonlinear correction to ridge regression. We summarize five seeded runs on Lorenz-63 and Mackey–Glass against matched linear QRC, stateless quantum feature maps, no-QRC controls, echo-state networks (ESNs), lag-based regressors, LSTM, and Transformer baselines. On Lorenz-63, residual QRCKAN reduces mean one-step NRMSE by 51.6% relative to QRC+Linear+Skip (0.000820 vs. 0.001696) and raises mean valid prediction time (VPT) from 102 to 218 steps. On Mackey–Glass, QRCKAN reduces mean one-step NRMSE by 78.2% and rollout NRMSE by 81.0%, while increasing mean VPT from 118 to 262 steps. Matched no-skip QRC–QFF comparisons and matched no-QRC controls support contributions from temporal state and reservoir features under the tested configurations. Because seed 0 informed architecture selection and is included in these summaries, all intervals and tests are exploratory rather than independent confirmatory inference. Strong ESNs remain superior in one-step accuracy. We claim an exploratory nonlinear-readout improvement within simulated QRC, not a general quantum advantage.
Quantum Reservoir Computing (QRC) exploits quantum dynamical systems as high-dimensional reservoirs for temporal sequence modeling. This work investigates QRC based on Rydberg atom arrays and evaluates its performance on both synthetic and real-world datasets. We analyze the effects of lattice geometry, readout mechanisms, and measurement shot count on predictive accuracy. Our results show that QRC achieves performance comparable to, and in some cases exceeding, classical Reservoir Computing (RC), particularly for tasks involving complex temporal dependencies. Reservoir geometry plays a size-dependent role: honeycomb lattices yield higher accuracy at small reservoir sizes, while square lattices scale more effectively as the number of atoms increases. Among readout strategies, Support Vector Regression consistently outperforms Ridge Regression and Neural Networks in extracting nonlinear structure from reservoir states. Increasing the number of measurement shots improves accuracy, with diminishing returns beyond a saturation threshold. Overall, this study delineates the conditions under which QRC offers advantages over classical RC and identifies regimes where classical approaches remain competitive. These findings provide practical guidance for optimizing QRC architectures and contribute to the development of quantum-enhanced time-series modeling.
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.
Quantum reservoir computing is strongly emerging for sequential and time series data prediction in quantum machine learning. We make advancements to the quantum noise-induced reservoir, in which reservoir noise is used as a resource to generate expressive, nonlinear signals that are efficiently learned with a single linear output layer. We address the need for quantum reservoir tuning with a novel and generally applicable approach to quantum circuit parameterization, in which tunable noise models are programmed to the quantum reservoir circuit to be fully controlled for effective optimization. Our systematic approach also involves reductions in quantum reservoir circuits in the number of qubits and entanglement scheme complexity. We show that with only a single noise model and small memory capacities, excellent simulation results were obtained on nonlinear benchmarks that include the Mackey-Glass system for 100 steps ahead in the challenging chaotic regime.