SCIENCE@home

Analysis of the shortest vector problems with quantum annealing to search the excited states

Katsuki Ura,Takashige Imoto,T. Nikuni,S. Kawabata,Y. Matsuzaki

Published 2022 in Japanese Journal of Applied Physics

ABSTRACT

The shortest vector problem (SVP) is one of the lattice problems and is the mathematical basis for lattice-based cryptography, which is expected to be post-quantum cryptography. The SVP can be mapped onto the Ising problem, which in principle can be solved by quantum annealing (QA). However, one issue in solving the SVP using QA is that the solution of the SVP corresponds to the first excited state of the problem Hamiltonian. Therefore, QA, which searches for ground states, cannot provide a solution with high probability. In this paper, we propose to adopt an excited-state search of the QA to solve the shortest vector problem. We numerically show that the excited-state search provides a solution with a higher probability than the ground-state search.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-10 of 10 references · Page 1 of 1

CITED BY

Showing 1-7 of 7 citing papers · Page 1 of 1