Not-so-adiabatic quantum computation for the shortest vector problem

TL;DR

This paper investigates the potential of adiabatic quantum computation to solve the shortest vector problem in lattice-based cryptography, providing numerical evidence that such methods could threaten current cryptographic security.

Contribution

It introduces a novel analysis of adiabatic quantum algorithms for lattice problems and demonstrates their potential effectiveness beyond the adiabatic regime.

Findings

Adiabatic quantum methods can solve the shortest vector problem.

Numerical evidence supports effectiveness outside adiabatic regime.

Potential implications for cryptographic security.

Abstract

Since quantum computers are known to break the vast majority of currently-used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proven to be safe against quantum attacks. Among the most promising is lattice-based cryptography, where security relies upon problems like the shortest vector problem. We analyse the potential of adiabatic quantum computation for attacks on lattice-based cryptography, and give numerical evidence that even outside the adiabatic regime such methods can facilitate the solution of the shortest vector and similar problems.