The Python's lunch: geometric obstructions to decoding Hawking radiation
From MaRDI portal
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.
Recommendations
Cites work
- A paucity of bulk entangling surfaces: AdS wormholes with de Sitter interiors
- Average entropy of a subsystem
- Black holes: complementarity or firewalls?
- Bulk locality and quantum error correction in AdS/CFT
- Computational complexity and black hole horizons
- Cool horizons for entangled black holes
- Entropy, extremality, Euclidean variations, and the equations of motion
- Generalized gravitational entropy
- Geometric measure theory.
- Holographic derivation of entanglement entropy from the anti-de Sitter space/conformal field theory correspondence
- Holographic duality from random tensor networks
- scientific article; zbMATH DE number 3723536 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2070179 (Why is no real title available?)
- scientific article; zbMATH DE number 1890851 (Why is no real title available?)
- Learning the Alpha-bits of black holes
- Maximin surfaces, and the strong subadditivity of the covariant holographic entanglement entropy
- Optimizing quantum optimization algorithms via faster quantum gradient computation
- Quantum computation as geometry
- Quantum computation vs. firewalls
- Quantum computing, postselection, and probabilistic polynomial-time
- Quantum corrections to holographic entanglement entropy
- Quantum maximin surfaces
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Relative entropy equals bulk relative entropy
- Replica wormholes and the entropy of Hawking radiation
- Strengths and Weaknesses of Quantum Computing
- The entropy of bulk quantum fields and the entanglement wedge of an evaporating black hole
- The gravity dual of a density matrix
- The Page curve of Hawking radiation from semiclassical geometry
- Traversable wormholes via a double trace deformation
Cited in
(78)- Holography abhors visible trapped surfaces
- Geometric secret sharing in a model of Hawking radiation
- Entanglement between two disjoint universes
- Topological shadows and complexity of islands in multiboundary wormholes
- Complexity growth of operators in the SYK model and in JT gravity
- Knots, links, and long-range magic
- Seeing the entanglement wedge
- Islands in the stream of Hawking radiation
- Island for gravitationally prepared state and pseudo entanglement wedge
- General bounds on holographic complexity
- The central dogma and cosmological horizons
- Quantum extremal islands made easy. IV: Massive black holes on the brane
- Replica wormholes and the black hole interior
- Python's lunches in Jackiw-Teitelboim gravity with matter
- Seeing behind black hole horizons in SYK
- Gravitational and gravitoscalar thermodynamics
- Petz map and Python's lunch
- Reflected entropy for an evaporating black hole
- Sectional curvatures distribution of complexity geometry
- Entanglement in de Sitter space
- Holographic measurement and bulk teleportation
- Black hole information recovery in JT gravity
- A world without pythons would be so simple
- Finding pythons in unexpected places
- More of the bulk from extremal area variations
- Homology conditions for RT surfaces in double holography
- Complementarity and the unitarity of the black hole \(S\)-matrix
- Delicate windows into evaporating black holes
- Quantum error correction in the black hole Interior
- Non-isometric codes for the black hole Interior from fundamental and effective dynamics
- Quantum error correction from complexity in Brownian SYK
- A microscopic model of black hole evaporation in two dimensions
- Coarse graining pure states in AdS/CFT
- Cauchy slice holography: a new AdS/CFT dictionary
- Discrete bulk reconstruction
- Cosmology from random entanglement
- Toward random tensor networks and holographic codes in CFT
- Large \(N\) algebras and generalized entropy
- Von Neumann algebras in JT gravity
- Bubbles of cosmology in AdS/CFT
- Twice upon a time: timelike-separated quantum extremal surfaces
- Holographic weak measurement
- The quantum focusing conjecture and the improved energy condition
- Euclidean wormholes for individual 2d CFTs
- Cosmological complexity of the modified dispersion relation
- Subsystem complexity and measurements in holography
- Subregion independence in gravity
- Bulk reconstruction and non-isometry in the backwards-forwards holographic black hole map
- Modular flow in JT gravity and entanglement wedge reconstruction
- The black hole interior from non-isometric codes and complexity
- Constraints on physical computers in holographic spacetimes
- Geometric surprises in the Python's lunch conjecture
- Algebraic ER=EPR and complexity transfer
- Relational bulk reconstruction from modular flow
- Magnetic braneworlds: cosmology and wormholes
- Tensor networks for black hole interiors: non-isometries, quantum extremal surfaces, and wormholes
- Deriving the non-perturbative gravitational dual of quantum Liouville theory from BCFT operator algebra
- Entangled universes
- An apologia for islands
- Simple holography in general spacetimes
- Estimating time in quantum chaotic systems and black holes
- Cryptographic tests of the python's lunch conjecture
- On infinite tensor networks, complementary recovery and type II factors
- On tests for baby universes in AdS/CFT
- Non-perturbative overlaps in JT gravity: from spectral form factor to generating functions of complexity
- Discrete max-focusing
- Minimax surfaces and the holographic entropy cone
- Wormholes and factorization in exact effective theory
- The complexity of learning (pseudo)random dynamics of black holes and other chaotic systems
- Non-isometry, state dependence and holography
- Non-linear equation of motion for higher curvature semiclassical gravity
- Cryptographic censorship
- Probing the Page transition via approximate quantum error correction
- Subregion duality, wedge classification and no global symmetries in AdS/CFT
- Coarse-grained fixed-point tensor networks and holographic reflected entropy in 3D gravity
- Probing the bubble interior with entanglement entropy and bulk-cone singularities
- Spoofing entanglement in holography
- Tests of restricted quantum focusing and a new CFT bound
This page was built for publication: The Python's lunch: geometric obstructions to decoding Hawking radiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225762)
