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

Unfolded Krylov complexity: universal chaotic dynamics without false positives

Johanna Erdmenger, Kyoung-Bum Huh, Hyun-Sik Jeong, Juan F. Pedraza

hep-thnlin.CDquant-phSubmitted Sep 2, 2026• Announced Sep 3, 2026• 0 citations• Revised Sep 17, 2026 (v2)
v1 · Sep 2, 2026v2 · Sep 17, 2026
arXivHTMLPDF

Abstract

A central challenge in diagnosing quantum chaos is to distinguish genuine many-body scrambling from kinematic effects of the spectrum. Krylov state complexity, or spread complexity, has emerged as a powerful diagnostic, with its characteristic growth, peak, and relaxation often taken as signatures of chaos. However, previous work has shown that this criterion can give false positives: saddle-dominated integrable systems may display prominent peaks even without random-matrix level correlations. We argue, based on complementary numerical and analytical evidence, that this ambiguity can be resolved by unfolding the spectrum prior to constructing the ensuing Krylov dynamics. By removing the non-universal smooth density of states while retaining microscopic spectral correlations, unfolding suppresses spurious peaks in integrable systems while preserving the universal spectral signatures of chaotic systems. Analytically, the formulation of the Lanczos iteration in terms of orthogonal polynomials yields an exact complexity kernel with a robust near-diagonal structure whose fine-grained features reflect the underlying spectral correlations. Moreover, for the logarithmic model, unfolding can be performed exactly, mapping the spectrum to a uniform lattice and yielding an analytic spread complexity that removes the false-positive peak. These findings establish unfolded Krylov complexity as a more reliable probe of genuine many-body scrambling.

Comments
v1: 15 pages, 9 figures, v2: references added, minor changes

Related papers

Analytic Spread Complexity from Level Statistics: From Chaos to Integrability

Pallab Basu, Suman das, Bigboy Madlala

Spread complexity has emerged as a useful probe of quantum chaos, yet the microscopic spectral origin of its characteristic finite-time peak remains incompletely understood. We develop an analytic framework that relates spread complexity directly to local spectral statistics. Starting from an energy-space representation of the Krylov kernel, we show that the kernel is approximately banded, leading to a rapidly convergent diagonal expansion dominated by nearby levels in the ordered spectrum. Motivated by this structure, we propose an approximate kernel-universality hypothesis: after unfolding, the Krylov kernel is well approximated by that of a uniform lattice. Combining this universal kernel with local spectral statistics yields a simple analytic expression for spread complexity in terms of the Fourier transforms of the $k$-th nearest-neighbour spacing distributions. In particular, at leading order, the finite-time peak is controlled by the Fourier transform of the nearest-neighbour spacing distribution. The resulting framework describes both chaotic random-matrix ensembles and the integrable Poisson limit, identifies the spectral origin of the complexity peak and its late-time behaviour, and provides a direct connection between Krylov dynamics and spectral statistics.

hep-thCross-listedarXiv:2608.07412•Aug 10, 2026

Quantum Chaos and Spread of States in Krylov Subspace: A Topical Review

Hyun-Sik Jeong, Juan F. Pedraza

Krylov state complexity, or spread complexity, has emerged as a sharp and versatile diagnostic of quantum chaos, information spreading, and many-body dynamics. Built from the Lanczos algorithm and grounded in the optimal-basis theorem, Krylov complexity thereby provides a robust spectroscopic window into quantum dynamics. A central theme is the characteristic overshoot observed in chaotic systems: a complexity peak in which chaotic evolution drives the state deeper into the Krylov chain than in integrable systems before relaxing to equilibrium. This behavior, tied to random-matrix universality classes of spectral statistics, is illustrated across a broad range of models, including quantum billiards, quantum spin chains, and variants of the SYK model. We also discuss proposed holographic descriptions of Krylov complexity in Einstein gravity, and conclude by outlining future directions and open problems, including time-dependent systems and quantum-field-theoretic formulations. A Mathematica notebook is provided for numerical exploration of Krylov complexity and spectral statistics across models.

hep-thCross-listedarXiv:2608.26825•Aug 28, 2026•0 citations

Quantum chaos, integrability, and late times in the Krylov basis

Vijay Balasubramanian, Javier M. Magán, Qingyue Wu

Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features (gaps and correlations) are well described by random matrix theory (RMT). We propose and develop a complementary version of this conjecture: quantum chaotic systems display a Lanczos spectrum whose local means and covariances are well described by RMT. To support this proposal, we first demonstrate its validity in examples of chaotic and integrable systems. We then show that for Haar-random initial states in RMTs the mean and covariance of the Lanczos spectrum suffice to produce the full long-time behavior of general survival probabilities including the spectral form factor, as well as the spread complexity. In addition, for initial states with continuous overlap with energy eigenstates, we analytically find the long-time averages of the probabilities of Krylov basis elements in terms of the mean Lanczos spectrum. This analysis suggests a notion of eigenstate complexity, the statistics of which differentiate integrable systems and classes of quantum chaos. Finally, we clarify the relation between spread complexity and the universality classes of RMT by exploring various values of the Dyson index and Poisson distributed spectra.

arXiv:2312.03848•Physical review. E•Jan 15, 2025•25 citations

Spread complexity in saddle-dominated scrambling

Kyoung-Bum Huh, Hyun-Sik Jeong, Juan F. Pedraza

A bstract Recently, the concept of spread complexity, Krylov complexity for states, has been introduced as a measure of the complexity and chaoticity of quantum systems. In this paper, we study the spread complexity of the thermofield double state within integrable systems that exhibit saddle-dominated scrambling. Specifically, we focus on the Lipkin-Meshkov-Glick model and the inverted harmonic oscillator as representative examples of quantum mechanical systems featuring saddle-dominated scrambling. Applying the Lanczos algorithm, our numerical investigation reveals that the spread complexity in these systems exhibits features reminiscent of chaotic systems, displaying a distinctive ramp-peak-slope-plateau pattern. Our results indicate that, although spread complexity serves as a valuable probe, accurately diagnosing true quantum chaos generally necessitates additional physical input. We also explore the relationship between spread complexity, the spectral form factor, and the transition probability within the Krylov space. We provide analytical confirmation of our numerical results, validating the Ehrenfest theorem of complexity and identifying a distinct quadratic behavior in the early-time regime of spread complexity.

arXiv:2312.12593•Journal of High Energy Physics•May 13, 2024•44 citations

Towards a Refinement of Krylov Complexity: Scrambling, Classical Operator Growth and Replicas

Hugo A. Camargo, Yichao Fu, Keun-Young Kim +1 more

We propose and test logarithmic Krylov (logK) complexity, an operator growth measure akin to Krylov complexity defined through a replica approach, as a viable probe of early-time operator scrambling without false positives. In finite-dimensional quantum systems, such as the Lipkin--Meshkov--Glick (LMG) model and the mixed-field Ising model at the chaotic point, we provide numerical evidence that logK-complexity discriminates between genuine and saddle-dominated scrambling at early times, correctly avoiding the exponential contribution coming from the unstable saddle in the former case, and closely tracking the conventional Krylov complexity in the latter. In integrable quantum systems admitting infinite-dimensional Krylov subspaces, such as the SYK$_{2}$ model and the quantum inverted harmonic oscillator, we show that by modifying the Krylov spreading operator, obtained through generalizing the analytic continuation procedure in the replica trick, the logK complexity can be refined to capture the integrable properties of the theories. We supplement these analyses by extending the Krylov formalism in classical dynamical systems and defining classical versions of these operator growth measures, showing that the false positives arising from unstable saddles in classical phase space are non-existent.

hep-thCross-listedarXiv:2603.19359•Mar 23, 2026•0 citations

Krylov complexity as an order parameter for quantum chaotic-integrable transitions

Matteo Baggioli, Kyoung-Bum Huh, Hyun-Sik Jeong +2 more

