[Arkhaine_kupo]

The cutoff is on a complexity level. IBM claims it is linear complexity so that is easily solved in a classical computer, regardless of the time it takes. Google's claim is that it is exponential which means they achieved quantum supremacy or proven a quantum processor that can solve a problem a classical processor cannot.

[htfu]

Yes, but the interesting thing to me is how that cutoff between linear and exponential complexity comes down not to the processor but other computing resources.

Meaning when supremacy soon is demonstrated even accounting for storage, it should be able to be undone for a while yet by, say, appropriating everyone’s phones and fridge storage, Silicon Valley style.