Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions solved backtracking tree search augmented logical inference. this paper, we show how quantum algorithms can accelerate at both the levels of inference search. Leveraging existing algorithms,...