Adiabatic quantum computation solves satisfiability problems and other combinatorial search problems. Specifically, these kind of problems seek a state that satisfies C 1 ∧ ∧ C 2 ∧ ∧ ⋯ ⋯ ∧ ∧ C M . This expression contains the satisfiability of M clauses, for which clause C i has the value True or False, and can involve n bits. Each bit is a variable x j ∈ ∈ { 0 , 1 } such that C i is a Boolean value function of x 1 , x 2 , … … , x n . QAA solves this kind of problem using quantum adiabatic evolution. It starts with an Initial Hamiltonian H B :