REVIEW 2 cited by
Late-Time Saturation of Black Hole Complexity
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
Signed reviews
abstract
The holographic complexity of a static spherically symmetric black hole, defined as the volume of an extremal surface, grows linearly with time at late times in general relativity. The growth comes from a region at a constant transverse area inside the black hole and continues forever in the classical theory. In this region the volume complexity of any spherically symmetric black hole in $d+1$ spacetime dimensions reduces to a geodesic length in an effective two-dimensional JT-gravity theory. The length in JT-gravity has been argued to saturate at very late times via non-perturbative corrections obtained from a random matrix description of the gravity theory. The same argument, applied to our effective JT-gravity description of the volume complexity, leads to complexity saturation at times of exponential order in the Bekenstein-Hawking entropy of a $d+1$-dimensional black hole. Along the way, we explore a simple toy model for complexity growth, based on a discretisation of Nielsen complexity geometry, that can be analytically shown to exhibit the expected late-time complexity saturation.
Forward citations
Cited by 2 Pith papers
-
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.
-
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). Continue with ORCID to comment.