---
title: Krylov Basis in Numerical & Quantum Dynamics
url: https://www.emergentmind.com/topics/krylov-basis
type: topic
---

# Krylov Basis in Numerical & Quantum Dynamics

Searching arXiv for recent papers on “Krylov basis” and related uses, to support a comprehensive article.
A Krylov basis is a basis of a Krylov subspace, namely the span generated by repeated action of a linear operator on a seed vector. In numerical linear algebra, for \(A\in\mathbb{R}^{n\times n}\) and \(r_0\in\mathbb{R}^n\), the canonical construction is \(\mathcal{K}_m(A,r_0)=\mathrm{span}\{r_0,Ar_0,A^2r_0,\dots,A^{m-1}r_0\}\), and a Krylov basis is any linearly independent set spanning this space; in practice one often uses orthonormal vectors or \(A\)-conjugate directions [2405.07139]. In quantum theory, the same idea appears in state space and operator space: one starts from a state \(|\psi_0\rangle\) or an operator \(\mathcal{O}\), acts repeatedly with the Hamiltonian \(H\) or Liouvillian \(\mathcal{L}=[H,\cdot]\), and orthonormalizes the resulting sequence by Lanczos or Arnoldi to obtain a dynamically adapted basis [2205.12815]. Across these settings, the Krylov basis converts a high-dimensional evolution problem into a structured banded recurrence, typically tridiagonal, and thereby underlies iterative solvers, reduced models, complexity diagnostics, and several recent constructions in quantum dynamics [2603.26619].

## 1. Algebraic definition and basic variants

The basic Krylov subspace for a matrix \(A\) and starting vector \(r_0\) is
\[
\mathcal{K}_m(A,r_0)=\mathrm{span}\{r_0,Ar_0,A^2r_0,\dots,A^{m-1}r_0\}.
\]
A Krylov basis of \(\mathcal{K}_m(A,r_0)\) is any set of \(m\) linearly independent vectors whose span is exactly \(\mathcal{K}_m(A,r_0)\). In preconditioned iterative methods one instead works with \(\mathcal{K}_m(M^{-1}A,M^{-1}r_0)\), and the basis may be chosen as orthonormal Arnoldi or Lanczos vectors, or as \(A\)-conjugate directions in conjugate gradients [2405.07139].

For quantum states, the analogous construction begins from a Hamiltonian \(H\) and an initial normalized state \(|\psi_0\rangle\). The Krylov space of order \(d_K\) is
\[
\mathcal K_{d_K}(H,|\psi_0\rangle)=\mathrm{span}\{|\psi_0\rangle,H|\psi_0\rangle,H^2|\psi_0\rangle,\dots,H^{d_K-1}|\psi_0\rangle\},
\]
where \(d_K\) is the number of linearly independent vectors obtained before the sequence closes [2603.26619]. For operators in the Heisenberg picture, the relevant generator is the Liouvillian \(L=[H,\cdot]\), and one starts from the orbit \(\{|L^nO)\}_{n\ge 0}\) in operator Hilbert space [2205.12815].

The operator-space formulation requires an inner product. In the operator-growth literature reviewed in the supplied works, examples include the Hilbert–Schmidt inner product
\[
(A|B)=\frac{1}{D}\operatorname{Tr}[A^\dagger B]
\]
at infinite temperature, abstract inner products for which the Liouvillian is Hermitian, and Wightman-type norms in quantum field theory [2205.12815]. Once the inner product is fixed, the Krylov basis is determined by the pair consisting of the generator and the seed state or seed operator.

## 2. Lanczos, Arnoldi, and banded representations

For Hermitian generators, the standard construction is the Lanczos algorithm. In the state formulation one sets
\[
|k_0\rangle=|\psi_0\rangle,\qquad b_0=0,\qquad |k_{-1}\rangle=0,
\]
and then iterates
\[
a_n=\langle k_n|H|k_n\rangle,\qquad
|v_{n+1}\rangle=H|k_n\rangle-a_n|k_n\rangle-b_n|k_{n-1}\rangle,
\]
\[
b_{n+1}=\sqrt{\langle v_{n+1}|v_{n+1}\rangle},\qquad
|k_{n+1}\rangle=\frac{|v_{n+1}\rangle}{b_{n+1}}.
\]
The process stops when \(b_{n+1}=0\), and in the basis \(\{|k_n\rangle\}\) the Hamiltonian is tridiagonal:
\[
H|k_n\rangle=b_{n+1}|k_{n+1}\rangle+a_n|k_n\rangle+b_n|k_{n-1}\rangle
\]
[2603.26619]. The operator-space recursion has the same structure, with \(H\) replaced by \(L\), and in symmetry-restricted cases the diagonal term may vanish so that only the off-diagonal Lanczos coefficients remain [2205.12815].

