REVIEW 11 cited by
Operator complexity: a journey to the edge of Krylov space
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
abstract
Heisenberg time evolution under a chaotic many-body Hamiltonian $H$ transforms an initially simple operator into an increasingly complex one, as it spreads over Hilbert space. Krylov complexity, or `K-complexity', quantifies this growth with respect to a special basis, generated by $H$ by successive nested commutators with the operator. In this work we study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time $t_s>\log (S)$. We prove rigorous bounds on K-complexity as well as the associated Lanczos sequence and, using refined parallelized algorithms, we undertake a detailed numerical study of these quantities in the SYK$_4$ model, which is maximally chaotic, and compare the results with the SYK$_2$ model, which is integrable. While the former saturates the bound, the latter stays exponentially below it. We discuss to what extent this is a generic feature distinguishing between chaotic vs. integrable systems.
Forward citations
Cited by 11 Pith papers
-
Large deviations in quantum dynamics and complexity
In chaotic quantum dynamics, large-deviation distributions equilibrate on O(1), e^N, and exp(e^N) time scales depending on the definition, and the slowly drifting cutoffs provide a proposed measure of quantum complexity.
-
Polynomial Initial-State Jumps and Christoffel Transforms in Krylov Complexity
Polynomial changes of the initial state in Krylov complexity are solved exactly via Christoffel transforms of the spectral measure, yielding finite-band amplitude transfer and projected-kernel complexity formulas with...
-
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.
-
Krylov complexity has it all
Krylov complexity's Taylor coefficients recursively determine all Lanczos coefficients, making it a complete descriptor of operator dynamics, with caveats for spread complexity.
-
Grand Canonical vs Canonical Krylov Complexity in Double-Scaled Complex SYK Model
In double-scaled complex SYK, grand-canonical Krylov complexity is the charge-weighted sum of canonical complexities, saturating a conjectured inequality.
-
Krylov Complexity of Supersymmetric SYK Models
In finite-size N=2 SYK, breaking supersymmetry with an irrelevant deformation pushes late-time Krylov complexity to roughly half the maximal Krylov-space bound, while a mass deformation leaves saturation complexity a ...
-
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...
-
Holography of K-complexity: Switchbacks and Shockwaves
Operator Krylov complexity in triple-scaled DSSYK matches JT-gravity geodesic lengths with shockwaves and exhibits the switchback effect when the Lanczos algorithm is perturbed by two-sided operator insertions.
-
Complexity of PXP scars revisited
In the PXP model, the arch in the Lanczos coefficients is traced to a linear sl(3) part of the Hamiltonian, and the arch width is proposed as a signal distinguishing scarred from thermalizing states.
-
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 ...
-
Quasinormal modes and complexity in saddle-dominated SU(N) spin systems
A family of SU(2) and SU(3) Lipkin-Meshkov-Glick-type Hamiltonians reproduces de Sitter quasinormal-mode densities of states, and late-time probes reveal integrability beneath saddle-dominated scrambling.
Discussion (0). Sign in to comment.