The field of quantum computing is being explored since decades and to this day, it has proven proven its potential to outperform classical computing in certain problems. Many of these promising algorithms have been proposed to tackle search problems. In this thesis, our goal is to expend the field of use of these algorithms by modelling constraint satisfaction problems as search problems. Previous work has been done on how constraint satisfaction problems can benefit from quantum computing to accelerate filtering for "alldifferent" constraints and backtracking. However, our focus in this thesis will be on solving constraint satisfaction problems with arithmetic constraints quantum amplitude amplification.     «

The field of quantum computing is being explored since decades and to this day, it has proven proven its potential to outperform classical computing in certain problems. Many of these promising algorithms have been proposed to tackle search problems. In this thesis, our goal is to expend the field of use of these algorithms by modelling constraint satisfaction problems as search problems. Previous work has been done on how constraint satisfaction problems can benefit from quantum computing to a...     »