Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality
arXiv:1910.14646
Abstract
A fundamental issue in the AdS/CFT correspondence is the wormhole growth paradox. Susskind's conjectured resolution of the paradox was to equate the volume of the wormhole with the circuit complexity of its dual quantum state in the CFT. We study the ramifications of this conjecture from a complexity-theoretic perspective. Specifically we give evidence for the existence of computationally pseudorandom states in the CFT, and argue that wormhole volume is measureable in a non-physical but computational sense, by amalgamating the experiences of multiple observers in the wormhole. In other words the conjecture equates a quantity which is difficult to compute with one which is easy to compute. The pseudorandomness argument further implies that this is a necessary feature of any resolution of the wormhole growth paradox, not just of Susskind's Complexity=Volume conjecture. As a corollary we conclude that either the AdS/CFT dictionary map must be exponentially complex, or the quantum Extended Church-Turing thesis must be false in quantum gravity.
arXiv comment32 pages, 3 figures
References in corpus (21)
- Holographic Derivation of Entanglement Entropy from AdS/CFT
- Black holes and the butterfly effect
- Strengths and Weaknesses of Quantum Computing
- The Stretched Horizon and Black Hole Complementarity
- Complexity Equals Action
- Complexity and Shock Wave Geometries
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Complexity, action, and black holes
- Quantum Computation as Geometry
- Quantum Algorithms for Quantum Field Theories
- Multiple Shocks
- Chaos and complexity by design
- Towards Complexity for Quantum Field Theory States
- Gravitational action with null boundaries
- Comments on Holographic Complexity
- Pseudorandom States, Non-Cloning Theorems and Quantum Money
- The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes
- Efficient Quantum Pseudorandomness
- Wormhole and Entanglement (Non-)Detection in the ER=EPR Correspondence
- Grover search and the no-signaling principle
- Universal Hamiltonians for Exponentially Long Simulation
Cited by in corpus (13)
- Holographic Pseudo Entropy
- Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
- Models of quantum complexity growth
- Random Matrix Theory for Complexity Growth and Black Hole Interiors
- The ghost in the radiation: Robust encodings of the black hole interior
- Finding Pythons in Unexpected Places
- General Bounds on Holographic Complexity
- Resource theory of quantum uncomplexity
- Scrambling and decoding the charged quantum information
- Petz map and Python's lunch
- Horizons Protect Church-Turing
- Black Holes at Exp-time
- On estimating the entropy of shallow circuit outputs