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

SpringerBriefs in physics

Complexity and Firewalls

Leonard Susskind

Published Jan 1, 2020• 0 citations
Publisher
DOI
10.1007/978-3-030-45109-7_16

Related papers

Security Analysis

Ramona Wolf

Lecture notes in physics•Jan 1, 2021•1 citation

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

Open Systems

R. S. Ingarden, Andrzej Kossakowski, M. Ohya

Springer eBooks•Jan 1, 1997•0 citations

Notes on the firewall paradox, complexity, and quantum theory

Karl-Georg Schlesinger

We investigate what it means to apply the solution, proposed to the firewall paradox by Harlow and Hayden, to the famous quantum paradoxes of Schödinger's Cat and Wigner's Friend if ones views these as posing a thermodynamic decoding problem (as does Hawking radiation in the firewall paradox). The implications might point to a relevance of the firewall paradox for the axiomatic and set theoretic foundations underlying mathematics. We reconsider in this context the results of Benioff on the foundational challenges posed by the randomness postulate of quantum theory. A central point in our discussion is that one can mathematically not naturally distinguish between computational complexity (as central to the approach of Harlow and Hayden and further developed by Susskind) and proof theoretic complexity (since they represent the same concept on a Turing machine), with the latter being related to a finite bound on Kolmogorov entropy (due to Chaitin incompleteness).

arXiv:1412.3146•Dec 8, 2014•2 citations

Black hole firewalls and quantum mechanics *

Gerard ’t Hooft

Abstract Firewalls in black holes are easiest to understand by imposing time reversal invariance, together with a unitary evolution law. The best approach seems to be to split up the time span of a black hole into short periods, during which no firewalls can be detected by any observer. Then, gluing together subsequent time periods, firewalls seem to appear, but they can always be transformed away. At all times we need a Hilbert space of a finite dimension, as long as particles far separated from the black hole are ignored. Our conclusion contradicts other findings, as these assume that information that entered into a black hole, cannot re-emerge. But re-emergence of that information is exactly what our version of firewalls is supposed to ensure. Indeed, the firewall transformation removes the problems caused by entanglement between very early and very late in- and out-particles, in a far from trivial way.

arXiv:2401.16890•Journal of Physics A Mathematical and Theoretical•May 24, 2024•1 citation

Complexity trapped by simplicity

Francesca Ferlaino

Nature•Aug 19, 2014•2 citations
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.
We investigate what it means to apply the solution, proposed to the firewall paradox by Harlow and Hayden, to the famous quantum paradoxes of Schödinger's Cat and Wigner's Friend if ones views these as posing a thermodynamic decoding problem (as does Hawking radiation in the firewall paradox). The implications might point to a relevance of the firewall paradox for the axiomatic and set theoretic foundations underlying mathematics. We reconsider in this context the results of Benioff on the foundational challenges posed by the randomness postulate of quantum theory. A central point in our discussion is that one can mathematically not naturally distinguish between computational complexity (as central to the approach of Harlow and Hayden and further developed by Susskind) and proof theoretic complexity (since they represent the same concept on a Turing machine), with the latter being related to a finite bound on Kolmogorov entropy (due to Chaitin incompleteness).
Abstract Firewalls in black holes are easiest to understand by imposing time reversal invariance, together with a unitary evolution law. The best approach seems to be to split up the time span of a black hole into short periods, during which no firewalls can be detected by any observer. Then, gluing together subsequent time periods, firewalls seem to appear, but they can always be transformed away. At all times we need a Hilbert space of a finite dimension, as long as particles far separated from the black hole are ignored. Our conclusion contradicts other findings, as these assume that information that entered into a black hole, cannot re-emerge. But re-emergence of that information is exactly what our version of firewalls is supposed to ensure. Indeed, the firewall transformation removes the problems caused by entanglement between very early and very late in- and out-particles, in a far from trivial way.