However, the best known quantum algorithm for this problem, Shor's algorithm, does run in polynomial time, although this does not indicate where the problem lies with respect to non-quantum complexity classes.
The best known quantum algorithm for this problem does run in polynomial time. This is however. This does not indicate. The problem lies with respect to non-quantum complexity classes. Shor's algorithm is this problem.