Quantum-Walk Speedup of Backtracking Algorithms

Ashley Montanaro*

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)peer-review

18 Citations (Scopus)
106 Downloads (Pure)

Abstract

We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs). Backtracking algorithms explore a tree whose vertices are partial solutions to a CSP in an attempt to find a complete solution. Assume there is a classical backtracking algorithm which finds a solution to a CSP on n variables, or outputs that none exists, and whose corresponding tree contains T vertices, each vertex corresponding to a test of a partial solution. Then we show that there is a bounded-error quantum algorithm which completes the same task using (Formula presented) tests. In particular, this quantum algorithm can be used to speed up the DPLL algorithm, which is the basis of many of the most efficient SAT solvers used in practice. The quantum algorithm is based on the use of a quantum walk algorithm of Belovs to search in the backtracking tree.

Original languageEnglish
Article number15
Number of pages24
JournalTheory of Computing
Volume14
DOIs
Publication statusPublished - 3 Dec 2018

Structured keywords

  • QITG

Keywords

  • Quantum computing
  • Quantum query complexity
  • Quantum walk

Fingerprint

Dive into the research topics of 'Quantum-Walk Speedup of Backtracking Algorithms'. Together they form a unique fingerprint.

Cite this