Miloš Prokop

Variational quantum solutions to the Shortest Vector Problem

2022 · arXiv (Cornell University)

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 …