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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/362d451aae42424eadb4a41e9adb6af9 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|