REVIEW 12 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
Krylov complexity in quantum field theory, and beyond
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 12 Pith papers
-
Holographic Krylov Complexity for Charged, Composite and Extended Probes
Holographic Krylov complexity for charged composite and extended probes retains universal leading large-time growth but acquires structure-dependent subleading corrections.
-
Towards a Refinement of Krylov Complexity: Scrambling, Classical Operator Growth and Replicas
LogK complexity via replicas distinguishes genuine scrambling from saddle effects in quantum and classical systems and refines the measure for integrable cases.
-
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.
-
Controlled Chaos in 4D SCFTs
Orbifolds of N=4 SYM produce SCFTs whose dilatation operator in a subsector is realized by a tunable spin chain whose eigenvalue statistics exhibit chaos for specific marginal couplings.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
Complexity and Operator Growth in Holographic 6d SCFTs
In holographic 6d N=(1,0) SCFTs, generalized proper momentum of infalling particles grows linearly at late times, with early dynamics modified by SU(2)_R charge and quiver spreading.
-
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...
-
Random matrix theory signatures in free field theory
In finite-volume massive free scalar field theory after local quench, spacing ratios of two-point function extrema follow GOE statistics and an extrema-based form factor shows RMT dip-ramp-plateau.
-
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 ...
-
Krylov Complexity in Periodically Driven CFTs and Critical Fermions
Arnoldi coefficients approach unity exponentially in heating phases of driven CFTs but oscillate in non-heating phases; lattice realizations show distinct spectral and graph signatures despite similar CFT Krylov growth.
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.