Efficient quantum pseudorandomness from Hamiltonian phase states
From MaRDI portal
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A Pseudorandom Generator from any One-way Function
- An Almost m-wise Independent Random Permutation of the Cube
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Complementarity and the unitarity of the black hole \(S\)-matrix
- Cryptographic primitives based on hard learning problems
- Cryptography from pseudorandom quantum states
- Generating a state t-design by diagonal quantum circuits
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Improved Quantum data analysis
- Local random quantum circuits are approximate polynomial-designs
- More on average case vs approximation complexity
- On lattices, learning with errors, random linear codes, and cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Pseudorandom (function-Like) quantum state generators: new definitions and applications
- Pseudorandom quantum states
- Pseudorandomness
- Public-key pseudoentanglement and the hardness of learning ground state entanglement structure
- Quantum cryptography in Algorithmica
- Quantum pseudoentanglement
- Secure communications over insecure channels
- Shadow tomography of quantum states
- Simple permutations mix even better
- Simple permutations mix well
- Structural lower bounds on black-box constructions of pseudorandom functions
- Temporally unstructured quantum computation
- Towards general-purpose program obfuscation via local mixing
This page was built for publication: Efficient quantum pseudorandomness from Hamiltonian phase states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313325)
