arXiv · 2403.06391
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 $\mathcal{K}_M(\mathcal{H},η)$ spanned by the multiple applications of the Liouville operator $\mathcal{L}$ defined by the commutator in terms of a Hamiltonian $\mathcal{H}$, $\mathcal{L}:=[\mathcal{H},\cdot]$ acting on an operator $η$, $\mathcal{K}_M(\mathcal{H},η)=\text{span}\{η,\mathcal{L}η,\ldots,\mathcal{L}^{M-1}η\}$. For a given inner product $(\cdot,\cdot)$ of the operators, the orthonormal basis $\{\mathcal{O}_n\}$ is constructed from $\mathcal{O}_0=η/\sqrt{(η,η)}$ by Lanczos algorithm. The moments $μ_m=(\mathcal{O}_0,\mathcal{L}^m\mathcal{O}_0)$ are closely related to the important data $\{b_n\}$ called Lanczos coefficients. I present the exact and explicit expressions of the moments $\{μ_m\}$ for 16 quantum mechanical systems which are {\em exactly solvable both in the Schrödinger 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 $b_m=0$, $m\ge3$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ryu Sasaki. 2024-06-19. Towards verifications of Krylov complexity. https://doi.org/10.1093/ptep%2Fptae073
Cite the original work for its findings. Save a collection to share your selection of sources.