The black hole interior from non-isometric codes and complexity
Chris Akers, Netta Engelhardt, Daniel Harlow, Geoff Penington, Shreya Vardhan
TL;DR
This work proposes that black hole interiors can be realized through non-isometric holographic codes protected by computational complexity, reconciling the apparent abundance of interior degrees of freedom with a finite fundamental Hilbert space. By integrating measure concentration, Weingarten calculus, and quantum extremal surface ideas, the authors construct soluble models in which sub-exponential observables preserve inner products and allow state-specific reconstructions of interior operators in a manner consistent with entanglement wedge reconstruction. The dynamical versions of the model reproduce the Page curve and Hayden–Preskill scrambling, while coarse-graining via simple entropy and Python’s lunch concepts provides a geometric and complexity-theoretic picture of what interior information is accessible. The framework harmonizes unitary evaporation, island formation, and interior measurements within a non-local holographic map, offering a coherent alternative to traditional isometric encodings and highlighting the role of complexity in gravitational effective field theory’s validity. Overall, the paper advances a concrete, calculable route to understanding black hole interior emergence and information transfer without relying on Euclidean gravity alone.
Abstract
Quantum error correction has given us a natural language for the emergence of spacetime, but the black hole interior poses a challenge for this framework: at late times the apparent number of interior degrees of freedom in effective field theory can vastly exceed the true number of fundamental degrees of freedom, so there can be no isometric (i.e. inner-product preserving) encoding of the former into the latter. In this paper we explain how quantum error correction nonetheless can be used to explain the emergence of the black hole interior, via the idea of "non-isometric codes protected by computational complexity". We show that many previous ideas, such as the existence of a large number of "null states", a breakdown of effective field theory for operations of exponential complexity, the quantum extremal surface calculation of the Page curve, post-selection, "state-dependent/state-specific" operator reconstruction, and the "simple entropy" approach to complexity coarse-graining, all fit naturally into this framework, and we illustrate all of these phenomena simultaneously in a soluble model.
