A quantum algorithm for solving the classical NP-complete problem - the Ham
ilton circuit is presented. The algorithm employs the quantum SAT and the q
uantum search. algorithms. The algorithm is square-root faster than classic
al algorithm, and becomes exponentially faster than classical algorithm if
nonlinear quantum mechanical computer is used.