Back to Search
Start Over
Not-so-adiabatic quantum computation for the shortest vector problem
- Source :
- Physical Review Research, Vol 2, Iss 1, p 013361 (2020)
- Publication Year :
- 2020
- Publisher :
- American Physical Society, 2020.
-
Abstract
- 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 relies upon problems like the shortest vector problem. We analyze the potential of adiabatic quantum computation for attacks on lattice-based cryptography, and give numerical evidence that even outside the adiabatic regime such methods can facilitate the solution of the shortest vector and similar problems.
Details
- Language :
- English
- ISSN :
- 26431564
- Volume :
- 2
- Issue :
- 1
- Database :
- Directory of Open Access Journals
- Journal :
- Physical Review Research
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.4187c83e27794e909848735b0e41e2bb
- Document Type :
- article
- Full Text :
- https://doi.org/10.1103/PhysRevResearch.2.013361