Quantum computing poses a threat to contemporary cryptosystems, with advances to a state in which it will cause problems predicted for the next few decades. Many of the proposed cryptosystems designed to be quantum-secure are based on the Shortest Vector Problem and related problems. In this paper we use the Quadratic Unconstrained Binary Optimisation formulation of the Shortest Vector Problem implemented as a quantum Ising model on a simulated Coherent Ising Machine, showing progress towards solving SVP for three variants of the algorithm.
@article{arxiv.2304.04075,
title = {Quantum algorithmic solutions to the shortest vector problem on simulated coherent Ising machines},
author = {Edmund Dable-Heath and Laura Casas and Victor Hertz and Christian Porter and Florian Mintert and Cong Ling},
journal= {arXiv preprint arXiv:2304.04075},
year = {2025}
}