DeepAI AI Chat
Log In Sign Up

An efficient quantum algorithm for lattice problems achieving subexponential approximation factor

by   Lior Eldar, et al.

We give a quantum algorithm for solving the Bounded Distance Decoding (BDD) problem with a subexponential approximation factor on a class of integer lattices. The quantum algorithm uses a well-known but challenging-to-use quantum state on lattices as a type of approximate quantum eigenvector to randomly self-reduce the BDD instance to a random BDD instance which is solvable classically. The running time of the quantum algorithm is polynomial for one range of approximation factors and subexponential time for a second range of approximation factors. The subclass of lattices we study has a natural description in terms of the lattice's periodicity and finite abelian group rank. This view makes for a clean quantum algorithm in terms of finite abelian groups, uses very relatively little from lattice theory, and suggests exploring approximation algorithms for lattice problems in parameters other than dimension alone. A talk on this paper sparked many lively discussions and resulted in a new classical algorithm matching part of our result. We leave it as a challenge to give a classcial algorithm matching the general case.


page 1

page 2

page 3

page 4


Quantum and Classical Algorithms for Bounded Distance Decoding

In this paper, we provide a comprehensive overview of a recent debate ov...

Lattice sieving via quantum random walks

Lattice-based cryptography is one of the leading proposals for post-quan...

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

We show polynomial-time quantum algorithms for the following problems: ...

A Latent-Variable Lattice Model

Markov random field (MRF) learning is intractable, and its approximation...

Quantum Algorithms for Optimization and Polynomial Systems Solving over Finite Fields

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

Slide Reduction, Revisited---Filling the Gaps in SVP Approximation

We show how to generalize Gama and Nguyen's slide reduction algorithm [S...

An exact quantum hidden subgroup algorithm and applications to solvable groups

We present a polynomial time exact quantum algorithm for the hidden subg...