For Floquet systems, the generator is the one-period unitary \(U_F\), and the natural orthogonalization is Arnoldi rather than Lanczos. Starting from \(|\psi_0\rangle\), one orthonormalizes \(\{|\psi_0\rangle,U_F|\psi_0\rangle,U_F^2|\psi_0\rangle,\dots\}\) using
\[
|v_n\rangle=U_F|K_{n-1}\rangle-\sum_{i=0}^{n-1}h_{i,n-1}|K_i\rangle,\qquad
h_{i,n-1}=\langle K_i|U_F|K_{n-1}\rangle,
\]
\[
|K_n\rangle=\frac{1}{h_{n,n-1}}|v_n\rangle,
\]
where \(h_{n,n-1}=\|v_n\|\) are Arnoldi coefficients [2503.23334]. In this setting the Krylov basis again defines a one-dimensional chain picture, although the effective matrix structure is no longer restricted to the Hermitian tridiagonal Jacobi form.

The tridiagonal form is not universal if one insists on an algebraically natural basis rather than the strict Lanczos basis. For systems with two-dimensional Schrödinger symmetry, a natural orthonormal basis is the oscillator Fock basis \(|n\rangle\), because the relevant generators are polynomials of degree one and two in \(a\) and \(a^\dagger\). In that basis the Liouvillian connects \(|n\rangle\) to \(|n\pm1\rangle\) and \(|n\pm2\rangle\), producing a pentadiagonal rather than tridiagonal structure [2306.03133]. This suggests that the notion of a Krylov basis can be broadened from strict tridiagonalization to symmetry-adapted banded representations when the latter are analytically more transparent.

## 3. Dynamics in Krylov space and complexity measures

Once the basis is constructed, time evolution becomes a chain problem. For states,
\[
|\psi(t)\rangle=e^{-iHt}|\psi_0\rangle=\sum_{n=0}^{d_K-1}\phi_n(t)|k_n\rangle,
\qquad \phi_n(t)=\langle k_n|\psi(t)\rangle,
\]
and the amplitudes obey
\[
i\,\dot\phi_n(t)=a_n\phi_n(t)+b_{n+1}\phi_{n+1}(t)+b_n\phi_{n-1}(t)
\]
[2603.26619]. For operators,
\[
|O(t))=e^{-itL}|O)=\sum_n \phi_n(t)|O_n),
\]
with a discrete Schrödinger-type equation determined by the Lanczos coefficients of \(L\) [2205.12815]. In both cases, the basis index is interpreted as a site on a semi-infinite or finite Krylov chain.

The most common derived observable is Krylov complexity, or spread complexity,
\[
K(t)=\sum_n n\,|\phi_n(t)|^2.
\]
It is the average position of the wavepacket on the Krylov chain [2603.26619]. Closely related quantities include the inverse participation ratio
\[
\mathrm{IPR}(t)=\sum_n |\phi_n(t)|^4
\]
and the Shannon entropy of the Krylov distribution [2603.26619]. For probability distributions with fixed mean \(K\), the Shannon entropy is bounded by
\[
H(\{|c_n|^2\})\le (1+K)\log(1+K)-K\log K,
\]
a relation used to connect Krylov spreading to entropic quantities [2603.26619].

In several physically important settings, the Krylov basis coincides with a Fock basis. For generalized coherent states, squeezed states, and related constructions, the Fock states are “basically the Krylov basis,” so the occupation-number probabilities \(P(n)\) coincide with \(|\phi_n(t)|^2\), and the mean occupation number equals Krylov complexity:
\[
\bar n=\sum_n nP(n)=\sum_n n|\phi_n(t)|^2=K(t)
\]
[2204.02250]. In the two-mode squeezed vacuum, for example,
\[
P(n)=\frac{\tanh^{2n}r_k}{\cosh^2 r_k},
\qquad
K=\sinh^2 r_k=\bar n,
\]
while for canonical coherent states,
\[
P(n)=e^{-|z|^2}\frac{|z|^{2n}}{n!},
\qquad
K(t)=|z|^2=\langle N\rangle
\]
[2204.02250]. This identification is especially useful in free-field and holographic contexts, where particle number has an immediate extensive interpretation.

## 4. Spectral, polynomial, and phase-space structure

