The DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
The Python’s Lunch: geometric obstructions to decoding Hawking radiation
Open accessAbstract
A bstract: 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures
























![Figure 26 To argue that a nonempty quantum extremal surface should exist for the pure state of a two-dimensional black hole, after measuring Hawking radiation, we consider Cauchy slices that asymptote to the maximal volume slice in the distant past, but which are allowed to vary elsewhere. In particular, we allow the slice to vary at infalling times approximately one scrambling time in the past of the current boundary time (this is where the non-empty extremal surface was found in [35, 36]). As shown in figure 25, such slices should have a local minimum in their generalized entropy near the horizon. If we vary the Cauchy slice too far into the interior of the black hole, this local minimum will become small because the area becomes small. Conversely, if we push the slice too close to the past lightcone, the bulk entropy will become very small, which will also decrease the generalized entropy. By choosing our Cauchy slice to maximize the generalized entropy of this local minima, we would necessarily find a non-empty extremal surface, in a location similar to the surface found in [35, 36].](https://figures.cochat.ai/paper-figures/a55ac64055b14f6ea1ed9d219f66938c/the-pythons-lunch-geometric-obstructions-to-decoding-hawking-radiation-figure-26.png)

Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In fact, for evaporating black holes, there is good reason to think that it is exponentially complicated [65,66].”
From Replica wormholes and the black hole interior (2022) · cites this paper as [66]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“A remarkable geometric way of capturing this complexity was proposed in [236] based on the generic existence of non-minimal extremal surfaces forming a Python-lunch geometry (sandwiched between minimal extremal surfaces or behind one of them) and interpreting this geometry in terms of tensor network constructions.”
From Holographic spacetime, black holes and quantum error correcting codes: a review (2022) · cites this paper as [236]
The cited source says what the claim attributes to it.
In the citing paper
“In all cases, the inher-ent chaos in microstate dynamics should connect the Python's lunch geometric mechanism of generating exponential complexity [236] in encoding with the pseudorandomness mechanism discussed in [258].”
From Holographic spacetime, black holes and quantum error correcting codes: a review (2022) · cites this paper as [236]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · cited 1×
“In the previous subsection we argued that we can decode Hawking radiation by projecting out m qubits, and provided a version of a Grover search [14, 15] that allows to do this”
Method(1988) · Elsevier eBooks · doi:10.1016/c2013-0-11200-7 · Cited by 5,131
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 1×
“where C TN NlogN. 4.3 Post-selection is Superpolynomial In the previous subsection we argued that we can decode Hawking radiation by projecting out mqubits, and provided a version of a Grover search [14, 15] that allows to do this projection with a unitary that has complexity p 2m. Can we rule out the possibility that…”
BackgroundInfluentialRyu, S., & Takayanagi, T. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.181602 · Cited by 4,302 · cited 1×
“However, the covariant surface that is analogous to the minimal cut through a tensor network is the HRT surface [23, 24, 25], the minimal area extremal surface homologous to one end of the wormhole.”
BackgroundA covariant holographic entanglement entropy proposal
Hubeny, V. E., Rangamani, M., & Takayanagi, T. (2007) · Journal of High Energy Physics · doi:10.1088/1126-6708/2007/07/062 · Cited by 1,822 · cited 1×
“However, the covariant surface that is analogous to the minimal cut through a tensor network is the HRT surface [23, 24, 25], the minimal area extremal surface homologous to one end of the wormhole.”
BackgroundA Covariant Holographic Entanglement Entropy Proposal
Hubeny, V. E., Rangamani, M., & Takayanagi, T. (2007) · arXiv · doi:10.48550/arxiv.0705.0016 · Cited by 1,822 · cited 1×
“However, the covariant surface that is analogous to the minimal cut through a tensor network is the HRT surface [23, 24, 25], the minimal area extremal surface homologous to one end of the wormhole.”
BackgroundAverage entropy of a subsystem
Page, D. N. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.1291 · Cited by 1,578 · cited 1×
“n we will see how a Python’s Lunch explains the exponential diculty of decoding Hawking radiation. After the Page time an evaporating black hole is maximally entangled with its own Hawking radiation [30]. Harlow and Hayden [1] asked how hard it is to isolate a degree of freedom r in the radiation that is entangled wit…”
BackgroundAverage Entropy of a Subsystem
Page, D. N. (1993) · arXiv · doi:10.48550/arxiv.gr-qc/9305007 · Cited by 1,578 · cited 1×
“n we will see how a Python’s Lunch explains the exponential diculty of decoding Hawking radiation. After the Page time an evaporating black hole is maximally entangled with its own Hawking radiation [30]. Harlow and Hayden [1] asked how hard it is to isolate a degree of freedom r in the radiation that is entangled wit…”
BackgroundBlack Holes: Complementarity or Firewalls?
Almheiri, A., Marolf, D., Polchinski, J., & Sully, J. (2012) · arXiv · doi:10.48550/arxiv.1207.3123 · Cited by 1,471
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
Research works printed but not linked: 1
- W.K. Allard, Notes on the theory of varifolds, in Théorie des variétés minimales et applications, Astérisque 154–155, Société Mathématique de France (1987), pp. 73–93 and online at http://www.numdam.org/item/AST_1987_154-155_73_0.
Cited by
Replica wormholes and the black hole interior
Penington, G., Shenker, S. H., Stanford, D., & Yang, Z. (2019) · arXiv · doi:10.48550/arxiv.1911.11977 · Cited by 809
“ch higher complexity, as a unitary operator, than the simple description (3.12) would suggest. In fact, for evaporating black holes, there is good reason to think that it is exponentially complicated [62, 63]. 3.4 Gravitational replica trick for the Petz map The above discussion of the Petz map motivates us to amend t…”
BackgroundInfluentialSelf-citationReplica wormholes and the black hole interior
Penington, G., Shenker, S. H., Stanford, D., & Yang, Z. (2022) · Journal of High Energy Physics · doi:10.1007/jhep03(2022)205 · Cited by 807
“ch higher complexity, as a unitary operator, than the simple description (3.12) would suggest. In fact, for evaporating black holes, there is good reason to think that it is exponentially complicated [62, 63]. 3.4 Gravitational replica trick for the Petz map The above discussion of the Petz map motivates us to amend t…”
BackgroundInfluentialSelf-citationThe entropy of Hawking radiation
Almheiri, A., Hartman, T., Maldacena, J., Shaghoulian, E., & Tajdini, A. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.035002 · Cited by 706
“The actual quantum operations we would need to perform on the radiation are expected to be exceedingly complex, with a complexity that is (roughly) exponential in the black hole entropy [21,79].”
The entropy of Hawking radiation
Almheiri, A., Hartman, T., Maldacena, J., Shaghoulian, E., & Tajdini, A. (2020) · arXiv · doi:10.48550/arxiv.2006.06872 · Cited by 706
“The actual quantum operations we would need to perform on the radiation are expected to be exceedingly complex, with a complexity that is (roughly) exponential in the black hole entropy [21,79].”
Hartman, T., Jiang, Y., & Shaghoulian, E. (2020) · Journal of High Energy Physics · doi:10.1007/jhep11(2020)111 · Cited by 162
Metadata
- Authors
- Brown, A. R., Gharibyan, H., Penington, G., & Susskind, L.
- Affiliations
- Google (United States) (US)
- California Institute of Technology (US)
- Stanford University (US)
- Corresponding author
- Gharibyan, Hrant
- Venue
- Journal of High Energy Physics
- Published
- 2020-08
- Volume
- 2020
- Issue
- 8
- ISSN
- 1029-8479 (ISSN-L)
- OpenAlex
- W2990791203
- Cited by
- 124
- References
- 70
- Citations by year
- 2026: 9 · 2025: 26 · 2024: 22 · 2023: 25 · 2022: 18 · 2021: 16 · 2020: 7
- FWCI
- 7.30
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor, 24 d)
- Locations
- Journal of High Energy Physics (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1316699)
- U.S. Department of Energy (DESC0019380)
- Simons Foundation
- Air Force Office of Scientific Research (FA9550-, FA9550-16-1-0082, FA9550-16, -16-1-, FA9550-16-1)
- Topics
- Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Black Holes and Theoretical Physics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Noncommutative and Quantum Gravity Theories
- Keywords
- Hawking radiation, black holes, quantum extremal surfaces, generalized entropy, Einstein-Rosen bridge, wormholes, computational hardness, information distillation, tensor networks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Python’s Lunch: geometric obstructions to decoding Hawking radiation. https://app.cochat.ai/papers/10.1007/jhep08(2020)121
- The paper
- Brown, A. R., Gharibyan, H., Penington, G., & Susskind, L. (2020). The Python’s Lunch: geometric obstructions to decoding Hawking radiation. Journal of High Energy Physics. https://doi.org/10.1007/jhep08(2020)121
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.