REVIEW 8 cited by
Krylov complexity in quantum field theory, and beyond
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study Krylov complexity in various models of quantum field theory: free massive bosons and fermions on flat space and on spheres, holographic models, and lattice models with the UV-cutoff. In certain cases we find asymptotic behavior of Lanczos coefficients, which goes beyond previously observed universality. We confirm that in all cases the exponential growth of Krylov complexity satisfies the conjectural inequality, which generalizes the Maldacena-Shenker-Stanford bound on chaos. We discuss temperature dependence of Lanczos coefficients and note that the relation between the growth of Lanczos coefficients and chaos may only hold for the sufficiently late, truly asymptotic regime governed by the physics at the UV cutoff. Contrary to previous suggestions, we show scenarios when Krylov complexity in quantum field theory behaves qualitatively differently from the holographic complexity.
Forward citations
Cited by 8 Pith papers
-
Holographic timelike complexity for de Sitter
Timelike subregion volume complexity in de Sitter grows exponentially early and diverges hyperfast at a maximal duration; near the SdS black hole horizon the divergence is replaced by slower, claimed-nonlinear growth.
-
Krylov-Space Memory Cores
Anomalous initial states in otherwise thermalizing models leave compact, stationary low-depth Krylov-space cores—regions with persistent fluctuations, Gibbs mismatch, and current activity—while generic states do not.
-
Quantum Cosmology in Krylov Space: Complexity and Entropy
In a sharply peaked Gaussian state of a flat FLRW universe with a massless scalar clock, Krylov state complexity grows as σ²(φ−φ0)²/4 and operator complexity is exactly twice that, in both Wheeler-DeWitt and loop quan...
-
Temperature dependence in Krylov space
Temperature dependence of Lanczos coefficients is governed by two decoupled Toda chains, yielding a 'Krylov bootstrap' consistency criterion and exponentially small Krylov complexity at low temperature.
-
The Information Content of Krylov Observables: A Machine Learning Approach
Under chaos, the normalized Wigner negativity χ(t) carries information about the fine return dynamics that spread complexity C(t) cannot, with the asymmetry gap rising from +0.33 to +0.77 across the integrable-to-GUE ...
-
Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity
Reducing a graph walk to distance-layers reproduces Krylov/spread complexity, yielding analytic finite-q SYK Lanczos coefficients and hypercube complexity D sin²(t/D), with faster saturation than classical-walk circuits.
-
Generalized Krylov Complexity
The paper defines generalized Krylov complexity for multi-generator unitary evolutions, computes it for U(1)xU(1), a U(1)xU(1) subgroup of SO(10), and SU(2), and introduces a weighted version.
-
Quantum complexity phase transition in fermionic quantum circuits
A measure of operator spreading, Krylov complexity, undergoes a phase transition in quantum percolation: at the percolation threshold for free fermions, but at a lower threshold p=1/4 for 1D interacting fermions.
Discussion (0). Continue with ORCID to comment.