Related papers: Krylov complexity and orthogonal polynomials
The Lanczos algorithm, introduced by Cornelius Lanczos, has been known for a long time and is widely used in computational physics. While often employed to approximate extreme eigenvalues and eigenvectores of an operator, recently interest…
In this work we develop a real-time Schwinger-Keldysh formulation of Krylov dynamics that treats Krylov complexity as an in-in observable generated by a closed time contour path integral. The resulting generating functional exposes an…
In an isolated system, the time evolution of a given observable in the Heisenberg picture can be efficiently represented in Krylov space. In this representation, an initial operator becomes increasingly complex as time goes by, a feature…
We study the recurrence coefficients of the orthogonal polynomials with respect to a semi-classical extension of the Krawtchouk weight. We derive a coupled discrete system for these coefficients and show that they satisfy the fifth…
We present an overview of randomized orthogonalization techniques that construct a well-conditioned basis whose sketch is orthonormal. Randomized orthogonalization has recently emerged as a powerful paradigm for reducing the computational…
Krylov complexity has recently been proposed as a quantum probe of chaos. The Krylov exponent characterising the exponential growth of Krylov complexity is conjectured to upper-bound the Lyapunov exponent. We compute the Krylov and the…
Notions of the orthogonality and convolution orthogonality are explored with the use of the Kontorovich-Lebedev transform and its convolution. New classes of the corresponding orthogonal polynomials and functions are investigated. Integral…
Several Krylov-type procedures are introduced that generalize matrix Krylov methods for tensor computations. They are denoted minimal Krylov recursion, maximal Krylov recursion, contracted tensor product Krylov recursion. It is proved that…
The Rosenbrock-Krylov family of time integration schemes is an extension of Rosenbrock-W methods that employs a specific Krylov based approximation of the linear system solutions arising within each stage of the integrator. This work…
Krylov space methods provide an efficient framework for analyzing the dynamical aspects of quantum systems, with tridiagonal matrices playing a key role. Despite their importance, the behavior of such matrices from chaotic to integrable…
We study quantum-to-classical correspondence of the Krylov space for evolutions driven by unitary maps with a classical limit. This entails a proper definition of corresponding quantum and classical operators, inner products and initial…
Krylov complexity provides a powerful framework for characterizing the dynamical evolution of quantum systems through the spreading of states in Krylov space. The motivation for this is rooted in the optimality of the Krylov basis for the…
Spread complexity uses the distribution of support of a time-evolving state in the Krylov basis to quantify dispersal across accessible dimensions of a Hilbert space. Here, we describe how variations in initial conditions, the Hamiltonian,…
This work is on a user-friendly reduced basis method for solving a family of parametric PDEs by preconditioned Krylov subspace methods including the conjugate gradient method, generalized minimum residual method, and bi-conjugate gradient…
We study Krylov complexity for quantum systems whose Hamiltonians factorise as tensor products. We prove that complexity is superadditive under tensor products, $C_{12}\ge C_1+C_2$, and identify a positive operator that quantifies the…
This work explores classical discrete multiple orthogonal polynomials, including Hahn, Meixner of the first and second kinds, Kravchuk, and Charlier polynomials, with an arbitrary number of weights. Explicit expressions for the recursion…
For a bilinear form obtained by adding a Dirac mass to a positive definite moment functional in several variables, explicit formulas of orthogonal polynomials are derived from the orthogonal polynomials associated with the moment…
We point out an interesting connection between the mathematical framework of the Krylov basis, which is used to quantify quantum complexity, and the entanglement entropy in high-energy QCD. In particular, we observe that the cascade…
In recent years, there has been growing interest in characterizing the complexity of quantum evolutions of interacting many-body systems. When a time-independent Hamiltonian governs the dynamics, Krylov complexity has emerged as a powerful…
We propose a tridiagonalization approach for non-Hermitian random matrices and Hamiltonians using singular value decomposition (SVD). This technique leverages the real and non-negative nature of singular values, bypassing the complex…