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 res

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'