Reply to post:

Google and IBM square off in Schrodinger’s catfight over quantum supremacy

zuckzuckgo Bronze badge

There is a class of problems where checking the answer is trivially easy but finding the answer is very very hard. That is the mathematical foundation of data encryption. It is also the kind of problem quantum computers are supposed to be good at.

A basic example would be finding the square root of an arbitrary very large number. In most cases finding the answer is much harder then testing if it is correct.

POST COMMENT House rules

Not a member of The Register? Create a new account here.

  • Enter your comment

  • Add an icon

Anonymous cowards cannot choose their icon

SUBSCRIBE TO OUR WEEKLY TECH NEWSLETTER

Biting the hand that feeds IT © 1998–2020