REVIEW 2 cited by
Random Matrix Theory for Complexity Growth and Black Hole Interiors
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
We study a precise and computationally tractable notion of operator complexity in holographic quantum theories, including the ensemble dual of Jackiw-Teitelboim gravity and two-dimensional holographic conformal field theories. This is a refined, "microcanonical" version of K-complexity that applies to theories with infinite or continuous spectra (including quantum field theories), and in the holographic theories we study exhibits exponential growth for a scrambling time, followed by linear growth until saturation at a time exponential in the entropy $\unicode{x2014}$a behavior that is characteristic of chaos. We show that the linear growth regime implies a universal random matrix description of the operator dynamics after scrambling. Our main tool for establishing this connection is a "complexity renormalization group" framework we develop that allows us to study the effective operator dynamics for different timescales by "integrating out" large K-complexities. In the dual gravity setting, we comment on the empirical match between our version of K-complexity and the maximal volume proposal, and speculate on a connection between the universal random matrix theory dynamics of operator growth after scrambling and the spatial translation symmetry of smooth black hole interiors.
Forward citations
Cited by 2 Pith papers
-
Non-perturbative saturation of Krylov complexity, and its implications in quantum gravity
Full-spectrum Krylov complexity provably saturates at ~e^{S(E)} log(1/λ) in every low-energy state — near the energy-dependent Heisenberg time, not the maximal e^{S_max} — because discrete-spectrum orthogonal polynomi...
-
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 ...
Discussion (0). Sign in to comment.