# BQP algorithm for two graph bisection problems and its implications on NP $\subseteq$ BQP

If true, this should imply that $NP\subseteq BQP$, which would be very surprising because it is common conjecture that $NP\not\subseteq BQP$. There is even a result that relative to an random oracle, $NP\nsubseteq BQP$ with probability 1.
Is the algorithm in the paper really in BQP? Does the paper really imply that NP $\subseteq$ BQP?