The Krylov basis is closely tied to orthogonal polynomial theory. In operator dynamics one may write
\[
|O_n)=|P_n(L)O),
\]
where \(P_n\) is a degree-\(n\) polynomial in the Liouvillian. If \(d\mu(L)\) is the spectral measure induced by the seed operator, then the polynomials satisfy
\[
\int d\mu(L)\,P_m(L)P_n(L)=h_n\delta_{mn},
\]
and the three-term recurrence
\[
L P_n(L)=b_{n+1}P_{n+1}(L)+b_n P_{n-1}(L)
\]
in the orthonormal case [2205.12815]. This is the operator-theoretic realization of Favard-type structure for orthogonal polynomials, and it makes the Lanczos coefficients identical to Jacobi parameters. Explicit solvable examples worked out in the supplied literature include classical orthogonal polynomials, polynomials of the Hahn class, and Tricomi–Carlitz polynomials [2205.12815].

The same basis supports static resolvent diagnostics. For the resolvent-dressed state
\[
|\psi(\xi)\rangle=(H-\xi)^{-1}|\psi_0\rangle=\sum_n \psi_n(\xi)|n\rangle,
\]
one defines the normalized distribution
\[
P_n(\xi)=\frac{|\psi_n(\xi)|^2}{\sum_m |\psi_m(\xi)|^2},
\qquad
\mathcal D(\xi)=\sum_n n\,P_n(\xi),
\]
called the Krylov distribution [2602.06150]. In the asymptotic analysis summarized in that work, three universal regimes appear: saturation outside spectral support, extensive growth within continuous spectra, and sublinear or logarithmic scaling near spectral edges and quantum critical points [2602.06150]. This extends the chain picture from unitary evolution to inverse-energy response.

A further development is the Krylov–Wigner function, namely the discrete Wigner function defined with respect to the Krylov basis with appropriate phases. In the large-\(D\) limit, the Krylov basis with suitable phase choices minimizes the early-time growth of Wigner negativity, and numerical studies in random matrix theory show three broad regimes for the negativity: a gradual rise for a time of \(O(\sqrt{D})\), a sharp ramp, and saturation close to the upper bound \(\sqrt{D}\) [2402.13694]. This suggests that the Krylov basis can serve as a semi-classical phase-space frame for chaotic dynamics.

## 5. Many-body physics, field theory, and dynamical diagnostics

In free scalar quantum field theory, lattice regularization maps the theory to coupled harmonic oscillators whose normal modes furnish a tensor-product Fock basis. In the cases analyzed in the supplied QFT study, this Fock basis is effectively the Krylov basis, and the total Krylov complexity becomes a sum over momentum modes,
\[
K(t)=\sum_{\vec k}\frac{\sin^2(\tilde\omega_{\vec k} t/2)}{\sinh^2(\beta \tilde\omega_{\vec k}/2)},
\]
with \(\tilde\omega_{\vec k}^2=m^2+\frac{4}{\delta^2}\sum_{i=1}^{d-1}\sin^2\frac{\pi k_i}{N}\) [2204.02250]. Because the number of oscillators scales as \(V/\delta^{d-1}\), the resulting complexity scales linearly with volume, paralleling the factor that appears in the holographic “complexity = volume” conjecture [2204.02250]. In inverted-oscillator sectors one instead finds \(\sinh^2\)-type growth, and the same framework is used there as a diagnostic of chaotic behavior [2204.02250].

Krylov-space diagnostics also resolve localization and thermalization phenomena. In the quantum kicked rotor, the Arnoldi basis built from the Floquet operator distinguishes four localization scenarios: quantum anti-resonance, classical-induced localization, dynamical localization, and power-law localization. These regimes display distinct long-time behaviors of K-complexity and distinct variations of the Arnoldi coefficients, and the time-averaged K-complexity together with the variance of Arnoldi coefficients distinguishes localization caused by classical regular structures from localization caused by quantum interference [2503.23334]. In many-body localization, the operator-growth formulation leads to an emergent single-particle hopping problem whose Lanczos coefficients scale asymptotically as \(n/\ln n\) but exhibit even–odd alternation and effective randomness; the resulting Krylov-chain problem is localized when initialized on the first site, and Krylov complexity saturates accordingly [2112.04722].

A related proposal for closed non-integrable systems is the Krylov Thermalization Hypothesis. In that framework, typical local operators expressed in the Krylov basis should have a specific tridiagonal form, with all other matrix elements exponentially small, in analogy with ETH. Within this basis, the infinite-time average of Krylov complexity is proposed as a probe of whether thermalization is weak or strong, while the variance of Lanczos coefficients is reported to be less effective [2403.06655].

The basis also supports direct connections to quantum-information diagnostics. For bipartite systems, the entanglement entropy of the evolved state can be upper bounded in terms of the entanglement of the Krylov basis vectors and the spread complexity; for multipartite systems, the inverse participation ratio in the Krylov basis is bounded by functions of geometric entanglement measures [2603.26619]. For a qubit with nondegenerate Hamiltonian, the relation is exact:
\[
K(t)=C_{\ell_1}^2 \sin^2\!\left(\frac{\omega t}{2}\right),
\]
where \(C_{\ell_1}=2|c_0||c_1|\) is the initial coherence in the energy basis [2603.26619]. This makes the dependence of Krylov spreading on initial coherence completely explicit in the two-level case.

