Random unitaries in constant (quantum) time
From MaRDI portal
Cites work
- Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Commitments to quantum states
- Constant depth circuits, Fourier transform, and learnability
- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
- Cryptographic hardness of distribution-specific learning
- Cryptographic primitives based on hard learning problems
- How to Construct Quantum Random Functions
- scientific article; zbMATH DE number 6492475 (Why is no real title available?)
- Instantaneous non-local computation of low T-depth quantum circuits
- Layout graphs, random walks and the t-wise independence of SPN block ciphers
- Local random quantum circuits are approximate polynomial-designs
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Natural proofs
- Oracle Separation of BQP and PH
- Parity, circuits, and the polynomial-time hierarchy
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- Pseudo-random unitary operators for quantum information processing
- Quantum computation and quantum information. 10th anniversary edition
- Quantum fan-out is powerful
- Quantum hardness of learning shallow classical circuits
This page was built for publication: Random unitaries in constant (quantum) time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445586)