Unfolded Krylov complexity: universal chaotic dynamics without false positives

• URL: http://arxiv.org/abs/2609.02228v1
• Date: Wed, 02 Sep 2026 07:39:12 GMT
• Title: Unfolded Krylov complexity: universal chaotic dynamics without false positives
• Abstract summary: Krylov state complexity, or spread complexity, has emerged as a powerful diagnostic.<n>Previous work has shown that this criterion can give false positives.<n>We argue that this ambiguity can be resolved by unfolding the spectrum prior to constructing the Krylov dynamics.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Analytic Spread Complexity from Level Statistics: From Chaos to Integrability [1.497481482212619]
  We develop an analytic framework that relates spread complexity directly to local spectral statistics.<n>We show that the Krylov kernel is approximately banded, leading to a rapidly convergent diagonal expansion dominated by nearby levels in the ordered spectrum.<n>We identify the spectral origin of the complexity peak and its late-time behaviour, and provide a direct connection between Krylov dynamics and spectral statistics.
  arXiv  Detail & Related papers  (2026-08-07T16:59:35Z)
• Typical entanglement in anyon chains: Page curves beyond Lie group symmetries [41.99844472131922]
  We study bipartite entanglement statistics in one-dimensional anyon chains constrained by fusion rules of unitary pre-modular categories.<n>Surprisingly, despite the constrained Hilbert space structure, the large $L$ expansion has no universal $O(sqrtL)$ or $O(1)$ symmetry-type corrections.<n> Numerical simulations of the integrable and quantum-chaotic golden chain Hamiltonian show that chaotic mid-spectrum eigenstates match the Haar-random predictions.
  arXiv  Detail & Related papers  (2026-03-26T18:00:03Z)
• Towards a Refinement of Krylov Complexity: Scrambling, Classical Operator Growth and Replicas [3.3587645077393655]
  logarithmic Krylov (logK) complexity is a probe of early-time operator scrambling without false positives.<n>We show that logK-complexity discriminates between genuine and saddle-dominated scrambling at early times.<n>We extend the Krylov formalism in classical dynamical systems to define classical versions of these operator growth measures.
  arXiv  Detail & Related papers  (2026-03-19T18:00:07Z)
• Random-Matrix-Induced Simplicity Bias in Over-parameterized Variational Quantum Circuits [72.0643009153473]
  We show that expressive variational ansatze enter a Haar-like universality class in which both observable expectation values and parameter gradients concentrate exponentially with system size.<n>As a consequence, the hypothesis class induced by such circuits collapses with high probability to a narrow family of near-constant functions.<n>We further show that this collapse is not unavoidable: tensor-structured VQCs, including tensor-network-based and tensor-hypernetwork parameterizations, lie outside the Haar-like universality class.
  arXiv  Detail & Related papers  (2026-01-05T08:04:33Z)
• Quantum Chaos Diagnostics for Open Quantum Systems from Bi-Lanczos Krylov Dynamics [2.0603431589684518]
  In Hermitian systems, Krylov complexity has emerged as a powerful diagnostic of quantum dynamics.<n>Here, we demonstrate that Krylov complexity, computed via the bi-Lanczos algorithm, effectively identifies chaotic and integrable phases in open quantum systems.
  arXiv  Detail & Related papers  (2025-08-19T15:49:09Z)
• Hierarchical analytical approach to universal spectral correlations in Brownian Quantum Chaos [44.99833362998488]
  We develop an analytical approach to the spectral form factor and out-of-time ordered correlators in zero-dimensional Brownian models of quantum chaos.
  arXiv  Detail & Related papers  (2024-10-21T10:56:49Z)
• Equivalence of dynamics of disordered quantum ensembles and semi-infinite lattices [44.99833362998488]
  We develop a formalism for mapping the exact dynamics of an ensemble of disordered quantum systems onto the dynamics of a single particle propagating along a semi-infinite lattice. This mapping provides a geometric interpretation on the loss of coherence when averaging over the ensemble and allows computation of the exact dynamics of the entire disordered ensemble in a single simulation.
  arXiv  Detail & Related papers  (2024-06-25T18:13:38Z)
• Spread complexity in saddle-dominated scrambling [0.0]
  We study the spread complexity of the thermofield double state within emphintegrable systems that exhibit saddle-dominated scrambling. Applying the Lanczos algorithm, our numerical investigation reveals that the spread complexity in these systems exhibits features reminiscent of emphchaotic systems.
  arXiv  Detail & Related papers  (2023-12-19T20:41:14Z)
• Spectral chaos bounds from scaling theory of maximally efficient quantum-dynamical scrambling [44.99833362998488]
  A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient.<n>We develop a single- parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics.<n>We establish that scaling predictions are matched by a privileged process and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all time scales.
  arXiv  Detail & Related papers  (2023-10-17T15:41:50Z)
• Krylov Localization and suppression of complexity [0.0]
  We investigate Krylov complexity for the case of interacting integrable models at finite size. We find that complexity saturation is suppressed as compared to chaotic systems. We demonstrate this behavior for an interacting integrable model, the XXZ spin chain.
  arXiv  Detail & Related papers  (2021-12-22T18:45:32Z)
• Understanding Double Descent Requires a Fine-Grained Bias-Variance Decomposition [34.235007566913396]
  We describe an interpretable, symmetric decomposition of the variance into terms associated with the labels. We find that the bias decreases monotonically with the network width, but the variance terms exhibit non-monotonic behavior. We also analyze the strikingly rich phenomenology that arises.
  arXiv  Detail & Related papers  (2020-11-04T21:04:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.