Quantum computers outperform classical ones, with results you can trust

Can we demonstrate the promise of quantum computers on today’s noisy, limited hardware?

That’s a more difficult question than it may first appear. If you generate a result that’s out of reach of today’s regular computers, it may not be possible to verify that you got the right result. And given that today’s quantum computers are somewhat error-prone, getting the wrong result is a distinct possibility. Further, in the absence of a mathematical proof of the capabilities of quantum hardware, it’s possible that a better classical algorithm could outperform the quantum hardware.