Computational Complexity and Black Hole Horizons
Leonard Susskind
TL;DR
This paper posits a duality between gravitational geometry near black hole horizons and quantum computational complexity, linking horizon distance to complexity and interpreting the ER=EPR bridge as a conduit governed by scrambling dynamics. It models black-hole microstates as fast-scrambling qubit circuits, derives how precursor complexity grows and signals propagate through the ERB, and uses the layered stretched horizon to connect spatial distance with the complexity per qubit. The analysis shows that creating firewalls requires extremely high, finely-tuned complexity, making such events unlikely for black holes formed by collapse or for typical two-sided AdS setups, though recurrences and evaporating dynamics can alter this picture. Overall, the work highlights a deep interplay between gravity, entanglement, and computational complexity, offering a framework to study interior reconstruction and sub-planckian physics with potential broader implications for holography and quantum chaos.
Abstract
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.
