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

Evaluating quantum circuits in the reservoir computing paradigm

Gaurav Rudra Malik, Amit Kumar Jaiswal, S. Aravinda, Sunil Kumar Mishra

quant-phSubmitted May 2, 2026• Announced May 5, 2026• 0 citations• Revised Jun 29, 2026 (v2)
v1 · May 2, 2026v2 · Jun 29, 2026
arXivHTMLPDF

Abstract

Reservoir computing is a framework which is primarily used for temporal information processing, using the intrinsic dynamics of an underlying physical system. The framework, in a quantum setup, is implemented using ergodic dynamics associated with Hamiltonian models. The computational power of the reservoir is closely tied to this underlying dynamical nature, and to probe this further, we study the effectiveness of a reservoir that is made using structured brickwall circuits built from two-qubit gates. Here, the global ergodic nature of the circuit model results from the said arrangement, which has an important role in extracting useful performance with a minimal setup that is independent of an associated Hamiltonian. We focus on the nature of the gates used in this setup and evaluate the resulting reservoir performance, correlating the same with known results on the dynamical nature of the circuit in question. As a baseline, we analyse brickwall circuits composed of Haar-random two-qubit gates, before moving on to dual-unitaries, where tunable ergodic properties allow us to systematically investigate its relationship with reservoir performance. We further consider a class of non-random two-qubit gates obeying a specific solvability condition, wherein the associated dynamics surpasses the equivalent circuit made up of two qubit Haar random unitaries in terms of randomness. Finally, we consider examples of Krylov space analytics, which allow for a reliable prediction of effective circuit reservoirs for sufficient task performance. Using the introduced metrics we validate the reservoir for time-series prediction using standard synthetic data sets to evaluate the fading memory capacity and accuracy for prediction tasks. Our results indicate that structured quantum circuits would serve as effective models that yield better and efficient task performance in reservoir computing applications.

Comments
24 pages and 14 figures. Journal submission planned

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

Multivariate quantum reservoir computing with discrete and continuous variable systems

Tobias Fellner, Jonas Merklinger, Christian Holm

Quantum reservoir computing is a promising paradigm for processing temporal data. So far, the primary focus has been on univariate time series. However, the most relevant and complex real-world data is multidimensional. In this paper, we establish an extensive framework for multivariate data processing in quantum reservoir computing. We propose and evaluate three multivariate encoding schemes and introduce the mixing capacity as a novel metric to evaluate the effectiveness with which a reservoir combines independent data streams. The computational performance of these proposed schemes is systematically assessed using this metric, as well as on the chaotic Lorenz-63 system prediction task, for two quantum reservoirs based on discrete and continuous-variable quantum systems. Furthermore, we relate the computational performance on these tasks to the underlying quantum properties of the reservoir. Our findings reveal that the optimal encoding method is highly dependent on the reservoir system and the specific task, underlining the importance of a task-specific input design. Moreover, we observe that peak computational performance coincides with the presence of non-classical effects, which indicates that quantum resources play a role in processing multivariate data.

quant-pharXiv:2604.08427•Apr 10, 2026•0 citations

Optimal quantum reservoir learning in proximity to universality

Moein N. Ivaki, Matias Karjula, Tapio Ala-Nissilä

The study of the boundary between classically simulable and computationally complex quantum dynamics is fundamental to understanding which physical resources may enable enhanced information-processing capabilities. We investigate this within the framework of quantum reservoir computing by introducing a tunable N -qubit random circuit model, where a fraction p of Clifford gates are probabilistically substituted with nonstabilizing conditional- T ̂ gates. We establish a direct correspondence between the reservoir's performance on temporal processing tasks and its entanglement-spectrum statistics and long-range nonstabilizer resource content. To assess scalability, we study the scaling of the antiflatness of states in the large- N limit at a fixed circuit depth ratio d / N ∼ O ( 1 ) . This is taken as a witness to the concentration of measures, a known impediment to learning in thermalizing systems. We demonstrate that the learnability and scalability of the reservoir can be continuously controlled by the parameter p , allowing us to navigate from classically tractable to maximally expressive quantum dynamics. These architecture-agnostic results provide a general strategy for designing tunable and expressive quantum reservoirs, highlighting how certain nonclassical properties control average-case intrinsic learnability and functionality.

arXiv:2510.18623•Physical Review A•May 13, 2026•1 citation

The role of entanglement in quantum reservoir computing with coupled Kerr nonlinear oscillators

Ali Karimi, Hadi Zadeh‐Haghighi, Youssef Kora +1 more

Quantum Reservoir Computing (QRC) utilizes the intrinsic dynamics of quantum systems to process temporal data efficiently, offering potential advantages in computational power and energy efficiency. Unlike classical reservoirs, quantum reservoirs leverage properties such as superposition and entanglement, which may enhance information processing capabilities. In this work, we investigate a QRC framework based on two coupled Kerr nonlinear oscillators, a system well-suited for time-series prediction tasks due to its complex nonlinear interactions and potentially high-dimensional state space. We explore how its performance in time-series prediction depends on key physical parameters: input drive strength, Kerr nonlinearity, and oscillator coupling, and analyze the role of entanglement in improving the reservoir’s computational performance, focusing on its effect on predicting non-trivial time series. Using logarithmic negativity to quantify entanglement and normalized root mean square error (NRMSE) to evaluate predictive accuracy, our results suggest that entanglement provides a computational advantage on average up to a threshold in the input frequency, which persists under some levels of dissipation and dephasing. These findings contribute to the broader understanding of quantum reservoirs and highlight their potential for high performance, efficient quantum machine learning and time-series forecasting.

arXiv:2508.11175•Photonics for Quantum (PfQ)•Jun 13, 2025•0 citations

Robust Quantum Learning through Hamiltonian Reservoir Computing

Youya Xu, Chengyong Yu, Sanjib Ghosh

Quantum learning provides a versatile paradigm for information processing by exploiting the intrinsic representational capacity of high-dimensional Hilbert spaces. Here, we investigate a Hamiltonian-encoding framework for quantum reservoir computing that simultaneously addresses three key challenges in quantum learning: trainability, hardware efficiency, and information stability. In this framework, input data are directly mapped onto a fixed Hamiltonian and transformed into expressive nonlinear features through quantum dynamical evolution. By employing the reservoir-computing paradigm, the approach naturally circumvents the barren plateau problem in quantum learning landscapes. We validate the framework across two complementary platforms: an analog superconducting array processor and a digital gate-based quantum circuit implementation. Despite their fundamentally different realizations, both platforms exhibit comparable representational power and achieve competitive learning performance, establishing a unified framework for cross-platform quantum learning. While both implementations achieve comparable performance, the analog processor may offer a more hardware-efficient realization by bypassing the temporal overhead of gate-based decomposition and thereby making more effective use of finite coherence times, albeit at the expense of universality. Furthermore, we find that finite dissipation suppresses quantum-scrambling-induced instabilities at long evolution times and can enhance learning performance, revealing a constructive role for environmental coupling in stabilizing quantum learning dynamics. Collectively, these results establish Hamiltonian-encoded reservoir computing as a compact, expressive, and hardware-efficient paradigm for quantum learning on current-generation quantum platforms.

