The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Addendum to computational complexity and black hole horizons
Open accessAbstract
In this addendum to [arXiv:1402.5674] two points are discussed. In the first additional evidence is provided for a dual connection between the geometric length of an Einstein‐Rosen bridge and the computational complexity of the quantum state of the dual CFT's. The relation between growth of complexity and Page's “Extreme Cosmic Censorship” principle is also remarked on. The second point involves a gedanken experiment in which Alice measures a complete set of commuting observables at her end of an Einstein‐Rosen bridge is discussed. An apparent paradox is resolved by appealing to the properties of GHZ tripartite entanglement.
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.
Integrity signals
Registry
Cites
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.
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
Ryu, S., & Takayanagi, T. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.181602 · Cited by 4,302
Black holes and the butterfly effect
Shenker, S. H., & Stanford, D. (2014) · Journal of High Energy Physics · doi:10.1007/jhep03(2014)067 · Cited by 1,533
Computational complexity and black hole horizons
Susskind, L. (2016) · Fortschritte der Physik · doi:10.1002/prop.201500092 · Cited by 767
Self-citationTime 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
Multiverse interpretation of quantum mechanics
Raphael Bousso, A., & Susskind, L. (2012) · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · doi:10.1103/physrevd.85.045007 · Cited by 155
Self-citationExcluding black hole firewalls with extreme cosmic censorship
Page, D. N. (2014) · Journal of Cosmology and Astroparticle Physics · doi:10.1088/1475-7516/2014/06/051 · Cited by 63
Computational Complexity and Black Hole HorizonsPreprint
Susskind, L. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.5674 · Cited by 23
Self-citation
Cited by
Holographic Complexity Equals Bulk Action?
Brown, A. R., Roberts, D. A., Susskind, L., Swingle, B., & Zhao, Y. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.191301 · Cited by 852
Self-citationComplexity, action, and black holes
Brown, A. R., Roberts, D. A., Susskind, L., Swingle, B., & Zhao, Y. (2016) · Physical Review D · doi:10.1103/physrevd.93.086006 · Cited by 640
Self-citationChaos and complexity by design
Roberts, D. A., & Yoshida, B. (2017) · Journal of High Energy Physics · doi:10.1007/jhep04(2017)121 · Cited by 455
Second law of quantum complexity
Brown, A. R., & Susskind, L. (2018) · Physical Review D · doi:10.1103/physrevd.97.086015 · Cited by 292
Self-citationComments on holographic complexity
Carmi, D., Myers, R. C., & Rath, P. (2017) · Journal of High Energy Physics · doi:10.1007/jhep03(2017)118 · Cited by 292
Metadata
- Authors
- Susskind, L.
- Venue
- Fortschritte der Physik
- Publisher
- Wiley
- Published
- 2016-01
- Volume
- 64
- Issue
- 1
- Pages
- 44-48
- ISSN
- 0015-8208 (ISSN-L)
- 1521-3978
- OpenAlex
- W1841071106
- Cited by
- 324
- References
- 7
- FWCI
- 25.08
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Addendum to computational complexity and black hole horizons. https://app.cochat.ai/papers/10.1002/prop.201500093
- The paper
- Susskind, L. (2016). Addendum to computational complexity and black hole horizons. Fortschritte der Physik. https://doi.org/10.1002/prop.201500093
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.
