REVIEW 10 cited by
On The Evolution Of Operator Complexity Beyond Scrambling
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 operator complexity on various time scales with emphasis on those much larger than the scrambling period. We use, for systems with a large but finite number of degrees of freedom, the notion of K-complexity employed in arXiv:1812.08657 for infinite systems. We present evidence that K-complexity of ETH operators has indeed the character associated with the bulk time evolution of extremal volumes and actions. Namely, after a period of exponential growth during the scrambling period the K-complexity increases only linearly with time for exponentially long times in terms of the entropy, and it eventually saturates at a constant value also exponential in terms of the entropy. This constant value depends on the Hamiltonian and the operator but not on any extrinsic tolerance parameter. Thus K-complexity deserves to be an entry in the AdS/CFT dictionary. Invoking a concept of K-entropy and some numerical examples we also discuss the extent to which the long period of linear complexity growth entails an efficient randomization of operators.
Forward citations
Cited by 10 Pith papers
-
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.
-
The Normalised Wigner Negativity Rate as a Second-Moment Probe of Infall in AdS$_3$
Normalized Krylov-Wigner negativity rate matches Krylov variance growth and equals tidal stretch rate R ∝ C P_ρ if and only if Δ=1 in AdS3.
-
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.
-
De Sitter Complexity Grows Linearly in the Static Patch
Timelike extremal volume in the de Sitter static patch gives a holographic complexity that grows linearly with time and is proportional to horizon entropy times temperature.
-
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 ...
Discussion (0). Sign in to comment.