arXiv:1402.5674hep-th
Computational Complexity and Black Hole Horizons
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.
So, is there a physical effect that cares about computational complexity? Or a phenomenon in which it matters that we can simulate it in "only" O(n^100), not O(2^n)? Firewalls[1,2], for starters. [1] http://arxiv.org/abs/1301.4504v4 [2] http://arxiv.org/abs/1402.5674
gone35View on HNParent context