  Going as far as possible at SAT problem solving is the main aim of our work.
For this sake we have made use of quantum computing from its two, on practice,
main models of computation. They have required some reformulations over the
former statement of 3-SAT problem in order to accomplish the requirements of
both techniques. This paper presents and describes a hybrid quantum computing
strategy for solving 3-SAT problems. The performance of this approximation has
been tested over a set of representative scenarios when dealing with 3-SAT from
the quantum computing perspective.
