The problem is in theory not as big as it sounds. Quantum computing takes away one exponent. Meaning it reduces a complexity of 2^x to x.
But it also reduces 2xy only to x^y.
And we have cryptography that features that complexity, too.
In practice, quantum computers still are a very tough challenge, because our 2^x algorithms are virtually everywhere, and going through that is a similar effort as was the y2k problem, only with much much much more code, because y2k was 23 years ago
The problem is in theory not as big as it sounds. Quantum computing takes away one exponent. Meaning it reduces a complexity of 2^x to x.
But it also reduces 2xy only to x^y.
And we have cryptography that features that complexity, too.
In practice, quantum computers still are a very tough challenge, because our 2^x algorithms are virtually everywhere, and going through that is a similar effort as was the y2k problem, only with much much much more code, because y2k was 23 years ago