Considering the question of whether classical methods can break the current breed of secure algorithms is still open I see pqc as a hedge against the possibility that p=np.
I don't know why this was downvoted. Even if P!=NP there are still other assumptions of hardness baked into modern cryptography which might turn out false. The abelian hidden subgroup problem (which both RSA and elliptic curves are instances) may turn out to have a classical solution.
