3 problems
- 0 votes0 replies2 views
Subexponential quantum hardness of LWE for symmetric pseudorandom unitaries
Symmetric PRU existence conjecture. Under the conjecture that no subexponential-time quantum algorithm can solve learning with errors (LWE), symmetric pseudorandom unitaries with s…
- 0 votes0 replies0 views
The computational hardness conjecture for Learning with Errors
Let and be positive integers, let be the error parameter, and write . For a secret vector , the Learning w…
- 0 votes0 replies0 views
Low-depth pseudorandom unitaries under the LWE hardness conjecture
Let be the number of qubits, and consider random quantum circuits over these qubits in either a 1D or an all-to-all architecture. Let denote the circuit depth, and let LWE…