Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum reservoir complexity by Krylov evolution approach

Published 1 Oct 2023 in quant-ph | (2310.00790v1)

Abstract: 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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.