Quantum Computation vs. Firewalls
Daniel Harlow, Patrick Hayden
TL;DR
This paper reframes the AMPS firewall paradox through the lens of quantum computational complexity, arguing that decoding the Hawking radiation required to realize the AMPS experiment is generically exponentially hard in the black hole's entropy. By analyzing quantum circuit models, error-correcting codes, and various black-hole geometries (including AdS throats), the authors show that the decoding task is unlikely to be feasible within the black hole's lifetime, undermining the operational viability of firewalls as a necessary fix. They connect these computational limits to a broader nonlocality criterion for effective field theory and explore how interior physics might be consistently described without firewalls under a single, possibly nonlocal Hilbert space, e.g., via A=R_B mappings and bulk operator constructions. The work suggests that complexity-theoretic barriers, rather than fundamental conflicts in unitarity, may prevent the AMPS scenario from being realized, with implications for black hole information, EFT validity, and holographic interpretations.
Abstract
In this paper we discuss quantum computational restrictions on the types of thought experiments recently used by Almheiri, Marolf, Polchinski, and Sully to argue against the smoothness of black hole horizons. We argue that the quantum computations required to do these experiments take a time which is exponential in the entropy of the black hole under study, and we show that for a wide variety of black holes this prevents the experiments from being done. We interpret our results as motivating a broader type of non-locality than is usually considered in the context of black hole thought experiments, and claim that once this type of non-locality is allowed there may be no need for firewalls. Our results do not threaten the unitarity of of black hole evaporation or the ability of advanced civilizations to test it.
