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.
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.
Abstract—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. Index Terms—Topological quantum computing, Fibonacci anyons, reservoir computing, echo state property, quantum machine learning, negative results
Quantum Reservoir Computing (QRC) exploits the rich dynamics of quantum many-body systems to process time-dependent information with high-dimensional state spaces. While neutral atom arrays offer a scalable platform for this paradigm, realizing intrinsic temporal memory without relying on external classical buffering requires precise control over the relaxation dynamics of the system. We address the necessity of specific non-unitary dynamics for enforcing fading memory while overcoming the lack of separability. This study simulates and empirically identifies the specific dynamical regimes required to maximize the computational capacity of the reservoir, addressing the amount of dissipation, the effectiveness of lying at the edge of quantum chaos, and that of time-multiplexing compared to the scaling of the physical size of the system. Here we show that controlled dissipation is strictly necessary to induce echo state property, fading memory, and separability, in neutral atom arrays. Computational performance increases at the edge of quantum chaos. The counter-intuitive residual memory provided by the unital phase damping channel is justified by introducing a model based on pure outputs. The consequent implementation enables the solution of complex non-linear tasks, such as the Mackey-Glass time series, with as few as N=5 atoms. We establish a rigorous framework for engineering dissipative quantum reservoirs required for intrinsic temporal processing on near-term quantum devices.
Quantum reservoir computing (QRC) provides a hardware-efficient paradigm for temporal information processing on near-term quantum devices. Despite rapid experimental progress, a rigorous understanding of the structural conditions required for its scalable quantum-enhanced performance remains lacking. Here, we develop a theoretical framework in Pauli-Liouville space that provides a unified analytical treatment of the echo state property (ESP), nonlinear expressive power, and quantum resources. We first analyze the widely used qubit-resetting scheme and establish that quantum magic generated by reservoir dynamics is a necessary condition for effective computation, a requirement more fundamental than ESP. However, we prove that this architecture faces inherent expressivity limitations: all nonlinear processing originates exclusively from the classical encoding map, imposing an unavoidable trade-off between nonlinearity and memory capacity. To circumvent this structural bottleneck, we rigorously analyze Hamiltonian encoding, in which temporal inputs are embedded directly into the continuous dynamics generator. We show that the ESP is natively guaranteed by the Liouvillian spectral gap, decoupling it from quantum magic. Crucially, for any non-trivial drive Hamiltonian, the discrete-time update map exhibits a transcendental, infinite-order nonlinear dependence on the instantaneous input. Moreover, the intrinsic non-commutativity of the open-system generators governs the temporal coupling of these nonlinearities, producing highly non-separable processing of the input history. Our results establish a rigorous theoretical hierarchy of QRC architectures and provide prescriptive design principles for experiments targeting genuine quantum advantages in temporal processing.
Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout. This separation reduces reliance on repeated quantum parameter updates and avoids the barren plateaus associated with variational circuit training. Its computational power is often attributed to the exponentially large Hilbert space of the quantum system. However, the memory, nonlinearity, and expressivity that determine what a reservoir can actually compute depend jointly on the input encoding, quantum evolution, observables, measurement, and readout, not on Hilbert space dimension alone. On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables, so a large state space alone does not guarantee useful computation. In this survey, we develop a common system model that connects these components and use it to organize QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations. We examine spin, photonic, superconducting, bosonic, neutral atom, and other analog platforms, together with applications, software and high performance computing support, benchmarking, and reproducibility. The analysis distinguishes hardware demonstrations from simulations and identifies the assumptions and resources that govern comparisons across implementations. Current results do not establish a broad quantum advantage over well matched classical reservoirs. We therefore specify the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.
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.
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.