  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.
