Two quantum Ising algorithms for the Shortest Vector Problem: one for now and one for later release_xmom26i6lzbsppweywvgrwf2yy

by David Joseph, Adam Callison, Cong Ling, Florian Mintert

Released as a article .

2021  

Abstract

Quantum computers are expected to break today's public key cryptography within a few decades. New cryptosystems are being designed and standardised for the post-quantum era, and a significant proportion of these rely on the hardness of problems like the Shortest Vector Problem to a quantum adversary. In this paper we describe two variants of a quantum Ising algorithm to solve this problem. One variant is spatially efficient, requiring only O(NlogN) qubits where N is the lattice dimension, while the other variant is more robust to noise. Analysis of the algorithms' performance on a quantum annealer and in numerical simulations show that the more qubit-efficient variant will outperform in the long run, while the other variant is more suitable for near-term implementation.
In text/plain format

Archived Files and Locations

application/pdf  752.5 kB
file_scpl4r4qbfflhmnkygsmty2hdy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-03-04
Version   v7
Language   en ?
arXiv  2006.14057v7
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: b555945a-de27-44a9-8719-39d79453fd33
API URL: JSON