[Gladdyu]

In essence, if this algorithm is correct, for quantum computers it holds that P = NP, which means that every problem for which the answer can be checked in polynomial time, you can also compute the answer in polynomial time.

[marcosdumay]

Polynomial time in a quantum computer is called QP. (The same way that polynomial time in a non deterministic computer is called NP.)

[jflatow]

Isn't it actually only showing that BQP contains NP, not P = NP?