Papers › Adapting reservoir computing to solve the Schrödinger equation
Adapting reservoir computing to solve the Schrödinger equation
L. Domingo, J. Borondo, F. Borondo
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Reservoir computing is a machine learning algorithm that excels at predicting the evolution of time series, in particular, dynamical systems. Moreover, it has also shown superb performance at solving partial differential equations. In this work, we adapt this methodology to integrate the time-dependent Schr\"odinger equation, propagating an initial wavefunction in time. Since such wavefunctions are complex-valued high-dimensional arrays the reservoir computing formalism needs to be extended to cope with complex-valued data. Furthermore, we propose a multi-step learning strategy that avoids overfitting the training data. We illustrate the performance of our adapted reservoir computing method by application to four standard problems in molecular vibrational dynamics.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections