Assuming P=BQP (ie we have polynomial time algorithms to solve all BQP problems) can we use it to prove that P=NP?

The argument is that since we have the Grover's algorithm which can solve NP complete problems with a quadratic speedup and since we have assumed that P=BQP, we can apply the Grovers algorithm repeatedly until it is reduced to a polynomial time problem.