Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances
Abstract 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 $$H_A(F)$$ H A ( F ) which is specifically constr...
Enregistré dans:
Auteurs principaux: | Ernesto Campos, Salvador E. Venegas-Andraca, Marco Lanzagorta |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Nature Portfolio
2021
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/362d451aae42424eadb4a41e9adb6af9 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
The backtracking survey propagation algorithm for solving random K-SAT problems
par: Raffaele Marino, et autres
Publié: (2016) -
Coherence as resource in scattering quantum walk search on complete graph
par: Yun-Long Su, et autres
Publié: (2018) -
Efficient quantum walk on a quantum processor
par: Xiaogang Qiang, et autres
Publié: (2016) -
Quantum tunneling in magnetic tunneling junctions
par: Evgeni Cruz de Gracia, et autres
Publié: (2012) -
Resource-efficient quantum algorithm for protein folding
par: Anton Robert, et autres
Publié: (2021)