Krylov complexity is an important dynamical quantity with relevance to the study of operator growth and quantum chaos and has recently been much studied for various time-independent systems. We initiate the study of K complexity in time-dependent (driven) quantum systems. For periodic time-dependent (Floquet) systems, we develop a natural method for doing the Krylov construction and then define (state and operator) K complexity for such systems. Focusing on kicked systems, in particular the quantum kicked rotor on a torus, we provide a detailed numerical study of the time dependence of Arnoldi coefficients as well as of the K complexity with the system coupling constant interpolating between the weak and strong coupling regimes. We also study the growth of the Krylov subspace dimension as a function of the system coupling constant.
Krylov complexity is an important dynamical quantity with relevance to the study of operator growth and quantum chaos and has recently been much studied for various time-independent systems. We initiate the study of K complexity in time-dependent (driven) quantum systems. For periodic time-dependent (Floquet) systems, we develop a natural method for doing the Krylov construction and then define (state and operator) K complexity for such systems. Focusing on kicked systems, in particular the quantum kicked rotor on a torus, we provide a detailed numerical study of the time dependence of Arnoldi coefficients as well as of the K complexity with the system coupling constant interpolating between the weak and strong coupling regimes. We also study the growth of the Krylov subspace dimension as a function of the system coupling constant.
The complexity of quantum states under dynamical evolution can be investigated by studying the spread with time of the state over a predefined basis. It is known that this complexity is minimized by choosing the Krylov basis, thus defining the spread complexity. We study the dynamics of spread complexity for quantum maps using the Arnoldi iterative procedure. The main illustrative quantum many-body model we use is the periodically kicked Ising spinchain with nonintegrable deformations, a chaotic system where we look at both local and nonlocal interactions. In the various cases, we find distinctive behavior of the Arnoldi coefficients and spread complexity for regular versus chaotic dynamics: suppressed fluctuations in the Arnoldi coefficients as well as larger saturation value in spread complexity in the chaotic case. We compare the behavior of the Krylov measures with that of standard spectral diagnostics of chaos. We also study the effect of changing the driving frequency on the complexity saturation.
Krylov complexity has become a central probe of operator growth, scrambling, and quantum chaos. Yet, a basic fact hinders its experimental study: laboratory quantum systems are routinely driven in time, whereas the Krylov construction assumes a fixed generator and breaks down once the Hamiltonian varies. Here, we solve the time-dependent many-body Krylov problem exactly and in closed form for scale- and rotation-invariant systems realized in current quantum-simulation and control platforms. We find exact relations that map the driven dynamics onto mutually orthogonal Krylov subspaces and yield a closed-form spread complexity, determined solely by the spectral properties of the initial Hamiltonian and the driving schedule. The construction extends to Liouville space and solves the time-dependent density-matrix Krylov problem, which makes the Krylov dynamics of initial thermal states experimentally accessible. In scale-invariant quantum gases, such as the driven Lieb-Liniger model, the Tonks-Girardeau gas, and the Calogero-Sutherland model, the complexity is set by the width of the atomic cloud and its rate of change, directly accessible via in situ and time-of-flight imaging. In rotation-invariant spin systems such as the Haldane-Shastry and central-spin models, it is governed by collective spin precession that can be probed and read out in trapped-ion, cavity-QED, and circuit-QED platforms.
We study quantum dynamics generated by time-dependent Hamiltonians in Krylov space, the minimal subspace in which the evolution takes place. We establish a direct link between dynamics in the time-dependent Krylov subspace and the underlying Lie-algebraic structure of the Hamiltonian. We develop a general framework in which the dynamics in the time-dependent Krylov subspace is generated by ladder operators of the associated Lie algebra. In particular, we identify the minimal conditions under which the exact time-dependent Krylov dynamics is naturally determined by the interaction-picture Hamiltonian and governed by an embedded sl(2,C) subalgebra. We further show that an exact single-exponential representation of the time-evolution operator gives rise to a distinct time-independent Krylov dynamics in a unitarily related basis, from which the exact time-dependent Krylov dynamics can nevertheless be recovered. We also extend the framework to the oscillator algebra as the simplest extension of the nilpotent Heisenberg--Weyl algebra, and provide further examples, including the translated and dilated harmonic oscillator, systems governed by closed Virasoro subalgebras, a spin in a rotating magnetic field, and higher-dimensional generalizations for multi-level systems. In addition, we introduce a new quantum speed limit to the complexity growth rate generated by a time-dependent generator and show that, for evolutions governed by a Lie algebra, it retains the same functional form as in the time-independent case. Remarkably, saturation of this bound is strongly affected by temporal driving and persists only when the Hamiltonian commutes with itself at different times. These results establish a unified framework for characterizing operator growth and Krylov complexity in time-dependent quantum systems with underlying Lie-algebraic structures.
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 tool. For unitary evolutions like kicked systems or Trotterized dynamics, a similar formulation based on the Arnoldi approach has been proposed yielding a new notion of quantum ergodicity [P. Suchsland, R. Moessner, and P. W. Claeys, Phys. Rev. B 111, 014309 (2025)10.1103/PhysRevB.111.014309]. In this work, we show that this formulation is robust for observing the transition from integrability to chaos in both autonomous and kicked systems. Examples from random matrix theory and spin chains are shown in this paper.
We investigate Krylov spread complexity for states evolving under time-dependent Hamiltonians. For periodically driven systems, we formulate the problem within Floquet theory and show how the Magnus expansion provides a systematic approximation when the Floquet Hamiltonian is not available in closed form. We then extend this framework beyond periodic driving and demonstrate that, in addition to the globally truncated Magnus expansion, a piecewise Magnus expansion provides a reliable method when the global expansion loses convergence or accuracy. Our results provide practical tools for analyzing complexity growth in a broad class of time-dependent quantum systems.
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.