In closed quantum systems, Krylov complexity admits a geometric description; operator growth is equivalent to Hamiltonian flow in an emergent phase space whose structure is fixed by the Lanczos coefficients. We show that this picture survives, albeit in a fundamentally altered form, once the system is coupled to an environment.Using a Schwinger-Keldysh formulation of the full counting statistics of the Krylov position, we derive an effective action for operator growth under Lindblad dynamics. Even for the minimal case of dephasing, the phase-space dynamics ceases to be Hamiltonian; environmental coupling generates diffusion in the variable conjugate to Krylov depth, converting deterministic trajectories in to stochastic ones. The hyperbolic mechanism underlying exponential complexity growth is therefore broadened and, beyond a parametrically controlled scale, destroyed.This identifies dissipation as a relevant perturbation of the chaotic Krylov fixed point and reveals operator growth in open systems as a problem of stochastic dynamics in an emergent phase space.
In this work, we develop and study the classical Lanczos algorithm allowing us to define Krylov complexity using the symplectic structure of phase space: Poisson brackets take on the role of the quantum commutators and phase-space integrals furnish the inner product needed to define the Lanczos recursion. We show, using general methods of quantum mechanics in phase space, that the
ℏ→0 limit of the usual quantum mechanical Krylov framework smoothly goes over into the classical one. In theories with well-defined semiclassical limits, we show that classical Krylov complexity accurately approximates quantum complexity at early enough times, and thus is a useful characteristic of early-time chaotic dynamics. We define a Krylov-Ehrenfest time, which quantifies the eventual divergence of classical and quantum complexities, corresponding to a characteristic depth of the Krylov chain,
n∼n∗(ℏ), which in the time domain translates to the well-known scale,
t∗∼λK−1log(1/ℏ), in generic chaotic systems. We additionally define microcanonical Krylov complexities, both in the classical and quantum setting, which allows one a fine-grained study of complexity, energy shell by energy shell. We apply this framework to the Lipkin-Meshkov-Glick (LMG) and Feingold-Peres (FP) models, which are collective spin systems known to classicalize in the thermodynamic limit. In particular, while the FP model features spectral chaos for some range of coupling values, the LMG model is known to exhibit early-time saddle-dominated scrambling. Our analysis shows that the instability in LMG is resolved by the microcanonical Krylov complexity, which is controlled by the integrable structure of the Hamiltonian in spectral windows away from the instability, both at early and late times.
A bstract In semi-classical systems, the exponential growth of the out-of-time-order correlator (OTOC) is believed to be the hallmark of quantum chaos. However, on several occasions, it has been argued that, even in integrable systems, OTOC can grow exponentially due to the presence of unstable saddle points in the phase space. In this work, we probe such an integrable system exhibiting saddle-dominated scrambling through Krylov complexity and the associated Lanczos coefficients. In the realm of the universal operator growth hypothesis, we demonstrate that the Lanczos coefficients follow the linear growth, which ensures the exponential behavior of Krylov complexity at early times. The linear growth arises entirely due to the saddle, which dominates other phase-space points even away from itself. Our results reveal that the exponential growth of Krylov complexity can be observed in integrable systems with saddle-dominated scrambling and thus need not be associated with the presence of chaos.
A bstract Continuing the previous initiatives [1, 2], we pursue the exploration of operator growth and Krylov complexity in dissipative open quantum systems. In this paper, we resort to the bi-Lanczos algorithm generating two bi-orthogonal Krylov spaces, which individually generate non-orthogonal subspaces. Unlike the previously studied Arnoldi iteration, this algorithm renders the Lindbladian into a purely tridiagonal form, thus opening up a possibility to study a wide class of dissipative integrable and non-integrable systems by computing Krylov complexity at late times. Our study relies on two specific systems, the dissipative transverse-field Ising model (TFIM) and the dissipative interacting XXZ chain. We find that, for the weak coupling, initial Lanczos coefficients can efficiently distinguish integrable and chaotic evolution before the dissipative effect sets in, which results in more fluctuations in higher Lanczos coefficients. This results in the equal saturation of late-time complexity for both integrable and chaotic cases, making the notion of late-time chaos dubious.
Krylov complexity is a powerful diagnostic of quantum dynamics, with clear connections to other measures of quantum chaos and operator growth. One such measure is the Loschmidt amplitude, defined as the overlap of initially identical states evolved under two slightly different Hamiltonians. Its decay in certain systems is controlled by the classical Lyapunov exponent. Using the algebraic properties of the Krylov complexity operator, we express Krylov complexity as the derivative of a Loschmidt amplitude whose perturbation is parameterized by an angular variable
φ. This formulation allows us to define a spectral propagator that encodes the entire complexity distribution, which we characterize for specific types of systems. We study the two-dimensional quantum geometry spanned by time and
φ where the original and deformed trajectories reside, demonstrating that Krylov complexity is upper-bounded by its volume. We also express the time derivative of Krylov complexity in terms of a distinct Loschmidt amplitude. Depending on the growth of the Lanczos coefficients, the perturbation term in this amplitude can be truncated. We propose that the strength of this perturbation provides a classification scheme for Krylov complexity dynamics and relate it to the
φ-derivative of the spectral propagator. Using this analytical framework, we derive general relations between the time-dependence of the survival amplitude and Krylov space measures.
Krylov complexity, as a novel measure of operator complexity under Heisenberg evolution, exhibits many interesting universal behaviors and also bounds many other complexity measures. In this work, we study Krylov complexity
K(t) in Random Matrix Theory (RMT). In large
N limit: (1) For infinite temperature, we analytically show that the Lanczos coefficient
{bn} saturate to constant plateau
n→∞limbn=b, rendering a linear growing complexity
K(t)∼t, in contrast to the exponential-in-time growth in chaotic local systems in thermodynamic limit. After numerically comparing this plateau value
b to a large class of chaotic local quantum systems, we find that up to small fluctuations, it actually bounds the
{bn} in chaotic local quantum systems. Therefore we conjecture that in chaotic local quantum systems after scrambling time, the speed of linear growth of Krylov complexity cannot be larger than that in RMT. (2) For low temperature, we analytically show that
bn will first exhibit linear growth with
n, whose slope saturates the famous chaos bound. After hitting the same plateau
b,
bn will then remain constant. This indicates
K(t)∼e2πt/β before scrambling time
t∗∼O(βlogβ), and after that it will grow linearly in time, with the same speed as in infinite temperature. We finally remark on the effect of finite
N corrections.