This is a super iffy comment. Please don’t hurt me ;)
Quantum computers fundamentally don’t break everything, just things that depend on problems that can be treated polynomial with respect to time, if you can also be polynomial in terms of state.
Eg there is currently no known way to break any of the major symmetric encryption algorithms (aes etc) beyond bruteforcing, which is faster on a classical machine.
I believe that similar applies to general case of hashing.
Things get wonky once you can convert a O(x^N) problem into a O(N^x) problem with state(N^x).
That’s functionally how things like shore’s algorithm works - each qubit can represent a functionally infinite number of values so you can move from other wise expentional number of components to a polynomial amount, so you can do a pile of math and get a “probably correct” solution to the DLP, which is the core problem for all current assymetric encryption algorithms.
What IBM is presumably trying to say is that all assymteric algorithms are broken if you can get a functional quantum computer, which means getting 1000s of qubits into a quantum state and maintaining that state through a large computation. If that happens then any data that has been archived and encrypted with an assymetric algorithm can be decrypted.
Any problem that also depends on DLP (all the crypto coins for instance) is likewise broken.