DeepAI AI Chat
Log In Sign Up

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering

by   Yilei Chen, et al.

We show polynomial-time quantum algorithms for the following problems: (*) Short integer solution (SIS) problem under the infinity norm, where the public matrix is very wide, the modulus is a polynomially large prime, and the bound of infinity norm is set to be half of the modulus minus a constant. (*) Extrapolated dihedral coset problem (EDCP) with certain parameters. (*) Learning with errors (LWE) problem given LWE-like quantum states with polynomially large moduli and certain error distributions, including bounded uniform distributions and Laplace distributions. The SIS, EDCP, and LWE problems in their standard forms are as hard as solving lattice problems in the worst case. However, the variants that we can solve are not in the parameter regimes known to be as hard as solving worst-case lattice problems. Still, no classical or quantum polynomial-time algorithms were known for those variants. Our algorithms for variants of SIS and EDCP use the existing quantum reductions from those problems to LWE, or more precisely, to the problem of solving LWE given LWE-like quantum states. Our main contributions are introducing a filtering technique and solving LWE given LWE-like quantum states with interesting parameters.


page 1

page 2

page 3

page 4


Quantum Algorithm for Optimization and Polynomial System Solving over Finite Field and Application to Cryptanalysis

In this paper, we give quantum algorithms for two fundamental computatio...

Practical Period Finding on IBM Q – Quantum Speedups in the Presence of Errors

We implemented Simon's quantum period finding circuit for functions F_2^...

Applying the Quantum Alternating Operator Ansatz to the Graph Matching Problem

The Quantum Alternating Operator Ansatz (QAOA+) framework has recently g...

Quantum Worst-Case to Average-Case Reductions for All Linear Problems

We study the problem of designing worst-case to average-case reductions ...

An efficient quantum algorithm for lattice problems achieving subexponential approximation factor

We give a quantum algorithm for solving the Bounded Distance Decoding (B...

The Polynomial Learning With Errors Problem and the Smearing Condition

As quantum computing advances rapidly, guaranteeing the security of cryp...

Semiclassical Quantum Computation Solutions to the Count to Infinity Problem: A Brief Discussion

In this paper we briefly define distance vector routing algorithms, thei...