This work presents a quantum search algorithm to solve the 3-SAT problem. An improvement over one of the best known classical algorithms for this problem is proposed, replacing the local search with a quantum search algorithm. The performance of the improved algorithm is assessed by simulating it using parallel programming techniques with shared memory. The experimental analysis demonstrate that the parallel simulation of the algorithm takes advantage of the available computing resources to improve over the eficiency of the sequential version, thus allowing to perform realistic simulations in reduced execution times.Sociedad Argentina de Informática e Investigación Operativ
