Pseudorandomness and Pseudoentanglement in Holography
summary
Constructs explicit tensor-network CFT ensembles that are computationally indistinguishable yet have different RT entropies: exact RT for tree tensor networks and 1±ε approximate RT for broad planar graphs, using either random circuit as tensor network constructions or pseudo-entangled link states (requires superpolynomial local dimension and quantum‑secure one‑way functions). Shows these boundary states become pseudorandom while their bulk mincuts differ (depth d versus 2d), argues this could let bulk geometry distinguish instances that are indistinguishable on the boundary, but notes toy‑model and measurement caveats.
AI-written summary · about
chapters (10)
- 0:00Quantum gravity and complexity
- 3:20Pseudorandomness in circuits
- 8:28Geometry and entanglement
- 14:55Holographic dictionary hardness
- 17:24Pseudo-entangled states
- 24:36Tensor networks and AdS/CFT
- 31:16Pseudo-entangled states construction
- 44:57Quantum gravity implications
- 59:22Random circuits and CFT
- 1:02:56Open problems
related talks
59mInformational and computational aspects of holography
01h 03mConstant depth pseudoentanglement - Shallow circuits, deep backstory
01h 08mEntanglement in Many Body Quantum Systems
01h 07mTwo Tensor Optimization Problems From Quantum Information
01h 22mTensors vs Entanglement
27mAbstracting Entanglement
16mRobust Quantum Entanglement at (nearly) Room Temperature
01h 21mGeometry, Entropy and Complexity in Quantum Gravity (Part II)