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.
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
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 162
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 64
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 and shock wave geometries
Stanford, D., & Susskind, L. (2014) · Physical Review D · doi:10.1103/physrevd.90.126007 · Cited by 748
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-citationDiagnosing Chaos Using Four-Point Functions in Two-Dimensional Conformal Field Theory
Roberts, D. A., & Stanford, D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.131603 · Cited by 467
Chaos and complexity by design
Roberts, D. A., & Yoshida, B. (2017) · Journal of High Energy Physics · doi:10.1007/jhep04(2017)121 · Cited by 455
Circuit complexity in quantum field theory
Jefferson, R. A., & Myers, R. C. (2017) · Journal of High Energy Physics · doi:10.1007/jhep10(2017)107 · Cited by 412
Gravitational action with null boundaries
Lehner, L., Myers, R. C., Poisson, E., & Sorkin, R. D. (2016) · Physical Review D · doi:10.1103/physrevd.94.084046 · Cited by 341
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
Liouville action as path-integral complexity: from continuous tensor networks to AdS/CFT
Caputa, P., Kundu, N., Miyaji, M., Takayanagi, T., & Watanabe, K. (2017) · Journal of High Energy Physics · doi:10.1007/jhep11(2017)097 · Cited by 270
Chaos, complexity, and random matrices
Cotler, J., Hunter-Jones, N., Liu, J., & Yoshida, B. (2017) · Journal of High Energy Physics · doi:10.1007/jhep11(2017)048 · Cited by 264
On the time dependence of holographic complexity
Carmi, D., Chapman, S., Marrochio, H., Myers, R. C., & Sugishita, S. (2017) · Journal of High Energy Physics · doi:10.1007/jhep11(2017)188 · Cited by 264
Noether charge, black hole volume, and complexity
Couch, J., Fischler, W., & Nguyen, P. H. (2017) · Journal of High Energy Physics · doi:10.1007/jhep03(2017)119 · Cited by 257
The factorization problem in Jackiw-Teitelboim gravity
Harlow, D., & Jafferis, D. (2020) · Journal of High Energy Physics · doi:10.1007/jhep02(2020)177 · Cited by 227
The Python’s Lunch: geometric obstructions to decoding Hawking radiation
Brown, A. R., Gharibyan, H., Penington, G., & Susskind, L. (2020) · Journal of High Energy Physics · doi:10.1007/jhep08(2020)121 · Cited by 124
Self-citationLate Time Correlation Functions, Baby Universes, and ETH in JT Gravity
Saad, P. (2019) · arXiv · doi:10.48550/arxiv.1910.10311 · Cited by 93
Complexity of Jackiw-Teitelboim gravity
Brown, A. R., Gharibyan, H., Lin, H. W., Susskind, L., Thorlacius, L., & Zhao, Y. (2019) · Physical Review D · doi:10.1103/physrevd.99.046016 · Cited by 88
Self-citationThe ghost in the radiation: robust encodings of the black hole interior
Kim, I., Tang, E., & Preskill, J. (2020) · Journal of High Energy Physics · doi:10.1007/jhep06(2020)031 · Cited by 63
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
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.