Quantum algorithmic solutions to the shortest vector problem on simulated coherent Ising machines
Quantum algorithmic solutions to the shortest vector problem on simulated coherent Ising machines
Dable-Heath, E.; Casas, L.; Porter, C.; Mintert, F.; Ling, C.
Abstract
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.
-
WWW-Beitrag
https://arxiv.org/abs/2304.04075
Downloads
Permalink: https://www.hzdr.de/publications/Publ-38422