Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2305.00256 · Physical review. E

Krylov construction and complexity for driven quantum systems

Amin A. Nizami, Ankit W. Shrestha

Published Nov 28, 2023• 35 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreve.108.054222

Related papers

Spread complexity and quantum chaos for periodically driven spin chains

Amin A. Nizami, Ankit W. Shrestha

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.

arXiv:2405.16182•Physical review. E•Sep 3, 2024•11 citations

Krylov Dynamics and Operator Growth in Time-Dependent Systems via Lie Algebras

András Grabarits, E. Medina-Guerra, Adolfo del Campo

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 $\mathfrak{sl}(2,\mathbb{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.

quant-pharXiv:2605.05290•May 8, 2026•0 citations

Exploring quantum ergodicity of unitary evolution through the Krylov approach

Gastón F. Scialchi, Augusto J. Roncaglia, Carlos Pineda +1 more

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.

arXiv:2407.06428•Physical review. E•Jan 17, 2025•5 citations

Krylov complexity in the Schrödinger field theory

Peng-Zhang He, Hai-Qing Zhang

A bstract We investigate the Krylov complexity of Schrödinger field theories, focusing on both bosonic and fermionic systems within the grand canonical ensemble which includes a chemical potential. Krylov complexity measures operator growth in quantum systems by analyzing how operators spread within the Krylov space, a subspace of the Hilbert space spanned by successive applications of the superoperator [ H , ·] on an initial operator. Using the Lanczos algorithm, we construct an orthonormal Krylov basis and derive the Lanczos coefficients, which govern the operator connectivity and thus characterize the complexity. Our study reveals that the Lanczos coefficients { b n } are almost independent of the chemical potential, while { a n } are dependent on the chemical potential. Both { a n } and { b n } show linear relationships with respect to n . For both bosonic and fermionic systems, the Krylov complexities behave similarly over time, especially at late times, due to the analogous profiles of the squared absolute values of their autocorrelation functions | φ 0 ( t )| 2 . The Krylov complexity grows exponentially with time, but its asymptotic scaling factor λ K is significantly smaller than the twice of the slope of the { b n } coefficients, contrasting to the relativistic field theories where the scaling aligns more closely with the twice of the slope of { b n }.

arXiv:2411.16302•Journal of High Energy Physics•Mar 19, 2025•4 citations

Krylov Complexity for Time-Dependent Hamiltonians

Amin Faraji Astaneh, Parsa Kafashi

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.

hep-thCross-listedarXiv:2607.10454•Jul 14, 2026•0 citations

Streamlined Krylov construction and classification of ergodic Floquet systems

Nikita Kolganov, Dmitrii A. Trunin

We generalize the Krylov construction to periodically driven (Floquet) quantum systems using the theory of orthogonal polynomials on the unit circle. Compared to other approaches, our method works faster and maps any quantum dynamics to a one-dimensional tight-binding Krylov chain, which is efficiently simulated on both classical and quantum computers. We also suggest a classification of chaotic and integrable Floquet systems based on the asymptotic behavior of Krylov chain hopping parameters (Verblunsky coefficients). We illustrate this classification with random matrix ensembles, kicked top, and kicked Ising chain.

arXiv:2412.19797•Physical review. E•May 14, 2025•6 citations
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.
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)\mathfrak{sl}(2,\mathbb{C})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.
A bstract We investigate the Krylov complexity of Schrödinger field theories, focusing on both bosonic and fermionic systems within the grand canonical ensemble which includes a chemical potential. Krylov complexity measures operator growth in quantum systems by analyzing how operators spread within the Krylov space, a subspace of the Hilbert space spanned by successive applications of the superoperator [ H , ·] on an initial operator. Using the Lanczos algorithm, we construct an orthonormal Krylov basis and derive the Lanczos coefficients, which govern the operator connectivity and thus characterize the complexity. Our study reveals that the Lanczos coefficients { b n } are almost independent of the chemical potential, while { a n } are dependent on the chemical potential. Both { a n } and { b n } show linear relationships with respect to n . For both bosonic and fermionic systems, the Krylov complexities behave similarly over time, especially at late times, due to the analogous profiles of the squared absolute values of their autocorrelation functions | φ 0 ( t )| 2 . The Krylov complexity grows exponentially with time, but its asymptotic scaling factor λ K is significantly smaller than the twice of the slope of the { b n } coefficients, contrasting to the relativistic field theories where the scaling aligns more closely with the twice of the slope of { b n }.
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.
We generalize the Krylov construction to periodically driven (Floquet) quantum systems using the theory of orthogonal polynomials on the unit circle. Compared to other approaches, our method works faster and maps any quantum dynamics to a one-dimensional tight-binding Krylov chain, which is efficiently simulated on both classical and quantum computers. We also suggest a classification of chaotic and integrable Floquet systems based on the asymptotic behavior of Krylov chain hopping parameters (Verblunsky coefficients). We illustrate this classification with random matrix ensembles, kicked top, and kicked Ising chain.