DeepAI AI Chat
Log In Sign Up

Variational quantum solutions to the Shortest Vector Problem

by   Martin R. Albrecht, et al.

A fundamental computational problem is to find a shortest non-zero vector in Euclidean lattices, a problem known as the Shortest Vector Problem (SVP). This problem is believed to be hard even on quantum computers and thus plays a pivotal role in post-quantum cryptography. In this work we explore how (efficiently) Noisy Intermediate Scale Quantum (NISQ) devices may be used to solve SVP. Specifically, we map the problem to that of finding the ground state of a suitable Hamiltonian. In particular, (i) we establish new bounds for lattice enumeration, this allows us to obtain new bounds (resp. estimates) for the number of qubits required per dimension for any lattices (resp. random q-ary lattices) to solve SVP; (ii) we exclude the zero vector from the optimization space by proposing (a) a different classical optimisation loop or alternatively (b) a new mapping to the Hamiltonian. These improvements allow us to solve SVP in dimension up to 28 in a quantum emulation, significantly more than what was previously achieved, even for special cases. Finally, we extrapolate the size of NISQ devices that is required to be able to solve instances of lattices that are hard even for the best classical algorithms and find that with approximately 10^3 noisy qubits such instances can be tackled.


Noise-Assisted Variational Hybrid Quantum-Classical Optimization

Variational hybrid quantum-classical optimization represents one the mos...

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...

QAOA for Max-Cut requires hundreds of qubits for quantum speed-up

Computational quantum technologies are entering a new phase in which noi...

NISQ Algorithm for Semidefinite Programming

Semidefinite Programming (SDP) is a class of convex optimization program...

Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection

Recent advances in quantum technologies pave the way for noisy intermedi...

Many-Qudit representation for the Travelling Salesman Problem Optimisation

We present a map from the travelling salesman problem (TSP), a prototypi...