The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
On the evolution of operator complexity beyond scrambling
Open accessAbstract
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 [1] 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chaos and quantum thermalization
Srednicki, M. (1994) · Physical Review E · doi:10.1103/physreve.50.888 · Cited by 3,175
Quantum statistical mechanics in a closed system
Deutsch, J. M. (1991) · Physical Review A · doi:10.1103/physreva.43.2046 · Cited by 2,860
Gapless spin-fluid ground state in a random quantum Heisenberg magnet
Sachdev, S., & Ye, J. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.3339 · Cited by 1,910
Cool horizons for entangled black holes
Maldacena, J., & Susskind, L. (2013) · arXiv · doi:10.48550/arxiv.1306.0533 · Cited by 1,310
Cool horizons for entangled black holes
Maldacena, J., & Susskind, L. (2013) · Fortschritte der Physik · doi:10.1002/prop.201300020 · Cited by 1,304
Sekino, Y., & Susskind, L. (2008) · Journal of High Energy Physics · doi:10.1088/1126-6708/2008/10/065 · Cited by 1,112
Time evolution of entanglement entropy from black hole interiors
Hartman, T., & Maldacena, J. (2013) · Journal of High Energy Physics · doi:10.1007/jhep05(2013)014 · Cited by 761
The soft mode in the Sachdev-Ye-Kitaev model and its gravity dual
Kitaev, A., & Suh, S. J. (2018) · Journal of High Energy Physics · doi:10.1007/jhep05(2018)183 · Cited by 633
Second law of quantum complexity
Brown, A. R., & Susskind, L. (2018) · Physical Review D · doi:10.1103/physrevd.97.086015 · Cited by 292 · cited 1×
“Quantum complexity has been proposed as a new entry in the holographic dictionary (see for instance [2, 3] and references therein).”
BackgroundA semiclassical ramp in SYK and in gravity
Saad, P., Shenker, S. H., & Stanford, D. (2018) · arXiv · doi:10.48550/arxiv.1806.06840 · Cited by 208
Metadata
- Authors
- Barbón, J. L. F., Rabinovici, E., Shir, R., & Sinha, R.
- Venue
- Journal of High Energy Physics
- Published
- 2019-10
- Volume
- 2019
- Issue
- 10
- ISSN
- 1029-8479 (ISSN-L)
- OpenAlex
- W2960588259
- Cited by
- 177
- References
- 11
- FWCI
- 5.38
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the evolution of operator complexity beyond scrambling. https://app.cochat.ai/papers/10.1007/jhep10(2019)264
- The paper
- Barbón, J. L. F., Rabinovici, E., Shir, R., & Sinha, R. (2019). On the evolution of operator complexity beyond scrambling. Journal of High Energy Physics. https://doi.org/10.1007/jhep10(2019)264
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.