Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1311.7379

Butterflies on the Stretched Horizon

Leonard Susskind

Published Nov 28, 2013• 42 citations
arXivHTMLPDF

Abstract

In this paper I return to the question of what kind of perturbations on Alice's side of an Einstein-Rosen bridge can send messages to Bob as he enters the horizon at the other end. By definition "easy" operators do not activate messages and "hard" operators do, but there are no clear criteria to identify the difference between easy and hard. In this paper I argue that the difference is related to the time evolution of a certain measure of computational complexity, associated with the stretched horizon of Alice's black hole. The arguments suggest that the AMPSS commutator argument is more connected with butterflies than with firewalls.

DOI
10.48550/arxiv.1311.7379

Related papers

Addendum to computational complexity and black hole horizons

Leonard Susskind

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.

arXiv:1403.5695•Fortschritte der Physik•Jan 1, 2016•569 citations

Entanglement of Local Operators and the Butterfly Effect

Mao Tian Tan, Jonah Kudler-Flam, Masahiro Nozaki A +1 more

Bulletin of the American Physical Society•Mar 19, 2021•0 citations

A Bottom-Up Approach to Black Hole Microstates

Vaibhav Burman, Chethan Krishnan

In arXiv:2312.14108, we argued that a sliver at the black hole mass in the Hilbert space of a quantum field theory on an AdS black hole with a stretched horizon, has many desirable features of black hole microstates. A key observation is that the stretched horizon requires a finite Planck length, i.e., finite-$N$. Therefore it is best viewed as a ``quantum horizon" -- a proxy for the UV-complete bulk description, and not directly an element in the bulk EFT. It was shown in arXiv:2312.14108 that despite the manifest absence of the interior, the 2-point function in the sliver is indistinguishable from the smooth horizon correlator, up to the Page time. In this paper, instead of boundary correlators, we work directly in the bulk, and demonstrate the appearance of the bulk Hartle-Hawking correlator in the large-$N$ limit. This is instructive because it shows that the analytic continuation across the horizon is emergent. It is a $bulk$ transition to a Type III algebra and provides a structural distinction between black holes and weakly coupled thermal systems. We also identify a mechanism for universal code subspaces and interior tensor factors to appear via a quantum horizon version of thermal factorization. Our claims apply directly only within a ``Page window", so they are not in immediate tension with firewall arguments. During a Page window, typical heavy microstates probed by light single trace operators respond with effectively smooth horizons in low-point correlators. We work in 2+1 dimensions to be concrete, but expect our results to hold in all higher dimensions. We discuss some important differences between our approach and the conventional fuzzball program, and also argue that probe-notions (like infalling boundary conditions) must be distinguished from microstate-notions (like size of the Einstein-Rosen bridge) to make meaningful statements about post-Page smoothness.

arXiv:2409.05850•Sep 9, 2024•19 citations

Computational complexity and black hole horizons

Leonard Susskind

Computational complexity is essential to understanding the properties of black hole horizons. The problem of Alice creating a firewall behind the horizon of Bob's black hole is a problem of computational complexity. In general we find that while creating firewalls is possible, it is extremely difficult and probably impossible for black holes that form in sudden collapse, and then evaporate. On the other hand if the radiation is bottled up then after an exponentially long period of time firewalls may be common. It is possible that gravity will provide tools to study problems of complexity; especially the range of complexity between scrambling and exponential complexity.

arXiv:1402.5674•Fortschritte der Physik•Jan 1, 2016•880 citations

Stochastic Quantum Foundations of Pulled Front Propagation: Non-Hermitian Topology, Fluctuations, and Entanglement Scaling in the Quantized Fisher-KPP Equation

Isamu Ohnishi

•Jan 1, 2026•0 citations

Alice through the event horizon: fermionic vs bosonic entanglement

Eduardo Martín-Martínez, Juan León

arXiv:1001.4302•Jan 25, 2010•0 citations
In this paper I return to the question of what kind of perturbations on Alice's side of an Einstein-Rosen bridge can send messages to Bob as he enters the horizon at the other end. By definition "easy" operators do not activate messages and "hard" operators do, but there are no clear criteria to identify the difference between easy and hard. In this paper I argue that the difference is related to the time evolution of a certain measure of computational complexity, associated with the stretched horizon of Alice's black hole. The arguments suggest that the AMPSS commutator argument is more connected with butterflies than with firewalls.
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.
In arXiv:2312.14108, we argued that a sliver at the black hole mass in the Hilbert space of a quantum field theory on an AdS black hole with a stretched horizon, has many desirable features of black hole microstates. A key observation is that the stretched horizon requires a finite Planck length, i.e., finite-NNN. Therefore it is best viewed as a ``quantum horizon" -- a proxy for the UV-complete bulk description, and not directly an element in the bulk EFT. It was shown in arXiv:2312.14108 that despite the manifest absence of the interior, the 2-point function in the sliver is indistinguishable from the smooth horizon correlator, up to the Page time. In this paper, instead of boundary correlators, we work directly in the bulk, and demonstrate the appearance of the bulk Hartle-Hawking correlator in the large-NNN limit. This is instructive because it shows that the analytic continuation across the horizon is emergent. It is a bulkbulkbulk transition to a Type III algebra and provides a structural distinction between black holes and weakly coupled thermal systems. We also identify a mechanism for universal code subspaces and interior tensor factors to appear via a quantum horizon version of thermal factorization. Our claims apply directly only within a ``Page window", so they are not in immediate tension with firewall arguments. During a Page window, typical heavy microstates probed by light single trace operators respond with effectively smooth horizons in low-point correlators. We work in 2+1 dimensions to be concrete, but expect our results to hold in all higher dimensions. We discuss some important differences between our approach and the conventional fuzzball program, and also argue that probe-notions (like infalling boundary conditions) must be distinguished from microstate-notions (like size of the Einstein-Rosen bridge) to make meaningful statements about post-Page smoothness.
Computational complexity is essential to understanding the properties of black hole horizons. The problem of Alice creating a firewall behind the horizon of Bob's black hole is a problem of computational complexity. In general we find that while creating firewalls is possible, it is extremely difficult and probably impossible for black holes that form in sudden collapse, and then evaporate. On the other hand if the radiation is bottled up then after an exponentially long period of time firewalls may be common. It is possible that gravity will provide tools to study problems of complexity; especially the range of complexity between scrambling and exponential complexity.