A Quantum Complexity Approach to the Problem of Weak Cosmic Censorship
summary
Claim: classical weak cosmic censorship fails but a quantum version holds under a complexity hypothesis. Using AdS/CFT and modeling boundary time evolution as a pseudorandom unitary with key size polynomial in N, a proved hardness result shows efficient quantum learners cannot predict the time evolution of a constructed operator Q on typical states, so reconstruction must be exponentially hard and an event horizon exists. That gives a sufficient condition dubbed cryptographic censorship; also builds pseudoentangled ensembles whose duals exhibit horizons.
AI-written summary · about
chapters (10)
- 0:00Black hole foundations
- 4:45The problem of singularities
- 7:34Weak cosmic censorship
- 11:46Quantum gravity constraints
- 16:06Complexity and horizons
- 22:54Modeling gravitational dynamics
- 29:50Learning and causality
- 35:43Cryptographic censorship
- 41:41Typicality and horizons
- 51:16Pseudo-entanglement and wrap-up
related talks
46mQuantum Learning Algorithms Imply Circuit Lower Bounds
01h 10mQuantum Advantage with Shallow Clifford Circuits
01h 06mGeometry, Entropy and Complexity in Quantum Gravity (Part I)
01h 09mRecent Progress in Quantum Advantage
22mQuantum space, ground space traversal, and how to embed multi-prover...
01h 06mQuantum Advantage Without Structure
58mLimitations for Quantum PCPs
01h 21mGeometry, Entropy and Complexity in Quantum Gravity (Part II)