DeepAI AI Chat
Log In Sign Up

Quantum and Classical Algorithms for Bounded Distance Decoding

by   Richard Allen, et al.

In this paper, we provide a comprehensive overview of a recent debate over the quantum versus classical solvability of bounded distance decoding (BDD). Specifically, we review the work of Eldar and Hallgren [EH22], [Hal21] demonstrating a quantum algorithm solving λ_1 2^-Ω(√(k log q))-BDD in polynomial time for lattices of periodicity q, finite group rank k, and shortest lattice vector length λ_1. Subsequently, we prove the results of [DvW21a], [DvW21b] with far greater detail and elaboration than in the original work. Namely, we show that there exists a deterministic, classical algorithm achieving the same result.


An efficient quantum algorithm for lattice problems achieving subexponential approximation factor

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

Almost tight bound on the query complexity of generalized Simon's problem

Simon's problem played an important role in the history of quantum algor...

Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

The most important computational problem on lattices is the Shortest Vec...

The nearest-colattice algorithm

In this work, we exhibit a hierarchy of polynomial time algorithms solvi...

Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle)

A conjecture of Jozsa states that any polynomial-time quantum computatio...

Quantum algorithm for Dyck Language with Multiple Types of Brackets

We consider the recognition problem of the Dyck Language generalized for...

Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms

The Aaronson-Ambainis conjecture (Theory of Computing '14) says that eve...