## 6. Numerical linear algebra, reduced models, and control theory

In numerical linear algebra, Krylov bases are the workhorse of iterative solvers such as conjugate gradients, GMRES, and BiCG. A recent reduced-basis construction for parametric PDEs takes a preconditioned Krylov basis generated for one parameter value and reuses it as a reduced space for the full parameter family [2405.07139]. In the symmetric positive-definite case, the reduced conjugate gradient basis method uses PCG search directions \(\{\mathbf p_k\}\) as the reduced basis; for nonsymmetric or indefinite problems, the corresponding reduced spaces are built from GMRES residual vectors or BiCG primal and dual sequences [2405.07139]. In two-parameter affine families, the key theoretical observation is an invariance of preconditioned Krylov spaces, under which the reduced solution is exactly the \(m\)-step Krylov iterate for every parameter and therefore inherits the classical convergence theory of PCG, GMRES, or BiCG [2405.07139].

The same subspace logic has been imported into shortcuts to adiabaticity. There the relevant generator is not \(H\) itself but the Liouvillian \(\mathcal L_\lambda=[H(\lambda),\cdot]\), and the seed is \(\partial_\lambda H\). The resulting operator Krylov basis spans the minimal operator subspace in which the adiabatic-gauge-potential problem unfolds, and the counterdiabatic term is expanded exactly in that basis [2302.05460]. The Lanczos coefficients obtained during this construction also reveal how higher-body terms enter the counterdiabatic Hamiltonian in many-body models [2302.05460].

For open quantum systems with Lindblad dynamics, the Liouvillian is non-Hermitian, so the appropriate construction is a bi-Lanczos basis with left and right Krylov vectors. After a similarity transformation, the effective tridiagonal representation has symmetric off-diagonal entries \(\sqrt{b_nc_n}\), and Krylov complexity is then computed from the associated chain dynamics [2509.14810]. In the damped harmonic oscillator and Caldeira–Leggett model, this basis captures dissipative saturation of Krylov complexity; at the same time, the study argues that Krylov complexity is comparatively insensitive to the onset of decoherence because the Krylov basis does not coincide with the conventional pointer basis used in decoherence theory [2509.14810].

## 7. Generalizations, natural bases, and the optimality debate

One influential motivation for the Krylov basis in state dynamics is that, for a fixed time interval, the spread and hence K-complexity of the evolving state in the Krylov basis is minimal among all orthonormal bases [2503.23334]. An analogous large-\(D\) statement has been made for Wigner negativity: with appropriate phases, the Krylov basis minimizes the early-time growth of negativity of the discrete Wigner function [2402.13694]. These results underlie the widespread view that the Krylov basis is an optimal dynamical frame.

That view has recently been challenged. A 2026 study reinterprets the conventional Krylov basis as the basis associated with a first-order approximation of the time-evolution operator and then constructs higher-order generators from higher-order truncations of \(e^{-iHt}\). In that framework, an infinite-order generator can be constructed that exhibits smaller spread for arbitrary times, thereby analytically disproving the widely held optimality assumption for conventional Krylov complexity [2603.07183]. This suggests that optimality statements are sensitive to the generator and the cost function being minimized.

A different kind of generalization appears in symmetry-adapted constructions. For the Schrödinger algebra, a natural orthonormal basis given by oscillator Fock states leads to a pentadiagonal Liouvillian, not the usual tridiagonal Lanczos form, because the algebra combines linear and quadratic oscillator terms [2306.03133]. In the Jacobi group \(H_1\rtimes Sp(2,\mathbb R)\simeq H_1\rtimes SU(1,1)\), where coherent states are physically realized as squeezed states, the simple \(SU(1,1)\) and Heisenberg–Weyl Krylov constructions no longer suffice, and the Lanczos algorithm must be augmented by a refined scheme that mixes several ladder sectors [2212.13758]. These extensions suggest that “Krylov basis” can denote either the strict Lanczos basis or, in a broader but still structured sense, a dynamically natural banded basis adapted to a non-semisimple algebraic setting.

Taken together, the recent literature presents the Krylov basis as both a classical object of numerical linear algebra and a modern organizing principle for quantum dynamics. It is a basis generated by repeated action of a linear operator on a seed, but its contemporary significance lies in what that basis reveals: tridiagonal or banded effective dynamics, orthogonal-polynomial structure, reduced-order approximation spaces, and a unified language for operator growth, localization, thermalization, adiabatic control, and inverse-energy response [2205.12815].

Source: https://www.emergentmind.com/topics/krylov-basis