Ars Technica

Quantum computers outperform classical ones, with results you can trust

image-4-1152x648-1

There are many algorithms for which it has been mathematically proven that a quantum computer can generate results that would take a classical computer an unreasonable amount of time to generate. Unfortunately, today’s quantum computers either can’t run those algorithms or can only run simplified versions that classical computers can also handle. This has left the field facing a challenging question: 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…

Continue reading at Ars Technica arstechnica.com
Advertisement