If Quantum Computing Is Solving “Impossible” Questions, How Do We Know They’re Right? “In order to validate quantum computers, methods are needed to compare theory and result without waiting years for a supercomputer to perform the same task.”
Advertise here with Carbon Ads
This site is made possible by member support. 💞
Big thanks to Arcustech for hosting the site and offering amazing tech support.
When you buy through links on kottke.org, I may earn an affiliate commission. Thanks for supporting the site!
kottke.org. home of fine hypertext products since 1998.
Beloved by 86.47% of the web.
Comments 1
This headline sounds like a question on a computer science exam.
Many computer science problems, including the most prominent ones proposed for quantum computers, are difficult to solve but easy to verify.
For example, guessing a random password requires trying a large percentage (half, on average) of the possible passwords. But verifying the correct password requires trying just the one result. A lot of tricky problems are like that.
If you feel like this comment goes against the grain of the community guidelines or is otherwise inappropriate, please let me know and I will take a look at it.
This thread is closed for new comments & replies. Thanks to everyone for participating!