Unconditional pseudorandomness against shallow quantum circuits
From MaRDI portal
Cites work
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- Approximation algorithms for QMA-complete problems
- Better pseudorandom generators from milder pseudorandom restrictions
- Bounded indistinguishability and the complexity of recovering secrets
- Dynamics of pseudoentanglement
- Entanglement, quantum randomness, and complexity beyond scrambling
- Entropy of an n-system from its correlation with a k-reservoir
- Hardness vs randomness
- How to Construct Quantum Random Functions
- scientific article; zbMATH DE number 7768373 (Why is no real title available?)
- scientific article; zbMATH DE number 7829308 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- Improved pseudorandom generators for depth 2 circuits
- Local random quantum circuits are approximate polynomial-designs
- On polynomial approximations to \(\mathrm{AC}^0\)
- Oracle separation between quantum commitments and quantum one-wayness
- Paradigms for Unconditional Pseudorandom Generators
- Parity vs. \(\text{AC}^0\) with simple quantum preprocessing
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- Pseudorandom bits for constant depth circuits
- Pseudorandom bits for polynomials
- Pseudorandom generators for space-bounded computation
- Pseudorandom quantum states
- Pseudorandomness
- Pseudorandomness for network algorithms
- Quantum computation and quantum information. 10th anniversary edition
- Quantum cryptography in Algorithmica
- Quantum pseudoentanglement
- Random unitaries in extremely low depth
- Randomness is linear in space
- Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
- Using Nondeterminism to Amplify Hardness
This page was built for publication: Unconditional pseudorandomness against shallow quantum circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445596)