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

WORLD SCIENTIFIC eBooks

Quantum Reservoir Computing

Published Jun 16, 2026• 0 citations
Publisher
DOI
10.1142/9789819830237_0019

Related papers

Quantum Reservoir Computing

Claudio Conti

Quantum science and technology•Sep 4, 2023•0 citations

Quantum Reservoir Computing for small quantum systems

Joel Steinegger

•Jan 14, 2025•0 citations

The role of coherence in Quantum Reservoir Computing

Ana Palacios de Luis

•Jan 1, 2020•0 citations

Quantum Reservoir Computing in Atomic Lattices

Guillem Llodrà, Pere Mujal, Roberta Zambrini +1 more

•Jan 1, 2024•1 citation

Enhancing the performance of quantum reservoir computing and solving the time-complexity problem by artificial memory restriction

Saud Čindrak, Brecht Donvil, Kathy Lüdge +1 more

We propose a scheme that can enhance the performance and reduce the computational cost of quantum reservoir computing. Quantum reservoir computing is a computing approach which aims at utilizing the complexity and high dimensionality of small quantum systems, together with the fast trainability of reservoir computing, in order to solve complex tasks. The suitability of quantum reservoir computing for solving temporal tasks is hindered by the collapse of the quantum system when measurements are made. This leads to the erasure of the memory of the reservoir. Hence, for every output, the entire input signal is needed to reinitialize the reservoir, leading to quadratic time complexity. Another critical issue for the hardware implementation of quantum reservoir computing is the need for an experimentally accessible means of tuning the nonlinearity of the quantum reservoir. We present an approach which addresses both of these issues. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs to reinitialize the reservoir after measurements are performed. This strongly influences the nonlinearity of the reservoir response due to the influence of the initial reservoir state, while also substantially reducing the number of quantum operations needed to perform time-series prediction tasks due to the linear rather than quadratic time complexity. The reinitialization length therefore provides an experimental accessible means of tuning the nonlinearity of the response of the reservoir, which can lead to significant task-specific performance improvement. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model. Published by the American Physical Society 2024

arXiv:2306.12876•Physical Review Research•Jan 16, 2024•33 citations

The Fundamental Tension in Topological Quantum Reservoir Computing: Why Unitarity Opposes the Echo State Property

Daniel Mo Houshmand, Q | D∂rıα⟩

Reservoir computing exploits high-dimensional nonlinear dynamics to solve temporal prediction tasks with minimal training cost. We investigate Topological Quantum Reservoir Computing (TQRC), which proposes to harness the braiding dynamics of Fibonacci anyons as quantum reservoirs. Our comprehensive analysis reveals a fundamental tension: the very properties that make topological systems attractive for quantum computation (unitary evolution and information preservation) fundamentally oppose the Echo State Property (ESP) required for reservoir computing. We demonstrate rigorously that pure unitary TQRC violates the ESP: unitary evolution preserves distances in Hilbert space, preventing the fading memory necessary for reservoir computing. On Mackey-Glass time series benchmarks, pure unitary TQRC achieves NRMSE ≈ 1.0 (equivalent to random guessing). Introducing controlled dissipation recovers functional reservoir dynamics (best NRMSE = 0.44), but at the cost of sacrificing topological protection. Critically, we show that classical Echo State Networks outperform dissipative TQRC by 20× at equivalent state-space dimension (ESN NRMSE = 0.02 vs. TQRC NRMSE = 0.44 for d = 13). We identify four root causes: (1) probability readout constrains states to the simplex, (2) measurement destroys phase information, (3) | • | 2 provides weaker nonlinearity than tanh, and (4) structured braid matrices limit state-space utilization. These results constitute a no-go theorem for topological quantum reservoir computing: topological protection and reservoir computing functionality represent fundamentally competing requirements. This finding provides essential guidance for the quantum machine learning community, establishing that topological protection should not be pursued as a route to quantum reservoir computing advantage.

•Dec 11, 2025•0 citations
We propose a scheme that can enhance the performance and reduce the computational cost of quantum reservoir computing. Quantum reservoir computing is a computing approach which aims at utilizing the complexity and high dimensionality of small quantum systems, together with the fast trainability of reservoir computing, in order to solve complex tasks. The suitability of quantum reservoir computing for solving temporal tasks is hindered by the collapse of the quantum system when measurements are made. This leads to the erasure of the memory of the reservoir. Hence, for every output, the entire input signal is needed to reinitialize the reservoir, leading to quadratic time complexity. Another critical issue for the hardware implementation of quantum reservoir computing is the need for an experimentally accessible means of tuning the nonlinearity of the quantum reservoir. We present an approach which addresses both of these issues. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs to reinitialize the reservoir after measurements are performed. This strongly influences the nonlinearity of the reservoir response due to the influence of the initial reservoir state, while also substantially reducing the number of quantum operations needed to perform time-series prediction tasks due to the linear rather than quadratic time complexity. The reinitialization length therefore provides an experimental accessible means of tuning the nonlinearity of the response of the reservoir, which can lead to significant task-specific performance improvement. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model. Published by the American Physical Society 2024
Reservoir computing exploits high-dimensional nonlinear dynamics to solve temporal prediction tasks with minimal training cost. We investigate Topological Quantum Reservoir Computing (TQRC), which proposes to harness the braiding dynamics of Fibonacci anyons as quantum reservoirs. Our comprehensive analysis reveals a fundamental tension: the very properties that make topological systems attractive for quantum computation (unitary evolution and information preservation) fundamentally oppose the Echo State Property (ESP) required for reservoir computing. We demonstrate rigorously that pure unitary TQRC violates the ESP: unitary evolution preserves distances in Hilbert space, preventing the fading memory necessary for reservoir computing. On Mackey-Glass time series benchmarks, pure unitary TQRC achieves NRMSE ≈ 1.0 (equivalent to random guessing). Introducing controlled dissipation recovers functional reservoir dynamics (best NRMSE = 0.44), but at the cost of sacrificing topological protection. Critically, we show that classical Echo State Networks outperform dissipative TQRC by 20× at equivalent state-space dimension (ESN NRMSE = 0.02 vs. TQRC NRMSE = 0.44 for d = 13). We identify four root causes: (1) probability readout constrains states to the simplex, (2) measurement destroys phase information, (3) | • | 2 provides weaker nonlinearity than tanh, and (4) structured braid matrices limit state-space utilization. These results constitute a no-go theorem for topological quantum reservoir computing: topological protection and reservoir computing functionality represent fundamentally competing requirements. This finding provides essential guidance for the quantum machine learning community, establishing that topological protection should not be pursued as a route to quantum reservoir computing advantage.