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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Publishing Group
2021-08-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-021-95801-1 |