Programming Spintronic Reservoir Computing
arXiv:2609.13169
Abstract
We present a programming framework for a spintronic reservoir computer (RC) that maps prescribed input-output relationships directly onto the readout layer, bypassing conventional data-driven black-box approaches. Our spintronic RC is based on magnetoresistive random-access memory and exploits magnetization dynamics for computation. We introduce a general metric that quantifies the system's programmability and reveals how the governing equations and system parameters constrain the class of realizable functions. We then construct externally controllable readout layers by exploiting the explicit parameter dependence of the prescribed equations. This metric and construction enable programming explicit functions on the spintronic RC, indicating a potential route to in-memory computing. Our demonstrations include neural-network emulation, bifurcation embedding, and a Newton solver for fifth-order algebraic equations. In addition, we prove the universal approximation property of the spintronic RC in the limit of infinite system size and input duration, and show its consistency with programmability.
5 pages, 4 figures