arXiv · 2205.12815
Krylov complexity and orthogonal polynomials
Abstract
Krylov complexity measures operator growth with respect to a basis, which is adapted to the Heisenberg time evolution. The construction of that basis relies on the Lanczos algorithm, also known as the recursion method. The mathematics of Krylov complexity can be described in terms of orthogonal polynomials. We provide a pedagogical introduction to the subject and work out analytically a number of examples involving the classical orthogonal polynomials, polynomials of the Hahn class, and the Tricomi-Carlitz polynomials.
Explore related subjects
Keep this discovery
Wolfgang Mück, Yi Yang. 2022-05-25. Krylov complexity and orthogonal polynomials. https://doi.org/10.1016/j.nuclphysb.2022.115948
Cite the original work for its findings. Save a collection to share your selection of sources.