The Python's Lunch: geometric obstructions to decoding Hawking radiation
Adam R. Brown, Hrant Gharibyan, Geoff Penington, Leonard Susskind
TL;DR
This work reconciles the mismatch between holographic complexity (volume/action) and the Harlow-Hayden result by introducing restricted complexity as the holographic quantity dual to a geometric obstruction—the Python's Lunch—in wormholes. It shows that one-sided (restricted) decoding tasks incur exponential complexity tied to the lunch's bulge, while unrestricted complexity remains polynomial, explaining when geometry mirrors complexity. The authors develop a covariant generalization using quantum extremal surfaces, analyze evaporating black holes, and extend the lunch concept to non-evaporating and classical spacetimes, arguing that the tensor-network perspective (with allowed post-selection) is essential for capturing the correct dual. They also explore post-selected state complexity, arguing that even with post-selection there exist exponentially hard states, thus refining the proposed holographic duals for complexity.
Abstract
According to Harlow and Hayden [arXiv:1301.4504] the task of distilling information out of Hawking radiation appears to be computationally hard despite the fact that the quantum state of the black hole and its radiation is relatively un-complex. We trace this computational difficulty to a geometric obstruction in the Einstein-Rosen bridge connecting the black hole and its radiation. Inspired by tensor network models, we conjecture a precise formula relating the computational hardness of distilling information to geometric properties of the wormhole - specifically to the exponential of the difference in generalized entropies between the two non-minimal quantum extremal surfaces that constitute the obstruction. Due to its shape, we call this obstruction the "Python's Lunch", in analogy to the reptile's postprandial bulge.
