Spin-Network Quantum Reservoir Computing with Distributed Inputs: The Role of Entanglement
Sareh Askari
Abstract
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.