Title: Krylov Complexity in Calabi-Yau Quantum Mechanics

Speaker: Prof. Minxin Huang

Coordinates: PCFT C1124, 16:00, Thursday, June 1

Abstract: Recently, a novel measure for the complexity of operator growth is proposed based on Lanczos algorithm and Krylov recursion method. We study this Krylov complexity in quantum mechanical systems derived from some well-known local toric Calabi-Yau geometries, as well as some non-relativistic models. We find that for the Calabi-Yau models, the Lanczos coefficients grow slower than linearly for small n's, consistent with the behavior of integrable models. On the other hand, for the non-relativistic models, the Lanczos coefficients initially grow linearly for small n's, then reach a plateau. Although this looks like the behavior of a chaotic system, it is mostly likely due to saddle-dominated scrambling effects instead, as argued in the literature. In our cases, the slopes of linearly growing Lanczos coefficients almost saturate a bound by the temperature. During our study, we also provide an alternative general derivation of the bound for the slope.