Learning Random Quantum Circuits and the Emergence of Pseudorandomness
quant-ph, cs.DS
Submitted: 2026-09-30
Updated: 2026-09-30
Project page: https://sattath.github.io/microcrypt-zoo
Terminology
Sources
- Quantum Pseudoentanglement
- Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters
- Quantum hardness of learning shallow classical circuits
- Learning the closest product state
- Fast computational deep thermalization
- Unitary designs in nearly optimal depth
- The Hardness of Learning Quantum Circuits and its Cryptographic Applications
- Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits
- Learning and Generating Mixed States Prepared by Shallow Channel Circuits
- Learning shallow quantum circuits
- Learning State Preparation Circuits for Quantum Phases of Matter
- Quantum Relative Entropy Decay Composition Yields Shallow, Unstructured k-Designs
- Efficient Matrix Product State Learning in Logarithmic Depth
- Learning quantum states prepared by shallow circuits in polynomial time
- Anti-concentration for polynomials of independent random variables
- Quantum Entanglement Growth Under Random Unitary Dynamics
- Local dimension-free estimates for volumes of sublevel sets of analytic functions
- Small ball probability, Inverse theorems, and applications
- Strong random unitaries and fast scrambling
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity