Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Practical implementation of a quantum backtracking algorithm   In previous work, Montanaro presented a method to obtain quantum speedups for
backtracking algorithms, a general meta-algorithm to solve constraint
satisfaction problems (CSPs). In this work, we derive a space efficient
implementation of this method. Assume that we want to solve a CSP with $m$
constraints on $n$ variables and that the union of the domains in which these
variables take their value is of cardinality $d$. Then, we show that the
implementation of Montanaro's backtracking algorithm can be done by using $O(n
\log d)$ data qubits. We detail an implementation of the predicate associated
to the CSP with an additional register of $O(\log m)$ qubits. We explicit our
implementation for graph coloring and SAT problems, and present simulation
results. Finally, we discuss the impact of the usage of static and dynamic
variable ordering heuristics in the quantum setting.

11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
21
The categories of this paper are: adap-org
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
24
The categories of this paper are: dg-ga
20
The categories of this paper are: acc-phys
27
The categories of this paper are: comp-gas
18
The categories of this paper are: econ
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
2
The categories of this paper are: math