REVIEW 15 cited by
The Python's Lunch: geometric obstructions to decoding Hawking radiation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The Python's Lunch: geometric obstructions to decoding Hawking radiation
read the original 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.
Forward citations
Cited by 15 Pith papers
-
Replica wormholes and the black hole interior
Replica wormhole geometries justify the replica trick computation of the Page curve in holographic black hole models and support entanglement wedge reconstruction via the Petz map.
-
Entanglement Wedge Reconstruction and the Information Paradox
A phase transition in the quantum RT surface at the Page time derives the Page curve and enables entanglement wedge reconstruction of the black hole interior from Hawking radiation.
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
Twirled perfect tensor networks are introduced as a class satisfying computational covariance, bounding complexity by the Python's Lunch Conjecture exponent, and combining holographic features of perfect and random te...
-
Fortuity and Complexity in a Simple Quark Model
In a toy qubit model of quarks, BRST cohomology designates baryons as fortuitous and mesons as monotone, with the former displaying super-exponential complexity and the latter power-law complexity in the Veneziano limit.
-
Generalized Complexity Distances and Non-Invertible Symmetries
Non-invertible symmetries define quantum gates with generalized complexity distances, and simple objects in symmetry categories turn out to be computationally complex in concrete 4D and 2D QFT examples.
-
Universal Time Evolution of Holographic and Quantum Complexity
Holographic complexity measures show universal linear growth followed by late-time saturation, proven necessary and sufficient via pole structures in the energy basis using the residue theorem, arising from random mat...
-
The mini-Page Curve in Cosmology
In 2D centaur geometries the entropy difference of a modular-conjugate Hawking-pair probe traces an inverse mini-Page curve that bottoms at τ≈β/8, marking when information begins to leave the cosmological horizon.
-
Wigner negativity in Krylov space and emergent semiclassicality
Wigner negativity in Krylov space stays O(1) or grows as t^{1/2} (without Hilbert-space scaling) in 2d CFTs, one-cut matrix models, and double-scaled SYK, indicating emergent semiclassicality.
-
Asymptotically-flat Black holes in Bumblebee gravity: Exact solutions and Thermodynamics
Exact solutions for asymptotically flat black holes in bumblebee gravity with temporal bumblebee field, analytic Y charge and X potential, and discovery of new cases including unbounded charge-mass ratio and wormhole ...
-
Pseudorandom Dynamics in the SYK Model and Cryptographic Censorship in JT Gravity
SYK disorder is shown to be an approximate unitary k-design for poly(N) k; under the planted-SYK hardness conjecture this yields gravitationally pseudorandom unitaries, implying cryptographic censorship in JT gravity ...
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
A Semiclassical Diagnostic for Spacetime Emergence
Evanescent quantum extremal surfaces, bounded in area but not generalized entropy, diagnose failures of spacetime emergence in holography.
-
Fortuity and Complexity in a Simple Quark Model
In a toy qubit model of quarks, baryons are fortuitous with exponential counting and super-exponential complexity while mesons are monotone with polynomial counting and power-law complexity.
-
Rethinking quantum information in gravity and fields
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.