Krylov complexity and orthogonal polynomials

Wolfgang Mück*, Yi Yang

*此作品的通信作者

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

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.

原文English
文章編號115948
期刊Nuclear Physics B
984
DOIs
出版狀態Published - 11月 2022

指紋

深入研究「Krylov complexity and orthogonal polynomials」主題。共同形成了獨特的指紋。

引用此