LWE with quantum amplitudes: Algorithm, hardness, and oblivious sampling
From MaRDI portal
Cites work
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Classical Fourier Analysis
- Classical hardness of learning with errors
- Classical homomorphic encryption for quantum circuits
- Coding theorem and strong converse for quantum channels
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fully homomorphic encryption using ideal lattices
- Hardness of SIS and LWE with small parameters
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Learning with errors and extrapolated dihedral cosets
- Lossy codes and a new variant of the learning-with-errors problem
- New Algorithms for Learning in Presence of Errors
- New bounds in some transference theorems in the geometry of numbers
- On lattices, learning with errors, random linear codes, and cryptography
- Quantum algorithms for variants of average-case lattice problems via filtering
- Quantum algorithms revisited
- Quantum Computation and Lattice Problems
- Quantum lightning never strikes the same state twice
- Quantum proofs of deletion for learning with errors
- Quantum rejection sampling
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: LWE with quantum amplitudes: Algorithm, hardness, and oblivious sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863952)
