Cryptographic Censorship
We formulate and take two large strides towards proving a quantum version of the weak cosmic censorship conjecture. We first prove “Cryptographic Censorship”: a theorem showing that when the time evolution operator of a holographic CFT is approximately pseudorandom (or Haar random) on some code subs...
Main Authors: | Engelhardt, Netta, Folkestad, Åsmund, Levine, Adam, Verheijden, Evita, Yang, Lisa |
---|---|
Other Authors: | Massachusetts Institute of Technology. Center for Theoretical Physics |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg
2025
|
Online Access: | https://hdl.handle.net/1721.1/158276 |
Similar Items
-
Negative complexity of formation: the compact dimensions strike back
by: Engelhardt, Netta, et al.
Published: (2022) -
Holography abhors visible trapped surfaces
by: Engelhardt, Netta, et al.
Published: (2021) -
General bounds on holographic complexity
by: Engelhardt, Netta, et al.
Published: (2022) -
From Quantum Information to Cosmic Censorship: Emergent Spacetimes and Their Surfaces
by: Folkestad, Åsmund Schiager
Published: (2024) -
Subregion independence in gravity
by: Folkestad, Åsmund
Published: (2024)