LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling
Yilei Chen, Zihan Hu, Qipeng Liu, Han Luo, Yaxin Tu

TL;DR
This paper introduces new quantum algorithms and hardness results for LWE variants with Gaussian and phase amplitudes, improving solution efficiency and establishing quantum reductions from standard LWE to these variants.
Contribution
It presents the first subexponential quantum algorithm for known-phase LWE, a polynomial-time solution for quadratic phase amplitudes, and quantum reductions from standard LWE to amplitude-based LWE.
Findings
Subexponential quantum algorithm for known-phase LWE
Polynomial-time quantum algorithm for quadratic phase amplitudes
Quantum reductions from standard LWE to amplitude-based LWE
Abstract
In this paper, we show new algorithms, hardness results and applications for and with real Gaussian, Gaussian with linear or quadratic phase terms, and other related amplitudes. Let be the dimension of LWE samples. Our main results are 1. There is a -time algorithm for with Gaussian amplitude with \emph{known} phase, given many quantum samples. The algorithm is modified from Kuperberg's sieve, and in fact works for more general amplitudes as long as the amplitudes and phases are completely \emph{known}. 2. There is a polynomial time quantum algorithm for solving and for Gaussian with quadratic phase amplitudes, where the sample complexity is as small as . As an application, we give a quantum oblivious LWE sampler…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cryptography and Data Security · Coding theory and cryptography
