Computational Pseudorandomness and Constraints on the Ads/Cft Duality
summary
Shows a concrete construction in the CFT domain that hides linear-in-time growth: an ensemble of 4^L states made by alternating a fixed scrambling unitary with secret single-qubit “shocks” yields a pseudo-random state ensemble (black‑box security roughly requires ~2^{L/2} queries), inspired by a flip-or-not block cipher analogue. Those states are computationally indistinguishable yet have different wormhole volumes, so any time‑growing dual is exponentially hard to estimate while the volume itself becomes polynomially recoverable by aggregating many observers, forcing the dictionary to be exponentially complex or the quantum Church–Turing thesis to fail.
AI-written summary · about