Speeding up search algorithms with Quantum Computing

Résumé

This thesis focuses on algorithms over Quantum computing applied over NP hard search problems on domains lacking of any order. The partition problem has been addressed as first stage so providing a piece of quantum computing code which amplifies the amplitude of the solution state noticeably. This work continues addressing the problem of the satisfiability of Boolean formulas, in particular 3-SAT, from hybrid computation perspectives over both classical / quantum and purely quantum computing. There have been proposed strategies which include the definition of own heuristics and own metrics. The application of these strategies has meant a review of Grover's algorithm that has led to propose different methods of modifying it