[teawithcarl]

Yes, I believe you catch the gist of it.

It’s a calculation which proves there is indeed a complexity point whereby quantum computing will exceed classical computing ... by proving mathematically that adding enough qubits will suffice that.

Keep in mind this proof still hints at “a class of problems/calculations” which qubits will overwhelm, not a general overwhelming of everything. At least that’s my reading.

Still this mathematical proof is indeed interesting.

[justifier]

gp> it’s a calculation which proves there is indeed a complexity point whereby quantum computing will exceed classical computing

'Prove' is correct for the research but a bit strong for the language of your summary

The important caveat:

tfa> determination of the smallest computational task that is prohibitively hard for today’s classical computers.

'today's classical computers'.. or more timeless: 'contingent on p!=np'