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:2407.06428 · Physical review. E

Exploring quantum ergodicity of unitary evolution through the Krylov approach

Gastón F. Scialchi, Augusto J. Roncaglia, Carlos Pineda, Diego A. Wisniacki

Published Jan 17, 2025• 5 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreve.111.014220

Related papers

Integrability-to-chaos transition through the Krylov approach for state evolution

Gastón F. Scialchi, Augusto J. Roncaglia, Diego A. Wisniacki

The complexity of quantum evolutions can be understood by examining their spread in a chosen basis. Recent research has stressed the fact that the Krylov basis is particularly adept at minimizing this spread [Balasubramanian et al., Phys. Rev. D 106, 046007 (2022)2470-001010.1103/PhysRevD.106.046007]. This property assigns a central role to the Krylov basis in the investigation of quantum chaos. Here, we delve into the transition from integrability to chaos using the Krylov approach, employing an Ising spin chain and a banded random matrix model as our testing models. Our findings indicate that both the saturation of Krylov complexity and the spread of the Lanczos coefficients can exhibit a significant dependence on the initial condition. However, both quantities can gauge dynamical quantum chaos with a proper choice of the initial state.

Physical review. E•May 20, 2024•27 citations

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 complexity and Trotter transitions in unitary circuit dynamics

Philippe Suchsland, Roderich Moessner, Pieter W. Claeys

We investigate many-body dynamics where the evolution is governed by unitary circuits through the lens of “Krylov complexity,” a recently proposed measure of complexity and quantum chaos. We extend the formalism of Krylov complexity to unitary circuit dynamics and focus on Floquet circuits arising as the Trotter decomposition of Hamiltonian dynamics. For short Trotter steps the results from Hamiltonian dynamics are recovered, whereas a large Trotter step results in different universal behavior characterized by the existence of local : operators with vanishing autocorrelation functions, as exemplified in dual-unitary circuits. These operators exhibit maximal complexity growth, act as a memoryless bath for the dynamics, and can be directly probed in current quantum computing setups. These two regimes are separated by a crossover in chaotic systems. Conversely, we find that free integrable systems exhibit a nonanalytic transition between these different regimes, where maximally ergodic operators appear at a critical Trotter step.

arXiv:2308.03851•Physical review. B./Physical review. B•Jan 15, 2025•26 citations

Krylov construction and complexity for driven quantum systems

Amin A. Nizami, Ankit W. Shrestha

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.

arXiv:2305.00256•Physical review. E•Nov 28, 2023•35 citations

Krylov complexity from integrability to chaos

Eliezer Rabinovici, Adrián Sánchez-Garrido, Ruth Shir +1 more

A bstract We apply a notion of quantum complexity, called “Krylov complexity”, to study the evolution of systems from integrability to chaos. For this purpose we investigate the integrable XXZ spin chain, enriched with an integrability breaking deformation that allows one to interpolate between integrable and chaotic behavior. K-complexity can act as a probe of the integrable or chaotic nature of the underlying system via its late-time saturation value that is suppressed in the integrable phase and increases as the system is driven to the chaotic phase. We furthermore ascribe the (under-)saturation of the late-time bound to the amount of disorder present in the Lanczos sequence, by mapping the complexity evolution to an auxiliary off-diagonal Anderson hopping model. We compare the late-time saturation of K-complexity in the chaotic phase with that of random matrix ensembles and find that the chaotic system indeed approaches the RMT behavior in the appropriate symmetry class. We investigate the dependence of the results on the two key ingredients of K-complexity: the dynamics of the Hamiltonian and the character of the operator whose time dependence is followed.

arXiv:2207.07701•Journal of High Energy Physics•Jul 26, 2022•144 citations

Integrability to chaos transition through Krylov approach for state evolution

Gastón F. Scialchi, Augusto J. Roncaglia, Diego A. Wisniacki

