He seems to be misunderstanding Scott as claiming that no quantum computers will beat classical ones (even for factoring and the like), whereas Scott only makes the claim for NP-complete problems.
That said, it is unclear how far Adiabatic notions will take us but it seems there are limits there too with respect to the spectral issues.