Papers › Quantum reservoir complexity by Krylov evolution approach
Quantum reservoir complexity by Krylov evolution approach
Laia Domingo, F. Borondo, Gastón Scialchi, Augusto J. Roncaglia, Gabriel G. Carlo, Diego A. Wisniacki
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.
Quantum reservoir computing algorithms recently emerged as a standout approach in the development of successful methods for the NISQ era, because of its superb performance and compatibility with current quantum devices. By harnessing the properties and dynamics of a quantum system, quantum reservoir computing effectively uncovers hidden patterns in data. However, the design of the quantum reservoir is crucial to this end, in order to ensure an optimal performance of the algorithm. In this work, we introduce a precise quantitative method, with strong physical foundations based on the Krylov evolution, to assess the wanted good performance in machine learning tasks. Our results show that the Krylov approach to complexity strongly correlates with quantum reservoir performance, making it a powerful tool in the quest for optimally designed quantum reservoirs, which will pave the road to the implementation of successful quantum machine learning methods.
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