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:2306.14732 · Physical review. D/Physical review. D.

Krylov complexity of modular Hamiltonian evolution

Paweł Caputa, Javier M. Magán, Dimitrios Patramanis, Erik Tonni C

Published Apr 2, 2024• 27 citations
arXivHTMLPDF

Abstract

We investigate the complexity of states and operators evolved with the modular Hamiltonian by using the Krylov basis. In the first part, we formulate the problem for states and analyze different examples, including quantum mechanics, two-dimensional conformal field theories and random modular Hamiltonians, focusing on relations with the entanglement spectrum. We find that the modular Lanczos spectrum provides a different approach to quantum entanglement, opening new avenues in many-body systems and holography. In the second part, we focus on the modular evolution of operators and states excited by local operators in two-dimensional conformal field theories. We find that, at late modular time, the spread complexity is universally governed by the modular Lyapunov exponent λLmod=2π and is proportional to the local temperature of the modular Hamiltonian. Our analysis provides explicit examples where entanglement entropy is indeed not enough; however the entanglement spectrum is, and encodes the same information as complexity. Published by the American Physical Society 2024

DOI
10.1103/physrevd.109.086004

Related papers

Local quenches from a Krylov perspective

Paweł Caputa, Giuseppe Di Giulio

A bstract In this work, we investigate local quench dynamics in two-dimensional conformal field theories using Krylov space methods. We derive Lanczos coefficients, spread complexity, and Krylov entropies for local joining and splitting quenches in theories on an infinite line, a circle, a finite interval, and at finite temperature. We examine how these quantities depend on the central charge of the underlying conformal field theory and find that both spread complexity and Krylov entropy are proportional to it. Interestingly, Krylov entropies evolve logarithmically with time, mirroring standard entanglement entropies, making them useful for extracting the central charge. In the large central charge limit, using holography, we establish a connection between the rate of spread complexity and the proper momentum of the tip of the end-of-the world brane, which probes the bulk analogously to a point particle. Our results further demonstrate that spread complexity and Krylov entropies are powerful tools for probing non-equilibrium dynamics of interacting quantum systems.

arXiv:2502.19485•Journal of High Energy Physics•Jul 15, 2025•14 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

Geometry of Krylov complexity

Paweł Caputa, Javier M. Magán, Dimitrios Patramanis

We develop a geometric approach to operator growth and Krylov complexity in many-body quantum systems governed by symmetries. We start by showing a direct link between a unitary evolution with the Liouvillian and the displacement operator of appropriate generalized coherent states. This connection maps operator growth to a purely classical motion in phase space. The phase spaces are endowed with a natural information metric. We show that, in this geometry, operator growth is represented by geodesics, and Krylov complexity is proportional to a volume. This geometric perspective also provides two novel avenues toward computation of Lanczos coefficients, and it sheds new light on the origin of their maximal growth. We describe the general idea and analyze it in explicit examples, among which we reproduce known results from the Sachdev-Ye-Kitaev model, derive operator growth based on SU(2) and Heisenberg-Weyl symmetries, and generalize the discussion to conformal field theories. Finally, we use techniques from quantum optics to study operator evolution with quantum information tools such as entanglement and Renyi entropies, negativity, fidelity, relative entropy, and capacity of entanglement.

arXiv:2109.03824•Physical Review Research•Jan 19, 2022•205 citations

Entanglement complexity of quantum states, dynamics and quantum computation

Zhi-Cheng Yang

Quantum entanglement has become the key notion bridging originally distinct fields of research over the last decade, namely, quantum information and computation, condensed matter physics, and quantum gravity. Previous studies on quantum entanglement have largely focused on the entanglement entropy, which quantifies the amount of entanglement. However, a natural question arises: is there additional information of a quantum state that is not captured by the entanglement entropy alone? For ground states of gapped Hamiltonians, this question has been answered in the affirmative. In this dissertation, I extend this idea to study highly entangled states typically having volume law entropy, and demonstrate that there is indeed much richer information on the complexity of a quantum state beyond the entanglement entropy. \n \nIn the first part, I study the entanglement spectrum of highly entangled states corresponding to highly excited eigenstates of non-integrable Hamiltonians, time-evolved states after a quantum quench with Hamiltonians exhibiting different dynamical phases, and random unitary circuits consisting of random braids of non-Abelian anyons. I demonstrate that the entanglement spectrum is able to capture the degree of randomness of a quantum state, which we call the entanglement complexity. In the context of scrambling, this quantifies the degree of randomness produced by scrambling beyond entropic diagnostics. \n \nOur understanding of quantum entanglement in condensed matter systems and high energy physics have largely benefited from the field of quantum computation. In the second part of the dissertation, I present two examples of novel platforms for quantum computation using state-of-the-art experimental technologies. I demonstrate how one can use hybrid quantum-classical architecture to solve computational problems based on an optimal variational ansatz of the evolution protocol. I also present a hierarchical architecture of constructing logical Majorana zero modes which can be used for demonstrating non-Abelian braiding statistics experimentally.

•Jan 1, 2019•0 citations

Krylov Complexity from Loschmidt Amplitude

Debarghya Chakraborty

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.

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

Krylov complexity of density matrix operators

Paweł Caputa, Hyun-Sik Jeong, Sinong Liu +2 more

A bstract Quantifying complexity in quantum systems has witnessed a surge of interest in recent years, with Krylov-based measures such as Krylov complexity ( C K ) and Spread complexity ( C S ) gaining prominence. In this study, we investigate their interplay by considering the complexity of states represented by density matrix operators . After setting up the problem, we analyze a handful of analytical and numerical examples spanning generic two-dimensional Hilbert spaces, qubit states, quantum harmonic oscillators, and random matrix theories, uncovering insightful relationships. For generic pure states, our analysis reveals two key findings: (I) a correspondence between moment-generating functions (of Lanczos coefficients) and survival amplitudes, and (II) an early-time equivalence between C K and 2 C S . Furthermore, for maximally entangled pure states, we find that the moment-generating function of C K becomes the Spectral Form Factor and, at late-times, C K is simply related to NC S for N ≥ 2 within the N -dimensional Hilbert space. Notably, we confirm that C K = 2 C S holds across all times when N = 2. Through the lens of random matrix theories, we also discuss deviations between complexities at intermediate times and highlight subtleties in the averaging approach at the level of the survival amplitude.

