Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Pseudorandom Dynamics in the SYK Model and Cryptographic Censorship in JT Gravity
SYK disorder is shown to be an approximate unitary k-design for poly(N) k; under the planted-SYK hardness conjecture this yields gravitationally pseudorandom unitaries, implying cryptographic censorship in JT gravity ...
-
Rethinking quantum information in gravity and fields
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
-
Quantum Complexity and New Directions in Nuclear Physics and High-Energy Physics Phenomenology
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.