Informational and computational aspects of holography
summary
AdS3/CFT2 examples show entanglement entropy on a boundary circle mapping to a geometric area in the bulk via the Ryu–Takayanagi minimal surface, with the leading term scaling as 1/G_N and subleading corrections coming from bulk entanglement captured by the quantum extremal surface. Inequalities like the holographic entropy cone single out “geometric states.” Tensor networks and quantum error correction model the bulk-to-boundary map, RT/QES methods reproduce the Page curve for black hole evaporation, and conjectures like complexity=volume/action create apparent complexity gaps between CFT tasks and bulk computation.
AI-written summary · about
chapters (15)
- 0:00Holography introduction
- 2:34Holography in physics and computation
- 7:01Holographic principle and AdS/CFT
- 12:18Classical vs quantum gravity
- 15:13Geometric states in AdS/CFT
- 21:01Entanglement entropy and RT formula
- 25:06ER equals EPR spacetime
- 28:27Strong subadditivity and entropy cone
- 30:38Quantum extremal surfaces
- 33:43Quantum info tools in AdS/CFT
- 36:39AdS/CFT as computational model
- 42:19Complexity gaps CFT vs AdS
- 46:27Inverse Newton constant implications
- 49:27Summary of holography aspects
- 52:15Q&A future directions
related talks
01h 21mGeometry, Entropy and Complexity in Quantum Gravity (Part II)
01h 06mGeometry, Entropy and Complexity in Quantum Gravity (Part I)
01h 07mPseudorandomness and Pseudoentanglement in Holography
51mHolographic Pseudo Entropy and Emergent Spacetime
01h 00mTensor Network Toy Models of Holographic Dualities: Locality and Causality
01h 07mTwo Tensor Optimization Problems From Quantum Information
01h 08mEntanglement in Many Body Quantum Systems
01h 12mHow Quantum Complexity Found Its Way into Black Hole Physics