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 with the regularized maximal geodesic length as distinguisher.
The complexity of learning (pseudo)random dynamics of black holes and other chaotic systems
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
citing papers explorer
-
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 with the regularized maximal geodesic length as distinguisher.
-
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
-
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.