How to Build Pseudorandom Unitaries in Microcrypt
quant-ph
Submitted: 2026-10-02
Updated: 2026-10-02
Sources
- Oracle Separations for the Quantum-Classical Polynomial Hierarchy
- Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries
- The Acrobatics of BQP
- Cryptography from Pseudorandom Quantum States
- Quantum Lower Bounds by Polynomials
- Efficient Quantum Pseudorandomness from Hamiltonian Phase States
- How Not to Build Microcrypt
- Quantum Cryptography in Algorithmica
- Quantum-Computable One-Way Functions without One-Way Functions
- Quantum Pseudorandomness and Classical Complexity
- Commitments from Quantum One-Wayness
- Parallel Kac's Walk Generates PRU
- How to Construct Random Unitaries
- Simple constructions of linear-depth t-designs and pseudorandom unitaries
- One-Wayness in Quantum Cryptography
- Random unitaries in extremely low depth
- 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
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians