We study the complexity of Hawking radiation for an evaporating black hole from the perspective of the stabilizer theory of quantum computation. Specifically, we calculate Wigner negativity—a magic monotone that can be interpreted as a measure of the stabilizer complexity, or equivalently, the complexity of classical simulation—in various toy models for evaporating black holes. We first calculate the Wigner negativity of Hawking radiation in the Penington-Shenker-Stanford-Yang (PSSY) model directly using the gravitational path integral, and show that the negativity is O ( 1 ) before the Page transition, but becomes exponentially large past the Page transition. We also derive a universal, information theoretic formula for the negativity that interpolates between the two extremes. We then study the Wigner negativity of radiation in a dynamical model of black hole evaporation. In this case, the negativity shows a sharp spike at early times resulting from the coupling between the black hole and the radiation system, but at late times when the system settles down, we find that the negativity satisfies the same universal formula as in the PSSY model. Finally, we also propose a geometric formula for Wigner negativity in general holographic states using intuition from fixed area states and random tensor networks, and argue that a python’s lunch in the entanglement wedge implies a stabilizer complexity that is exponentially large in 1 8 G N times the difference between the areas corresponding to the outermost and minimal extremal surfaces.
Abstract We show that bulk operators lying between the outermost extremal surface and the asymptotic boundary admit a simple boundary reconstruction in the classical limit. This is the converse of the Python’s lunch conjecture, which proposes that operators with support between the minimal and outermost (quantum) extremal surfaces—e.g. the interior Hawking partners—are highly complex. Our procedure for reconstructing this ‘simple wedge’ is based on the HKLL construction, but uses causal bulk propagation of perturbed boundary conditions on Lorentzian timefolds to expand the causal wedge as far as the outermost extremal surface. As a corollary, we establish the Simple Entropy proposal for the holographic dual of the area of a marginally trapped surface as well as a similar holographic dual for the outermost extremal surface. We find that the simple wedge is dual to a particular coarse-grained CFT state, obtained via averaging over all possible Python’s lunches. An efficient quantum circuit converts this coarse-grained state into a ‘simple state’ that is indistinguishable in finite time from a state with a local modular Hamiltonian. Under certain circumstances, the simple state modular Hamiltonian generates an exactly local flow; we interpret this result as a holographic dual of black hole uniqueness.
A bstract Within the AdS/CFT correspondence, computational complexity for reduced density matrices of holographic conformal field theories has been conjectured to be related to certain geometric observables in the dual gravity theory. We study this conjecture from both the gravity and field theory point of view. Specifically, we consider a measure of complexity associated to the Bures metric on the space of density matrices. We compute this complexity measure for mixed states associated to single intervals in descendant states of the vacuum in 2d CFTs. Moreover, we derive from first principles a geometric observable dual to the Bures metric which is localized in the entanglement wedge of the AdS spacetime associated to the quantum circuit on the boundary. Finally, we compare the Bures metric complexity measure with holographic subregion complexity within the “complexity=volume” paradigm for perturbatively small transformations of the vacuum. While there is no exact agreement between these two quantities, we find striking similarities as we vary the target state and interval size, suggesting that these quantities are closely related.
The `quantum gravity in the lab' paradigm suggests that quantum computers might shed light on quantum gravity by simulating the CFT side of the AdS/CFT correspondence and mapping the results to the AdS side. This relies on the assumption that the duality map (the `dictionary') is efficient to compute. In this work, we show that the complexity of the AdS/CFT dictionary is surprisingly subtle: there might be cases in which one can efficiently apply operators to the CFT state (a task we call 'operator reconstruction') without being able to extract basic properties of the dual bulk state such as its geometry (which we call 'geometry reconstruction'). Geometry reconstruction corresponds to the setting where we want to extract properties of a completely unknown bulk dual from a simulated CFT boundary state. We demonstrate that geometry reconstruction may be generically hard due to the connection between geometry and entanglement in holography. In particular we construct ensembles of states whose entanglement approximately obey the Ryu-Takayanagi formula for arbitrary geometries, but which are nevertheless computationally indistinguishable. This suggests that even for states with the special entanglement structure of holographic CFT states, geometry reconstruction might be hard. This result should be compared with existing evidence that operator reconstruction is generically easy in AdS/CFT. A useful analogy for the difference between these two tasks is quantum fully homomorphic encryption (FHE): this encrypts quantum states in such a way that no efficient adversary can learn properties of the state, but operators can be applied efficiently to the encrypted state. We show that quantum FHE can separate the complexity of geometry reconstruction vs operator reconstruction, which raises the question whether FHE could be a useful lens through which to view AdS/CFT.
In the AdS/CFT correspondence, a subregion of the CFT allows for the recovery of a corresponding subregion of the bulk known as its entanglement wedge. In some cases, an entanglement wedge contains a locally but not globally minimal surface homologous to the CFT subregion, in which case it is said to contain a python’s lunch. It has been proposed that python’s lunch geometries should be modelled by tensor networks that feature projective operations where the wedge narrows. This model leads to the python’s lunch (PL) conjecture, which asserts that reconstructing information from past the locally minimal surface is computationally difficult. In this work, we use cryptographic tools related to a primitive known as the Conditional Disclosure of Secrets (CDS) to develop consequences of the projective tensor network model that can be checked directly in AdS/CFT. We argue from the tensor network picture that the mutual information between appropriate CFT subregions is lower bounded linearly by an area difference associated with the geometry of the lunch. Recalling that the mutual information is also computed by bulk extremal surfaces, this gives a checkable geometrical consequence of the tensor network model. We prove weakened versions of this geometrical statement in asymptotically AdS _{2+1} 2 + 1 spacetimes satisfying the null energy condition, and confirm it in some example geometries, supporting the tensor network model and by proxy the PL conjecture.
The Wigner function, in general, takes on negative values, and the amount of negativity in the Wigner function gives an operationally meaningful measure of the complexity of simulating the quantum state on a classical computer. In this paper, we study the growth of Wigner negativity of the Hartle-Hawking state of Jackiw-Teitelboim gravity under time evolution. We work in the gravitational length basis, at genus zero, and at high temperature,
β≪1. Our main analytic result is simple: to leading order in
β the state is a Gaussian wavepacket of minimum uncertainty, sitting at rest at the turning point of the Liouville wall. Its Wigner function is therefore positive, and the negativity is
1+δ(β,t), where the correction
δ is smaller than any power of
β. We show that
δ is an even function of time, so there is no linear growth at
t=0, and that once the packet has reflected off the wall its leading-order evolution is a Clifford shear, which cannot change the negativity. We also numerically study the time evolution of the Wigner function and its negativity. We observe that
δ stays below
10−11 at
t=0 and through the reflection, then rises slowly over a few tens of
β/π, and then approaches a late-time value consistent with
δ∞(β)≃0.08e−4.4/β for
0.25≤β≤1: the lower the temperature, the larger the late-time negativity. The exact survival amplitude
Z(β+it)/Z(β) fixes the spread complexity to order
t4, and it also fixes the seed-normalised Wigner diagnostic of our earlier work (arXiv:2607.04065, arXiv:2607.17346). We take this as evidence that the length basis is ideally suited for a dual, semi-classical description of the dynamics at genus zero. Beyond genus zero the length basis is overcomplete, and we make no statement about finite
eS0.