Abstract:
It has often been speculated that the black hole interior in holography
has high computational complexity in the dual CFT. I will argue that
operators in the black hole interior are simple whenever they lie
outside of the outermost (quantum) extremal surface. That is, that
non-minimal quantum extremal surfaces are the only source of high
complexity in AdS/CFT. This is the converse of the so-called Python's
lunch conjecture, which proposes that operators with support behind the
outermost quantum extremal surface - e.g. Hawking partners - are highly
complex.
