Not necessarily. It could be that ECDLP (Elliptic Curve Discrete Log Problem) is not as hard as we thought. It's not inconceivable that it's in P (Polynomial t

Not necessarily. It could be that ECDLP (Elliptic Curve Discrete Log Problem) is not as hard as we thought. It's not inconceivable that it's in P (Polynomial time). In fact, if we were to see current algorithms being broken right now, I think it's more likely to be due to a classical algorithm breakthrough than by quantum algorithms running on an actual large scale quantum computer with hundreds or thousands of logical (i.e. practically error-free) qubits.