Things I’ve seen, like Shor’s algorithm, have a better chance of finding, say, the private key for any given SHA-256 public key. AFAIK it would not mean they would get the whole rainbow table made GGEZ all at once. More like there’s more of a chance to not strike out all the time so bad when looking for needles in haystacks of haystacks of haystacks due to being able to harness qubits to bring factorial time complexity down to polynomial time