Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 428

The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.

Towards the fast scrambling conjecture

Open access
Lashkari, Nima, Stanford, Douglas, Hastings, Matthew, Osborne, Tobias, Hayden, Patrick·2013·Journal of High Energy Physics
DOI 10.1007/jhep04(2013)022
Open this paper in CoChat — free account

Abstract

Many proposed quantum mechanical models of black holes include highly non-local interactions. The time required for thermalization to occur in such models should reflect the relaxation times associated with classical black holes in general relativity. Moreover, the time required for a particularly strong form of thermalization to occur, sometimes known as scrambling, determines the time scale on which black holes should start to release information. It has been conjectured that black holes scramble in a time logarithmic in their entropy, and that no system in nature can scramble faster. In this article, we address the conjecture from two directions. First, we exhibit two examples of systems that do indeed scramble in logarithmic time: Brownian quantum circuits and the antiferromagnetic Ising model on a sparse random graph. Unfortunately, both fail to be truly ideal fast scramblers for reasons we discuss. Second, we use Lieb-Robinson techniques to prove a logarithmic lower bound on the scrambling time of systems with finite norm terms in their Hamiltonian. The bound holds in spite of any nonlocal structure in the Hamiltonian, which might permit every degree of freedom to interact directly with every other one.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/jhep04(2013)022

Cites

14 of 14 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 14 references

Cited by

See all 428

Metadata

Authors
Lashkari, N., Stanford, D., Hastings, M., Osborne, T., & Hayden, P.
Venue
Journal of High Energy Physics
Publisher
Springer Science and Business Media LLC
Published
2013-04
Volume
2013
Issue
4
ISSN
1029-8479 (ISSN-L)
DOI
10.1007/jhep04(2013)022
OpenAlex
W2137001571
Cited by
428
References
14
FWCI
8.51
Type
journal article
Language
en
Open access
green

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: Towards the fast scrambling conjecture. https://app.cochat.ai/papers/10.1007/jhep04(2013)022
The paper
Lashkari, N., Stanford, D., Hastings, M., Osborne, T., & Hayden, P. (2013). Towards the fast scrambling conjecture. Journal of High Energy Physics. https://doi.org/10.1007/jhep04(2013)022

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.