Fast computational deep thermalization
Shantanav Chakraborty, Soonwon Choi, Soumik Ghosh, Tudor Giurgic\u{a}-Tiron

TL;DR
This paper introduces the fastest quantum circuit dynamics that produce states mimicking Haar randomness with low entanglement, cryptographic properties, and scalability, revealing a new form of computational deep thermalization.
Contribution
It constructs the fastest known dynamics exhibiting computational deep thermalization with low entanglement and pseudorandom properties at infinite temperature.
Findings
States are indistinguishable from Haar random to bounded observers
States maintain pseudorandomness under local measurements
Preparation of states is resource-efficient and scalable
Abstract
Deep thermalization refers to the emergence of Haar-like randomness from quantum systems upon partial measurements. As a generalization of quantum thermalization, it is often associated with high complexity and entanglement. Here, we introduce computational deep thermalization and construct the fastest possible dynamics exhibiting it at infinite effective temperature. Our circuit dynamics produce quantum states with low entanglement in polylogarithmic depth that are indistinguishable from Haar random states to any computationally bounded observer. Importantly, the observer is allowed to request many copies of the same residual state obtained from partial projective measurements on the state -- this condition is beyond the standard settings of quantum pseudorandomness, but natural for deep thermalization. In cryptographic terms, these states are pseudorandom, pseudoentangled, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