Krylov complexity has recently emerged as a new paradigm to characterize quantum chaos in many-body systems. However, which features of Krylov complexity are a prerogative of quantum chaotic systems and how they relate to more standard probes, such as spectral statistics or out-of-time-order correlators (OTOCs), remain open questions. Recent insights have revealed that in quantum chaotic systems Krylov state complexity exhibits a distinct peak during time evolution before settling into a well-understood late-time plateau. In this work we propose that this Krylov complexity peak (KCP) is a hallmark of quantum chaotic systems and suggest that its height could serve as an order parameter for quantum chaos. We demonstrate that the KCP effectively identifies chaotic-integrable transitions in two representative quantum-mechanical models at both infinite and finite temperature: the mass-deformed Sachdev-Ye-Kitaev model and the sparse Sachdev-Ye-Kitaev model. Our findings align with established results from spectral statistics and OTOCs while introducing an operator-independent diagnostic for quantum chaos, offering more universal insights and a deeper understanding of the general properties of quantum chaotic systems.

arXiv:2407.17054•Physical Review Research•Apr 9, 2025•38 citations
A central challenge in diagnosing quantum chaos is to distinguish genuine many-body scrambling from kinematic effects of the spectrum. Krylov state complexity, or spread complexity, has emerged as a powerful diagnostic, with its characteristic growth, peak, and relaxation often taken as signatures of chaos. However, previous work has shown that this criterion can give false positives: saddle-dominated integrable systems may display prominent peaks even without random-matrix level correlations. We argue, based on complementary numerical and analytical evidence, that this ambiguity can be resolved by unfolding the spectrum prior to constructing the ensuing Krylov dynamics. By removing the non-universal smooth density of states while retaining microscopic spectral correlations, unfolding suppresses spurious peaks in integrable systems while preserving the universal spectral signatures of chaotic systems. Analytically, the formulation of the Lanczos iteration in terms of orthogonal polynomials yields an exact complexity kernel with a robust near-diagonal structure whose fine-grained features reflect the underlying spectral correlations. Moreover, for the logarithmic model, unfolding can be performed exactly, mapping the spectrum to a uniform lattice and yielding an analytic spread complexity that removes the false-positive peak. These findings establish unfolded Krylov complexity as a more reliable probe of genuine many-body scrambling.
Spread complexity has emerged as a useful probe of quantum chaos, yet the microscopic spectral origin of its characteristic finite-time peak remains incompletely understood. We develop an analytic framework that relates spread complexity directly to local spectral statistics. Starting from an energy-space representation of the Krylov kernel, we show that the kernel is approximately banded, leading to a rapidly convergent diagonal expansion dominated by nearby levels in the ordered spectrum. Motivated by this structure, we propose an approximate kernel-universality hypothesis: after unfolding, the Krylov kernel is well approximated by that of a uniform lattice. Combining this universal kernel with local spectral statistics yields a simple analytic expression for spread complexity in terms of the Fourier transforms of the kkk-th nearest-neighbour spacing distributions. In particular, at leading order, the finite-time peak is controlled by the Fourier transform of the nearest-neighbour spacing distribution. The resulting framework describes both chaotic random-matrix ensembles and the integrable Poisson limit, identifies the spectral origin of the complexity peak and its late-time behaviour, and provides a direct connection between Krylov dynamics and spectral statistics.
Krylov state complexity, or spread complexity, has emerged as a sharp and versatile diagnostic of quantum chaos, information spreading, and many-body dynamics. Built from the Lanczos algorithm and grounded in the optimal-basis theorem, Krylov complexity thereby provides a robust spectroscopic window into quantum dynamics. A central theme is the characteristic overshoot observed in chaotic systems: a complexity peak in which chaotic evolution drives the state deeper into the Krylov chain than in integrable systems before relaxing to equilibrium. This behavior, tied to random-matrix universality classes of spectral statistics, is illustrated across a broad range of models, including quantum billiards, quantum spin chains, and variants of the SYK model. We also discuss proposed holographic descriptions of Krylov complexity in Einstein gravity, and conclude by outlining future directions and open problems, including time-dependent systems and quantum-field-theoretic formulations. A Mathematica notebook is provided for numerical exploration of Krylov complexity and spectral statistics across models.
Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features (gaps and correlations) are well described by random matrix theory (RMT). We propose and develop a complementary version of this conjecture: quantum chaotic systems display a Lanczos spectrum whose local means and covariances are well described by RMT. To support this proposal, we first demonstrate its validity in examples of chaotic and integrable systems. We then show that for Haar-random initial states in RMTs the mean and covariance of the Lanczos spectrum suffice to produce the full long-time behavior of general survival probabilities including the spectral form factor, as well as the spread complexity. In addition, for initial states with continuous overlap with energy eigenstates, we analytically find the long-time averages of the probabilities of Krylov basis elements in terms of the mean Lanczos spectrum. This analysis suggests a notion of eigenstate complexity, the statistics of which differentiate integrable systems and classes of quantum chaos. Finally, we clarify the relation between spread complexity and the universality classes of RMT by exploring various values of the Dyson index and Poisson distributed spectra.
A bstract Recently, the concept of spread complexity, Krylov complexity for states, has been introduced as a measure of the complexity and chaoticity of quantum systems. In this paper, we study the spread complexity of the thermofield double state within integrable systems that exhibit saddle-dominated scrambling. Specifically, we focus on the Lipkin-Meshkov-Glick model and the inverted harmonic oscillator as representative examples of quantum mechanical systems featuring saddle-dominated scrambling. Applying the Lanczos algorithm, our numerical investigation reveals that the spread complexity in these systems exhibits features reminiscent of chaotic systems, displaying a distinctive ramp-peak-slope-plateau pattern. Our results indicate that, although spread complexity serves as a valuable probe, accurately diagnosing true quantum chaos generally necessitates additional physical input. We also explore the relationship between spread complexity, the spectral form factor, and the transition probability within the Krylov space. We provide analytical confirmation of our numerical results, validating the Ehrenfest theorem of complexity and identifying a distinct quadratic behavior in the early-time regime of spread complexity.
We propose and test logarithmic Krylov (logK) complexity, an operator growth measure akin to Krylov complexity defined through a replica approach, as a viable probe of early-time operator scrambling without false positives. In finite-dimensional quantum systems, such as the Lipkin--Meshkov--Glick (LMG) model and the mixed-field Ising model at the chaotic point, we provide numerical evidence that logK-complexity discriminates between genuine and saddle-dominated scrambling at early times, correctly avoiding the exponential contribution coming from the unstable saddle in the former case, and closely tracking the conventional Krylov complexity in the latter. In integrable quantum systems admitting infinite-dimensional Krylov subspaces, such as the SYK2_{2}2​ model and the quantum inverted harmonic oscillator, we show that by modifying the Krylov spreading operator, obtained through generalizing the analytic continuation procedure in the replica trick, the logK complexity can be refined to capture the integrable properties of the theories. We supplement these analyses by extending the Krylov formalism in classical dynamical systems and defining classical versions of these operator growth measures, showing that the false positives arising from unstable saddles in classical phase space are non-existent.
Krylov complexity has recently emerged as a new paradigm to characterize quantum chaos in many-body systems. However, which features of Krylov complexity are a prerogative of quantum chaotic systems and how they relate to more standard probes, such as spectral statistics or out-of-time-order correlators (OTOCs), remain open questions. Recent insights have revealed that in quantum chaotic systems Krylov state complexity exhibits a distinct peak during time evolution before settling into a well-understood late-time plateau. In this work we propose that this Krylov complexity peak (KCP) is a hallmark of quantum chaotic systems and suggest that its height could serve as an order parameter for quantum chaos. We demonstrate that the KCP effectively identifies chaotic-integrable transitions in two representative quantum-mechanical models at both infinite and finite temperature: the mass-deformed Sachdev-Ye-Kitaev model and the sparse Sachdev-Ye-Kitaev model. Our findings align with established results from spectral statistics and OTOCs while introducing an operator-independent diagnostic for quantum chaos, offering more universal insights and a deeper understanding of the general properties of quantum chaotic systems.