From phase space to Krylov space, one shell at a time

• URL: http://arxiv.org/abs/2607.12585v1
• Date: Tue, 14 Jul 2026 09:54:05 GMT
• Title: From phase space to Krylov space, one shell at a time
• Abstract summary: We develop and study the classical Lanczos algorithm allowing us to define Krylov complexity.<n>We show, using general methods of quantum mechanics in phase space, that the $hbar to 0$ limit of the usual quantum mechanical Krylov framework smoothly goes over into the classical one.<n>In theories with well-defined semiclassical limits, we show that classical Krylov complexity accurately approximates quantum complexity at early enough times.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In this work, we develop and study the classical Lanczos algorithm allowing us to define Krylov complexity using the symplectic structure of phase space: Poisson brackets take on the role of the quantum commutators and phase-space integrals furnish the inner product needed to define the Lanczos recursion. We show, using general methods of quantum mechanics in phase space, that the $\hbar \to 0$ limit of the usual quantum mechanical Krylov framework smoothly goes over into the classical one. In theories with well-defined semiclassical limits, we show that classical Krylov complexity accurately approximates quantum complexity at early enough times, and thus is a useful characteristic of early-time chaotic dynamics. We define a Krylov-Ehrenfest time, which quantifies the eventual divergence of classical and quantum complexities, corresponding to a characteristic depth of the Krylov chain, $n\sim n_*(\hbar)$, which in the time domain translates to the well-known scale, $t_*\simλ_K^{-1}\log(1/\hbar)$, in generic chaotic systems. We additionally define microcanonical Krylov complexities, both in the classical and quantum setting, which allows one a fine-grained study of complexity, energy shell by energy shell. We apply this framework to the Lipkin-Meshkov-Glick (LMG) and Feingold-Peres (FP) models, which are collective spin systems known to classicalize in the thermodynamic limit. In particular, while the FP model features spectral chaos for some range of coupling values, the LMG model is known to exhibit early-time saddle-dominated scrambling. Our analysis shows that the instability in LMG is resolved by the microcanonical Krylov complexity, which is controlled by the integrable structure of the Hamiltonian in spectral windows away from the instability, both at early and late times.

Related papers

• A rigorous quasipolynomial-time classical algorithm for SYK thermal expectations [51.660331450043806]
  Estimating local observables in Gibbs states is a central problem in quantum simulation.<n>We give a proof of a quasipolynomial-time classical algorithm that estimates SYK local thermal expectations at sufficiently high constant temperature.<n>Our result introduces a new Wick-pair expansion that we expect to be broadly useful for quantum many-body systems.
  arXiv  Detail & Related papers  (2026-04-22T21:14:04Z)
• 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)
• SYK thermal expectations are classically easy at any temperature [49.788604174558564]
  We give a simple classical algorithm that approximates thermal expectations.<n>We show it has quasi-polynomial cost $nO(log n/)$ for all temperatures above a phase transition in the free energy.
  arXiv  Detail & Related papers  (2026-02-26T04:48:32Z)
• Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity [0.0]
  We study the relationship between quantum random walks on graphs and Krylov/spread complexity.<n>We show that the latter's definition naturally emerges through a canonical method of reducing a graph to a chain.<n>We use this identification to construct families of graphs corresponding to special classes of systems with known complexity features.
  arXiv  Detail & Related papers  (2026-02-04T19:00:00Z)
• Krylov Complexity in Canonical Quantum Cosmology [1.0195618602298682]
  We explore Krylov complexity for two exactly solvable models, one in the Wheeler-DeWitt (WDW) quantum cosmology and another in loop quantum cosmology (LQC)<n>We construct the Krylov basis analytically by applying the Lanczos algorithm and evaluate both the Krylov state and operator complexity.<n>Our work paves the way for computing Krylov complexity in more intricate quantum cosmological models, including those exhibiting phenomena such as quantum chaos.
  arXiv  Detail & Related papers  (2025-11-21T19:02:44Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Krylov Complexity for Open Quantum System: Dissipation and Decoherence [0.14337588659482522]
  We investigate Krylov complexity in open quantum systems using Lindblad master equations for bosonic bath models.<n>We find that Krylov complexity saturates in the full system and reproduces the expected dissipative behavior when the decoherence term is suppressed.<n>However, Krylov complexity appears insensitive to the onset of decoherence, as no clear distinctive signature is observed.
  arXiv  Detail & Related papers  (2025-09-18T10:12:01Z)
• Constructive interference at the edge of quantum ergodic dynamics [116.94795372054381]
  We characterize ergodic dynamics using the second-order out-of-time-order correlators, OTOC$(2)$.<n>In contrast to dynamics without time reversal, OTOC$(2)$ are observed to remain sensitive to the underlying dynamics at long time scales.
  arXiv  Detail & Related papers  (2025-06-11T21:29:23Z)
• Krylov complexity as an order parameter for quantum chaotic-integrable transitions [0.0]
  Krylov complexity has emerged as a new paradigm to characterize quantum chaos in many-body systems.<n>Recent insights have revealed that in quantum chaotic systems Krylov state complexity exhibits a distinct peak during time evolution.<n>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.
  arXiv  Detail & Related papers  (2024-07-24T07:32:27Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Krylov complexity in quantum field theory, and beyond [41.99844472131922]
  We study Krylov complexity in various models of quantum field theory.<n>We find that the exponential growth of Krylov complexity satisfies the conjectural inequality, which generalizes the Maldacena-Shenker-Stanford bound on chaos.
  arXiv  Detail & Related papers  (2022-12-29T19:00:00Z)
• Entanglement dynamics of spins using a few complex trajectories [77.34726150561087]
  We consider two spins initially prepared in a product of coherent states and study their entanglement dynamics. We adopt an approach that allowed the derivation of a semiclassical formula for the linear entropy of the reduced density operator.
  arXiv  Detail & Related papers  (2021-08-13T01:44:24Z)

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.