Finding shortest lattice vectors faster using quantum search

By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the literature, we obtain improved asymptotic quantum results for solving the shortest vector problem on lattices. With quantum computers we can provably find a shortest vector in time [Formula: see text]...

Descripción completa

Detalles Bibliográficos
Autores principales: Laarhoven, Thijs, Mosca, Michele, van de Pol, Joop
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2015
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7089694/
https://www.ncbi.nlm.nih.gov/pubmed/32226228
http://dx.doi.org/10.1007/s10623-015-0067-5

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7089694/
https://www.ncbi.nlm.nih.gov/pubmed/32226228
http://dx.doi.org/10.1007/s10623-015-0067-5

Ejemplares similares