Not-so-adiabatic quantum computation for the shortest vector problem
Since quantum computers are known to break the vast majority of currently used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proved, to be safe against quantum attacks. Among the most promising is lattice-based cryptography, where security reli...
Main Authors: | David Joseph, Alexandros Ghionis, Cong Ling, Florian Mintert |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2020-03-01
|
Series: | Physical Review Research |
Online Access: | http://doi.org/10.1103/PhysRevResearch.2.013361 |
Similar Items
-
Variational quantum solutions to the Shortest Vector Problem
by: Martin R. Albrecht, et al.
Published: (2023-03-01) -
On the hardness of the shortest vector problem
by: Micciancio, Daniele
Published: (2009) -
An Efficient Algorithm for the Shortest Vector Problem
by: Yu-Lun Chuang, et al.
Published: (2018-01-01) -
Editorial: Adiabatic Quantum Computation
by: Jacob D. Biamonte
Published: (2019-09-01) -
Sieve algorithms for the shortest vector problem are practical
by: Nguyen Phong Q., et al.
Published: (2008-07-01)