Not a computer scientist. This part, in particular seems hokey:

"In their new paper, Google demonstrated that their 53-qubit quantum computer performs a certain specialized computation (called “random circuit sampling”) in fast polynomial time. Meanwhile, there’s no evidence that any classical computer can perform the same task in anything better than slow exponential time."

An n^2 computation vs. a 2^n computation is a function of the algorithm used, not the machine on which it runs. Perhaps Google's Quantum computer unlocks new algorithmic approaches? But, I doubt it; wouldn't this mean Turing's thesis is incomplete? Maybe/probably I'm missing something, but the article certainly doesn't cut through that fog.