Krylov Complexity as a Probe for Chaos
Krylov Complexity as a Probe for Chaos
In this work, we explore in detail, the time evolution of Krylov complexity. We demonstrate, through analytical computations, that in finite many-body systems, while ramp and plateau are two generic features of Krylov complexity, the manner in which complexity saturates reveals the chaotic nature of the system. In particular, we show that the dynamics towards saturation precisely distinguish between chaotic and integrable systems. For chaotic models, the saturation value of complexity reaches its infinite time average at a finite saturation time. In this case, depending on the initial state, it may also exhibit a peak before saturation. In contrast, in integrable models, complexity approaches the infinite time average value from below at a much longer timescale. We confirm this distinction using numerical results for specific spin models.
Mohsen Alishahiha、Souvik Banerjee、Mohammad Javad Vasli
10.1140/epjc/s10052-025-14451-z
物理学非线性科学
Mohsen Alishahiha,Souvik Banerjee,Mohammad Javad Vasli.Krylov Complexity as a Probe for Chaos[EB/OL].(2025-08-05)[2025-08-16].https://arxiv.org/abs/2408.10194.点此复制
评论