BQP algorithm for two graph bisection problems and its implications on NP $\subseteq$ BQP
Another paper with the same idea by Ahmed Younes and Jonathan E. Rowe, A Polynomial Time Bounded-error Quantum Algorithm for Boolean Satisfiability. The algorithm is not polynomial time.