Quantum computers outperform classical ones, with results you can trust
摘要
IBM在量子计算领域取得新进展，其量子优势追踪器新增三项成果，分别采用不同方法克服错误并验证量子结果。当前量子计算机因硬件噪声和规模限制，难以运行理论上可超越经典计算机的算法，且结果验证困难——若结果超出经典计算机处理范围，可能无法确认其正确性；同时，量子硬件易出错，且缺乏数学证明时，更优的经典算法可能反超量子性能。IBM指出，在无法进行经典模拟的情况下，实
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 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.
These issues inspired IBM to launch a quantum advantage tracker. On Thursday, the company announced three new entries that it says clearly show a quantum advantage, each using a different approach to overcoming errors and validating quantum results. "Trusted computing when you can do classical simulations is irrelevant," IBM's Jay Gambetta told Ars. "Trusted computing when you can't do classical simulations is a big deal."
转载信息
评论 (0)
暂无评论，来留下第一条评论吧