Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances

We present a new quantum heuristic algorithm aimed at finding satisfying assignments for hard K-SAT instances using a continuous time quantum walk that explicitly exploits the properties of quantum tunneling. Our algorithm uses a Hamiltonian [Formula: see text] which is specifically constructed to s...

Descripción completa

Detalles Bibliográficos
Autores principales: Campos, Ernesto, Venegas-Andraca, Salvador E., Lanzagorta, Marco
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8376969/
https://www.ncbi.nlm.nih.gov/pubmed/34413348
http://dx.doi.org/10.1038/s41598-021-95801-1

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8376969/
https://www.ncbi.nlm.nih.gov/pubmed/34413348
http://dx.doi.org/10.1038/s41598-021-95801-1

Ejemplares similares