Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality

10/31/2019
by   Adam Bouland, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2022

Black holes and cryptocurrencies

It has been proposed in the literature that the volume of Einstein-Rosen...
research
09/04/2022

Conjecture C Still Stands

More than ten years ago the author described a parameter K(ρ ) for the c...
research
06/27/2022

NLTS Hamiltonians from good quantum codes

The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastin...
research
11/03/2020

Circuit lower bounds for low-energy states of quantum code Hamiltonians

The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hasti...
research
06/01/2018

Quantum Information Scrambling Through a High-Complexity Operator Mapping

Recently, quantum information scrambling has attracted much attention am...
research
11/16/2021

On Bock's Conjecture Regarding the Adam Optimizer

In 2014, Kingma and Ba published their Adam optimizer algorithm, togethe...
research
01/27/2021

Computational irreducibility and compatibilism: towards a formalization

If our actions are determined by the laws of nature, can we meaningfully...

Please sign up or login with your details

Forgot password? Click here to reset