If Grovers "roots" the bit strength of hash functions/sym crypto, what does shors do to ECC?

I appreciate modern ECC is essentially only as strong as half the bit strength of the curve group (subgroup) due to Pollard's Rho.

Given Grovers essentially roots the bit strength of hash functions and symmetric crypto (256->128), what does it do to ECC? Do we have an intuition as to the PQ bit strength more than just "polynomial time"?