Towards verifications of Krylov complexity
Abstract
Krylov complexity is considered to provide a measure of the growth of operators evolving under Hamiltonian dynamics. The main strategy is the analysis of the structure of Krylov subspace KM(H,η) spanned by the multiple applications of the Liouville operator L defined by the commutator in terms of a Hamiltonian H, L:=[H,·] acting on an operator η, KM(H,η)=span\η,Lη,…,LM-1η\. For a given inner product (·,·) of the operators, the orthonormal basis \On\ is constructed from O0=η/(η,η) by Lanczos algorithm. The moments μm=(O0,LmO0) are closely related to the important data \bn\ called Lanczos coefficients. I present the exact and explicit expressions of the moments \μm\ for 16 quantum mechanical systems which are exactly solvable both in the Schr\"odinger and Heisenberg pictures. The operator η is the variable of the eigenpolynomials. Among them six systems show a clear sign of `non-complexity' as vanishing higher Lanczos coefficients bm=0, m3.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.