20 May 2024 in Physical Review E
The complexity of quantum evolutions can be understood by examining their spread in a chosen basis. Recent research has stressed the fact that the Krylov basis is particularly adept at minimizing this spread [Balasubramanian et al., Phys. Rev. D 106, 046007 (2022)]. This property assigns a central role to the Krylov basis in the investigation of quantum chaos. Here, we delve into the transition from integrability to chaos using the Krylov approach, employing an Ising spin chain and a banded random matrix model as our testing models. Our findings indicate that both the saturation of Krylov complexity and the spread of the Lanczos coefficients can exhibit a significant dependence on the initial condition. However, both quantities can gauge dynamical quantum chaos with a proper choice of the initial state.
30 August 2024 in Physical Review A
Quantum reservoir computing algorithms recently emerged as a standout approach in the development of successful methods for the noisy intermediate-scale quantum (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.
17 January 2025 in Physical Review E
In recent years, there has been growing interest in characterizing the complexity of quantum evolutions of interacting many-body systems. When a time-independent Hamiltonian governs the dynamics, Krylov complexity has emerged as a powerful tool. For unitary evolutions like kicked systems or Trotterized dynamics, a similar formulation based on the Arnoldi approach has been proposed yielding a new notion of quantum ergodicity [P. Suchsland, R. Moessner, and P. W. Claeys, Phys. Rev. B 111, 014309 (2025)]. In this work, we show that this formulation is robust for observing the transition from integrability to chaos in both autonomous and kicked systems. Examples from random matrix theory and spin chains are shown in this paper.
31 July 2026 in Journal of Physics A: Mathematical and Theoretical
We study quantum-to-classical correspondence of the Krylov space for evolutions driven by unitary maps with a classical limit. This entails a proper definition of corresponding quantum and classical operators, inner products and initial states. We prove that with these definitions the purely classical Krylov space is indeed obtained as the asymptotic expansion of the quantum Krylov space, and provide several examples of such correspondence. We use these examples to analyze some general aspects about the evolution of the Krylov complexity as they relate to the phase-space representation for the Krylov states. Additionally, we discuss alternative definitions to obtain the correspondence and why they fail. This paper constitutes a first step in understanding complexity and ergodicity of unitary evolution through the Krylov perspective as they relate to classical dynamical notions.
23 September 2023 in arXiv
The complexity of quantum evolutions can be understood by examining their dispersion in a chosen basis. Recent research has stressed the fact that the Krylov basis is particularly adept at minimizing this dispersion [V. Balasubramanian et al, Physical Review D 106, 046007 (2022)]. This property assigns a central role to the Krylov basis in the investigation of quantum chaos. Here, we delve into the transition from integrability to chaos using the Krylov approach, employing an Ising spin chain and a banded random matrix model as our testing models. Our findings indicate that both the saturation of Krylov complexity and the dispersion of the Lanczos coefficients can exhibit a significant dependence on the initial condition. However, both quantities can gauge dynamical quantum chaos with a proper choice of the initial state.