Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Two quantum Ising algorithms for the Shortest Vector Problem: one for
  now and one for later   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.

11
The categories of this paper are: hep-lat
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg
33
The categories of this paper are: plasm-ph
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
35
The categories of this paper are: mtrl-th
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio
8
The categories of this paper are: hep-ex
20
The categories of this paper are: acc-phys