We study the performance of an Ising spin network for quantum reservoir computing in linear and nonlinear memory tasks. We investigate the extent to which quantumness enhances performance by monitoring the behavior of quantum entanglement, which we quantify by the partial transpose of the density matrix. In the most general case where the effects of dissipation are incorporated, our results indicate that the strength of the entanglement advantage depends on the frequency of the input signal; the benefit of entanglement is greater with more rapidly fluctuating signals, whereas a low-frequency input is better suited to a nonentangled reservoir. This may be understood as a condition for an entanglement advantage to manifest itself: the system's quantum memory must survive long enough for the temporal structure of the input signal to reveal itself. We also find that quantum entanglement empowers a spin-network quantum reservoir to remember a greater number of temporal features.
We study the performance of an Ising spin network for quantum reservoir computing in linear and nonlinear memory tasks. We investigate the extent to which quantumness enhances performance by monitoring the behavior of quantum entanglement, which we quantify by the partial transpose of the density matrix. In the most general case where the effects of dissipation are incorporated, our results indicate that the strength of the entanglement advantage depends on the frequency of the input signal; the benefit of entanglement is greater with more rapidly fluctuating signals, whereas a low-frequency input is better suited to a nonentangled reservoir. This may be understood as a condition for an entanglement advantage to manifest itself: the system's quantum memory must survive long enough for the temporal structure of the input signal to reveal itself. We also find that quantum entanglement empowers a spin-network quantum reservoir to remember a greater number of temporal features.
Quantum reservoir computing offers a promising approach to the utilization of complex quantum dynamics in machine learning. Statistical noise inevitably arises in real settings of quantum reservoir computing (QRC) due to the practical necessity of taking a small to moderate number of measurements. We investigate the effect of statistical noise in spin-network QRC on the possible performance benefits conferred by quantumness. As our measures of quantumness, we employ both quantum entanglement, which we quantify by the partial transpose of the density matrix, and coherence, which we quantify as the sum of the absolute values of the off-diagonal elements of the density matrix. We find that reservoirs which enjoy a finite degree of quantum entanglement and coherence are more stable against the adverse effects of statistical noise on performance compared to their unentangled, incoherent counterparts. Our results thus indicate that the potential benefit reservoir computers may derive from quantumness depends on the number of measurements used for training and testing, and that statistical noise, albeit detrimental on the whole, may leave quantum reservoirs in a stronger position relative to less quantum ones. These findings not only emphasize the importance of incorporating realistic noise models, but also suggest that the search for computational regimes that benefit from quantumness may be aided rather than impeded by the practical constraints of implementation within existing machines.
Reservoir computing is a promising neuromorphic paradigm, and its quantum implementation using spin networks has shown some advantage when entanglement is present. Here, we consider a distributed scenario in which two distinct input time series are injected into separate qubits of a spin-network reservoir. We investigate how the overall entanglement, as well as its localization in the system, influence the performance of the reservoir. Focusing on bilinear memory tasks that require computing the product of the two inputs, we evaluate the short-term memory capacity and correlate it with logarithmic negativity as a measure of bipartite entanglement. We find that short-term memory capacity reaches its maximum at relatively small coupling strengths. In contrast, average entanglement peaks at larger couplings. Analyzing entanglement across all bipartitions, we find that the entanglement between the two input qubits is consistently the strongest and most relevant for task performance. In the small coupling strength regime where the short-term memory capacity is maximized, the reservoir exhibits an extended memory tail: performance remains high for a long time. Finally, a pronounced dip in performance at zero time delay, observed across frequencies, indicates that information requires a finite propagation time through the reservoir before it can be effectively recalled. In summary, our results show that moderate entanglement, particularly between the two input qubits, plays a key role in enhancing short-term memory performance.
The intersection of quantum information processing and machine learning has recently at-tracted considerable interest within the physics and artificial intelligence communities. From a physical perspective, quantum computing offers fundamentally new modes of information processing, enabled by superposition, interference, and entanglement, which can lead to ad-vantages in computational speed and resource efficiency over classical approaches. These developments have motivated the exploration of machine learning paradigms that lever-age quantum dynamics as a computational resource. In parallel, reservoir computing—a non–von Neumann and neuromorphic computing framework—has gained attention due to its reliance on high-dimensional dynamical systems, in-memory computation, and low en-ergy consumption. Quantum reservoir computing extends this paradigm by exploiting the intrinsic dynamics of quantum many-body systems, such as spin networks, to process tem-poral information. Despite growing interest in quantum reservoir architectures, the role of genuinely quantum resources, in particular entanglement, in determining their information-processing capabilities remains incompletely understood. In this thesis, we study a distributed spin-network reservoir in which two independent time series are injected into separate qubits. Using short-term memory capacity as an opera-tional measure, we analyze how information introduced at distinct sites propagates through the network and how different entanglement structures contribute to storing and combining past inputs. Focusing on bilinear memory tasks, which require reconstructing the product of the two inputs at various delays, we probe temporal memory. Due to the computational cost associated with simulating open quantum many-body dynamics, the present study focuses on a minimal spin-network architecture consisting of four qubits, with two qubits serving as input nodes that receive independent time series. Even for such moderate system sizes, the numerical integration of the open-system dynamics are computationally demanding. Nevertheless, this minimal setting already captures the essential mechanisms of distributed information processing in quantum reservoirs. By computing the logarithmic negativity across different bipartitions of the reservoir, we investigate how memory performance relates to the underlying entanglement structure. We find that the short-term memory capacity is maximized at relatively weak coupling strengths, where entanglement is present but remains moderate. Among the various bipar-titions, the entanglement between the two input qubits consistently plays the most promi-nent role in learning performance. In this optimal regime, the reservoir exhibits long-lived memory, while a characteristic reduction in performance at zero delay, observed across all frequencies, reflects the finite time required for information to propagate through the sys-tem. Taken together, these results indicate that effective learning in distributed quantum reservoir computing is enabled by moderate, well-structured entanglement, rather than by maximal correlations.
Numerical studies suggest that quantum reservoir computing performs optimally near the edge of chaos, a behavior commonly attributed to a balance between memory retention and nonlinear information processing. Here we develop an explicit quantum reservoir model and rigorously analyze its chaotic regime and integrable point. In the chaotic regime, we show that Gaussian-unitary-ensemble statistics lead to rapid memory loss: learning performance decays exponentially with the storage time required by a temporal task. This decay limits the ability of chaotic reservoirs to learn long-range temporal dependencies. At the integrable point, described by a free-fermion model, we prove that amplitude encoding and a linear readout of fermionic two-point correlations cannot learn a representative class of nonlinear tasks coupling present and past inputs. Introducing interactions alleviates this obstruction. By identifying distinct limitations on memory retention in the chaotic regime and nonlinear processing at the integrable point, our analysis provides a theoretical basis for the observed edge-of-chaos advantage and guides the design of quantum reservoirs for temporal learning.
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.
The growing demand for efficient machine learning has motivated the exploration of neuro-morphic and reservoir computing, which are rooted in brain-inspired approaches that mimic the recurrent dynamics and adaptive information processing of biological neural circuits. These methods leverage the intrinsic dynamics of physical systems to process temporal in-formation with minimal training. Extending these ideas, Quantum Reservoir Computing (QRC) seeks to exploit uniquely quantum features—such as coherence, entanglement, and nonlinearity—for enhanced performance. Yet, the precise role of quantum resources in QRC remains unclear. This thesis investigates entanglement as a computational resource in QRC, focusing on a model of two coupled Kerr nonlinear oscillators. The Kerr platform is well suited for time-series prediction tasks due to its nonlinear interactions and access to a large Hilbert space. Using logarithmic negativity to quantify entanglement and normalized root mean square error (NRMSE) to measure predictive accuracy, we evaluate the effect of input drive strength, Kerr nonlinearity, and oscillator coupling on reservoir performance. Our results show that entanglement is related to improved computational accuracy on average and in worst-case scenarios, though it does not reduce the best-case error. The advantage persists under realistic imperfections: dissipation can enhance performance in certain regimes, while moderate dephasing does not completely remove the benefit. This thesis situates QRC within the context of neuromorphic and reservoir computing. It demonstrates the computational role of entanglement in a physically motivated QRC model and evaluates how key physical parameters affect performance under realistic conditions. This work advances understanding of whether and how quantum phenomena can be har-nessed for efficient learning, paving the way for high-performance quantum machine learning and time-series forecasting.