quant-pharXiv:2607.08037•Jul 10, 2026•0 citations
Reservoir computing is a framework which is primarily used for temporal information processing, using the intrinsic dynamics of an underlying physical system. The framework, in a quantum setup, is implemented using ergodic dynamics associated with Hamiltonian models. The computational power of the reservoir is closely tied to this underlying dynamical nature, and to probe this further, we study the effectiveness of a reservoir that is made using structured brickwall circuits built from two-qubit gates. Here, the global ergodic nature of the circuit model results from the said arrangement, which has an important role in extracting useful performance with a minimal setup that is independent of an associated Hamiltonian. We focus on the nature of the gates used in this setup and evaluate the resulting reservoir performance, correlating the same with known results on the dynamical nature of the circuit in question. As a baseline, we analyse brickwall circuits composed of Haar-random two-qubit gates, before moving on to dual-unitaries, where tunable ergodic properties allow us to systematically investigate its relationship with reservoir performance. We further consider a class of non-random two-qubit gates obeying a specific solvability condition, wherein the associated dynamics surpasses the equivalent circuit made up of two qubit Haar random unitaries in terms of randomness. Finally, we consider examples of Krylov space analytics, which allow for a reliable prediction of effective circuit reservoirs for sufficient task performance. Using the introduced metrics we validate the reservoir for time-series prediction using standard synthetic data sets to evaluate the fading memory capacity and accuracy for prediction tasks. Our results indicate that structured quantum circuits would serve as effective models that yield better and efficient task performance in reservoir computing applications.
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 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 a promising paradigm for processing temporal data. So far, the primary focus has been on univariate time series. However, the most relevant and complex real-world data is multidimensional. In this paper, we establish an extensive framework for multivariate data processing in quantum reservoir computing. We propose and evaluate three multivariate encoding schemes and introduce the mixing capacity as a novel metric to evaluate the effectiveness with which a reservoir combines independent data streams. The computational performance of these proposed schemes is systematically assessed using this metric, as well as on the chaotic Lorenz-63 system prediction task, for two quantum reservoirs based on discrete and continuous-variable quantum systems. Furthermore, we relate the computational performance on these tasks to the underlying quantum properties of the reservoir. Our findings reveal that the optimal encoding method is highly dependent on the reservoir system and the specific task, underlining the importance of a task-specific input design. Moreover, we observe that peak computational performance coincides with the presence of non-classical effects, which indicates that quantum resources play a role in processing multivariate data.
The study of the boundary between classically simulable and computationally complex quantum dynamics is fundamental to understanding which physical resources may enable enhanced information-processing capabilities. We investigate this within the framework of quantum reservoir computing by introducing a tunable N -qubit random circuit model, where a fraction p of Clifford gates are probabilistically substituted with nonstabilizing conditional- T ̂ gates. We establish a direct correspondence between the reservoir's performance on temporal processing tasks and its entanglement-spectrum statistics and long-range nonstabilizer resource content. To assess scalability, we study the scaling of the antiflatness of states in the large- N limit at a fixed circuit depth ratio d / N ∼ O ( 1 ) . This is taken as a witness to the concentration of measures, a known impediment to learning in thermalizing systems. We demonstrate that the learnability and scalability of the reservoir can be continuously controlled by the parameter p , allowing us to navigate from classically tractable to maximally expressive quantum dynamics. These architecture-agnostic results provide a general strategy for designing tunable and expressive quantum reservoirs, highlighting how certain nonclassical properties control average-case intrinsic learnability and functionality.
Quantum Reservoir Computing (QRC) utilizes the intrinsic dynamics of quantum systems to process temporal data efficiently, offering potential advantages in computational power and energy efficiency. Unlike classical reservoirs, quantum reservoirs leverage properties such as superposition and entanglement, which may enhance information processing capabilities. In this work, we investigate a QRC framework based on two coupled Kerr nonlinear oscillators, a system well-suited for time-series prediction tasks due to its complex nonlinear interactions and potentially high-dimensional state space. We explore how its performance in time-series prediction depends on key physical parameters: input drive strength, Kerr nonlinearity, and oscillator coupling, and analyze the role of entanglement in improving the reservoir’s computational performance, focusing on its effect on predicting non-trivial time series. Using logarithmic negativity to quantify entanglement and normalized root mean square error (NRMSE) to evaluate predictive accuracy, our results suggest that entanglement provides a computational advantage on average up to a threshold in the input frequency, which persists under some levels of dissipation and dephasing. These findings contribute to the broader understanding of quantum reservoirs and highlight their potential for high performance, efficient quantum machine learning and time-series forecasting.
Quantum learning provides a versatile paradigm for information processing by exploiting the intrinsic representational capacity of high-dimensional Hilbert spaces. Here, we investigate a Hamiltonian-encoding framework for quantum reservoir computing that simultaneously addresses three key challenges in quantum learning: trainability, hardware efficiency, and information stability. In this framework, input data are directly mapped onto a fixed Hamiltonian and transformed into expressive nonlinear features through quantum dynamical evolution. By employing the reservoir-computing paradigm, the approach naturally circumvents the barren plateau problem in quantum learning landscapes. We validate the framework across two complementary platforms: an analog superconducting array processor and a digital gate-based quantum circuit implementation. Despite their fundamentally different realizations, both platforms exhibit comparable representational power and achieve competitive learning performance, establishing a unified framework for cross-platform quantum learning. While both implementations achieve comparable performance, the analog processor may offer a more hardware-efficient realization by bypassing the temporal overhead of gate-based decomposition and thereby making more effective use of finite coherence times, albeit at the expense of universality. Furthermore, we find that finite dissipation suppresses quantum-scrambling-induced instabilities at long evolution times and can enhance learning performance, revealing a constructive role for environmental coupling in stabilizing quantum learning dynamics. Collectively, these results establish Hamiltonian-encoded reservoir computing as a compact, expressive, and hardware-efficient paradigm for quantum learning on current-generation quantum platforms.