Sorry if this seems off topic, the cstheory guys told me it was off topic over there, and sent me here.
Shor's algorithm on a quantum computer can solve an integer factorization problem in polynomial time. So why is this problem considered to not be in P? Do quantum computers not count? I have looked around and see some discussion on the matter, but no clear answers.