The complexity of quantum evolutions can be understood by examining their dispersion in a chosen basis. Recent research has stressed the fact that the Krylov basis is particularly adept at minimizing this dispersion [V. Balasubramanian et al, Physical Review D 106, 046007 (2022)]. This property assigns a central role to the Krylov basis in the investigation of quantum chaos. Here, we delve into the transition from integrability to chaos using the Krylov approach, employing an Ising spin chain and a banded random matrix model as our testing models. Our findings indicate that both the saturation of Krylov complexity and the dispersion of the Lanczos coefficients can exhibit a significant dependence on the initial condition. However, both quantities can gauge dynamical quantum chaos with a proper choice of the initial state.

arXiv:2309.13427•Sep 23, 2023•0 citations
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.
The complexity of quantum evolutions can be understood by examining their spread in a chosen basis. Recent research has stressed the fact that the Krylov basis is particularly adept at minimizing this spread [Balasubramanian et al., Phys. Rev. D 106, 046007 (2022)2470-001010.1103/PhysRevD.106.046007]. This property assigns a central role to the Krylov basis in the investigation of quantum chaos. Here, we delve into the transition from integrability to chaos using the Krylov approach, employing an Ising spin chain and a banded random matrix model as our testing models. Our findings indicate that both the saturation of Krylov complexity and the spread of the Lanczos coefficients can exhibit a significant dependence on the initial condition. However, both quantities can gauge dynamical quantum chaos with a proper choice of the initial state.
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 investigate many-body dynamics where the evolution is governed by unitary circuits through the lens of “Krylov complexity,” a recently proposed measure of complexity and quantum chaos. We extend the formalism of Krylov complexity to unitary circuit dynamics and focus on Floquet circuits arising as the Trotter decomposition of Hamiltonian dynamics. For short Trotter steps the results from Hamiltonian dynamics are recovered, whereas a large Trotter step results in different universal behavior characterized by the existence of local : operators with vanishing autocorrelation functions, as exemplified in dual-unitary circuits. These operators exhibit maximal complexity growth, act as a memoryless bath for the dynamics, and can be directly probed in current quantum computing setups. These two regimes are separated by a crossover in chaotic systems. Conversely, we find that free integrable systems exhibit a nonanalytic transition between these different regimes, where maximally ergodic operators appear at a critical Trotter step.
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.
A bstract We apply a notion of quantum complexity, called “Krylov complexity”, to study the evolution of systems from integrability to chaos. For this purpose we investigate the integrable XXZ spin chain, enriched with an integrability breaking deformation that allows one to interpolate between integrable and chaotic behavior. K-complexity can act as a probe of the integrable or chaotic nature of the underlying system via its late-time saturation value that is suppressed in the integrable phase and increases as the system is driven to the chaotic phase. We furthermore ascribe the (under-)saturation of the late-time bound to the amount of disorder present in the Lanczos sequence, by mapping the complexity evolution to an auxiliary off-diagonal Anderson hopping model. We compare the late-time saturation of K-complexity in the chaotic phase with that of random matrix ensembles and find that the chaotic system indeed approaches the RMT behavior in the appropriate symmetry class. We investigate the dependence of the results on the two key ingredients of K-complexity: the dynamics of the Hamiltonian and the character of the operator whose time dependence is followed.
The complexity of quantum evolutions can be understood by examining their dispersion in a chosen basis. Recent research has stressed the fact that the Krylov basis is particularly adept at minimizing this dispersion [V. Balasubramanian et al, Physical Review D 106, 046007 (2022)]. This property assigns a central role to the Krylov basis in the investigation of quantum chaos. Here, we delve into the transition from integrability to chaos using the Krylov approach, employing an Ising spin chain and a banded random matrix model as our testing models. Our findings indicate that both the saturation of Krylov complexity and the dispersion of the Lanczos coefficients can exhibit a significant dependence on the initial condition. However, both quantities can gauge dynamical quantum chaos with a proper choice of the initial state.