arXiv:2402.09522•Journal of High Energy Physics•May 31, 2024•59 citations
We investigate the complexity of states and operators evolved with the modular Hamiltonian by using the Krylov basis. In the first part, we formulate the problem for states and analyze different examples, including quantum mechanics, two-dimensional conformal field theories and random modular Hamiltonians, focusing on relations with the entanglement spectrum. We find that the modular Lanczos spectrum provides a different approach to quantum entanglement, opening new avenues in many-body systems and holography. In the second part, we focus on the modular evolution of operators and states excited by local operators in two-dimensional conformal field theories. We find that, at late modular time, the spread complexity is universally governed by the modular Lyapunov exponent λLmod=2π and is proportional to the local temperature of the modular Hamiltonian. Our analysis provides explicit examples where entanglement entropy is indeed not enough; however the entanglement spectrum is, and encodes the same information as complexity. Published by the American Physical Society 2024
A bstract In this work, we investigate local quench dynamics in two-dimensional conformal field theories using Krylov space methods. We derive Lanczos coefficients, spread complexity, and Krylov entropies for local joining and splitting quenches in theories on an infinite line, a circle, a finite interval, and at finite temperature. We examine how these quantities depend on the central charge of the underlying conformal field theory and find that both spread complexity and Krylov entropy are proportional to it. Interestingly, Krylov entropies evolve logarithmically with time, mirroring standard entanglement entropies, making them useful for extracting the central charge. In the large central charge limit, using holography, we establish a connection between the rate of spread complexity and the proper momentum of the tip of the end-of-the world brane, which probes the bulk analogously to a point particle. Our results further demonstrate that spread complexity and Krylov entropies are powerful tools for probing non-equilibrium dynamics of interacting quantum systems.
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 develop a geometric approach to operator growth and Krylov complexity in many-body quantum systems governed by symmetries. We start by showing a direct link between a unitary evolution with the Liouvillian and the displacement operator of appropriate generalized coherent states. This connection maps operator growth to a purely classical motion in phase space. The phase spaces are endowed with a natural information metric. We show that, in this geometry, operator growth is represented by geodesics, and Krylov complexity is proportional to a volume. This geometric perspective also provides two novel avenues toward computation of Lanczos coefficients, and it sheds new light on the origin of their maximal growth. We describe the general idea and analyze it in explicit examples, among which we reproduce known results from the Sachdev-Ye-Kitaev model, derive operator growth based on SU(2) and Heisenberg-Weyl symmetries, and generalize the discussion to conformal field theories. Finally, we use techniques from quantum optics to study operator evolution with quantum information tools such as entanglement and Renyi entropies, negativity, fidelity, relative entropy, and capacity of entanglement.
Quantum entanglement has become the key notion bridging originally distinct fields of research over the last decade, namely, quantum information and computation, condensed matter physics, and quantum gravity. Previous studies on quantum entanglement have largely focused on the entanglement entropy, which quantifies the amount of entanglement. However, a natural question arises: is there additional information of a quantum state that is not captured by the entanglement entropy alone? For ground states of gapped Hamiltonians, this question has been answered in the affirmative. In this dissertation, I extend this idea to study highly entangled states typically having volume law entropy, and demonstrate that there is indeed much richer information on the complexity of a quantum state beyond the entanglement entropy. \n \nIn the first part, I study the entanglement spectrum of highly entangled states corresponding to highly excited eigenstates of non-integrable Hamiltonians, time-evolved states after a quantum quench with Hamiltonians exhibiting different dynamical phases, and random unitary circuits consisting of random braids of non-Abelian anyons. I demonstrate that the entanglement spectrum is able to capture the degree of randomness of a quantum state, which we call the entanglement complexity. In the context of scrambling, this quantifies the degree of randomness produced by scrambling beyond entropic diagnostics. \n \nOur understanding of quantum entanglement in condensed matter systems and high energy physics have largely benefited from the field of quantum computation. In the second part of the dissertation, I present two examples of novel platforms for quantum computation using state-of-the-art experimental technologies. I demonstrate how one can use hybrid quantum-classical architecture to solve computational problems based on an optimal variational ansatz of the evolution protocol. I also present a hierarchical architecture of constructing logical Majorana zero modes which can be used for demonstrating non-Abelian braiding statistics experimentally.
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.
A bstract Quantifying complexity in quantum systems has witnessed a surge of interest in recent years, with Krylov-based measures such as Krylov complexity ( C K ) and Spread complexity ( C S ) gaining prominence. In this study, we investigate their interplay by considering the complexity of states represented by density matrix operators . After setting up the problem, we analyze a handful of analytical and numerical examples spanning generic two-dimensional Hilbert spaces, qubit states, quantum harmonic oscillators, and random matrix theories, uncovering insightful relationships. For generic pure states, our analysis reveals two key findings: (I) a correspondence between moment-generating functions (of Lanczos coefficients) and survival amplitudes, and (II) an early-time equivalence between C K and 2 C S . Furthermore, for maximally entangled pure states, we find that the moment-generating function of C K becomes the Spectral Form Factor and, at late-times, C K is simply related to NC S for N ≥ 2 within the N -dimensional Hilbert space. Notably, we confirm that C K = 2 C S holds across all times when N = 2. Through the lens of random matrix theories, we also discuss deviations between complexities at intermediate times and highlight subtleties in the averaging approach at the level of the survival amplitude.