{"id":1049353,"date":"2026-09-07T18:59:22","date_gmt":"2026-09-07T18:59:22","guid":{"rendered":"https:\/\/www.europesays.com\/us\/1049353\/"},"modified":"2026-09-07T18:59:22","modified_gmt":"2026-09-07T18:59:22","slug":"quantum-computers-just-passed-a-test-that-classical-computers-fundamentally-cant-sciencealert","status":"publish","type":"post","link":"https:\/\/www.europesays.com\/us\/1049353\/","title":{"rendered":"Quantum Computers Just Passed a Test That Classical Computers Fundamentally Can’t : ScienceAlert"},"content":{"rendered":"

Quantum computers<\/a> are supposed to have abilities far beyond conventional ones, but verifying that they actually do is surprisingly difficult \u2013 because checking their results can itself require computations that become prohibitively difficult for classical machines.<\/p>\n

This is the quantum verification problem<\/a>, and a new experiment has found an ingenious workaround \u2013 a game that puts each type of system to the test.<\/p>\n

The catch? There’s a mathematically proven limit to how well any classical computer can perform.<\/p>\n

And when a team led by computer scientists Marcello Benedetti and Harry Buhrman of Quantinuum in the UK ran it on a trapped-ion quantum system, it sailed right past the limit with ease.<\/p>\n

And as the test became more difficult, the chasm between the quantum system’s performance and the best possible classical performance yawned ever wider, according to their paper published in Nature Communications<\/a>.<\/p>\n

\"YouTube frameborder=”0\u2033 allow=”accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share” referrerpolicy=”strict-origin-when-cross-origin” allowfullscreen><\/p>\n

Quantum computers derive their unusual abilities from the strange physics that governs particles on the smallest scales.<\/p>\n

Where the bits in a classical computer represent information as one of two states \u2013 a 1 or a 0 \u2013 quantum bits, or qubits, can exist in a superposition of both until they are measured. Measurement collapses that superposition, yielding just one definite outcome.<\/p>\n

The mathematical nature of that superposition can be incredibly powerful from a computational standpoint, allowing a quantum computer<\/a> to make short work of certain problems that are enormously difficult for a conventional computer.<\/p>\n

It was the computational power of superposition that the researchers set out to test.<\/p>\n

So, they devised a game based on a computational task called complement sampling<\/a>.<\/p>\n

Here’s how it works. Imagine all the possible answers to a problem are secretly divided into two equal groups, A and B. You’re given one randomly selected answer from group A, and challenged to return an answer from group B.<\/p>\n

For a classical computer, that’s not really enough to go on. It knows the answer it was given belongs to A, so it knows not to return that one. But it doesn’t know which of all the other possible answers belong to A and which belong to B.<\/p>\n

\"QuantumA glimpse of the complex optical systems behind Quantinuum’s trapped-ion quantum computers. (Quantinuum<\/a>)<\/p>\n

The more possible answers there are, the less useful that single piece of information becomes. In fact, the researchers were able to mathematically prove exactly how well the best possible classical strategy could perform.<\/p>\n

A quantum computer, however, gets to play by very different rules.<\/p>\n

Because a superposed qubit can be both of its states at once until it is measured, the quantum computer can receive a state containing the entire set A in superposition, rather than reducing the answer to a single sample.<\/p>\n

And, crucially, it can manipulate that superposition before measuring it. Using what the researchers call a “swapper” circuit, the quantum computer transforms the state representing set A into one representing its complement, set B.<\/p>\n

Only then does it measure the state, producing an answer from set B. In an ideal, error-free quantum system, this strategy wins every time.<\/p>\n

For a classical computer, the task is exponentially more difficult. It needs to measure the incoming state to obtain one randomly selected answer from group A, then try to return an answer from group B.<\/p>\n

This creates a huge gap between what the two types of systems are capable of.<\/p>\n

While an ideal quantum system wins every round, the advantage available to even the best possible classical strategy shrinks exponentially as the number of bits \u2013 and therefore the number of possible answers \u2013 increases.<\/p>\n

And that’s not just because the researchers haven’t found a sufficiently clever classical algorithm. The limit is mathematically proven, without relying on assumptions about how difficult the computation might be.<\/p>\n

This gave the team something unusually valuable \u2013 a test whose answers are easy to verify, but whose classical performance has a hard ceiling. So they took it to a real quantum computer.<\/p>\n

\"QuantumAs the size of the problem increased, the quantum computer’s performance remained beyond the classical limit, with the gap between quantum and classical performance growing exponentially. (Benedetti et al., Nat. Commun., 2026)<\/p>\n

The researchers ran the complement sampling game on Quantinuum’s H2 trapped-ion quantum computers, using thousands of different circuits and scaling their experiments up to 55 qubits.<\/p>\n

The real machines weren’t, of course, as perfect as the theory. As the experiments grew larger and required more quantum operations, hardware noise increasingly degraded their performance.<\/p>\n

But the quantum system still consistently cleared the classical limit.<\/p>\n

In every experiment, the quantum computer scored so well that its results were statistically inconsistent with what any classical strategy could have achieved.<\/p>\n

Better yet, as the problem grew more difficult, the gap widened. The experimentally observed advantage increased exponentially with bit-string length, closely tracking, if not quite matching, the behavior expected of the optimal quantum strategy.<\/p>\n

At the largest scale tested \u2013 37-bit strings \u2013 the system didn’t quite achieve the theoretical ideal performance, but the results still demonstrated an “exponentially large violation of classicality,” the researchers note<\/a>.<\/p>\n

The experiment does have some limitations.<\/p>\n

\"Subscribe<\/a><\/p>\n

The “referee” that chooses the initial answer and the “player” that analyzes it and gives the complement were implemented on the same quantum computer, with quantum teleportation used to simulate the communication channel between them.<\/p>\n

Related: <\/strong>Quantum Teleportation Was Achieved Over The Internet For The First Time<\/strong><\/a><\/p>\n

A more rigorous future test would put them on separate quantum computers connected by a genuine quantum communication channel.<\/p>\n

But that’s an obstacle that can be surmounted in the next round of experiments.<\/p>\n

For now, the result provides a proof of concept, a new way to test quantum hardware that is efficient to verify, scalable, and \u2013 importantly \u2013 doesn’t rest on unproven assumptions about what classical computers can and can’t do.<\/p>\n

“Our test,” the researchers write, “demonstrates the power of quantum superposition in a manner that is oblivious to entanglement<\/a> and non-locality.”<\/p>\n

The findings have been published in Nature Communications<\/a>.<\/p>\n

This article was fact-checked by Fiona MacDonald<\/a> and edited by Fiona MacDonald<\/a>. While we pride ourselves on our process, we are only human. If you spot a mistake, please let us know<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"Quantum computers are supposed to have abilities far beyond conventional ones, but verifying that they actually do is…\n","protected":false},"author":3,"featured_media":1049354,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":"","_share_on_mastodon":"0"},"categories":[8],"tags":[352,159,67,132,68],"class_list":["post-1049353","post","type-post","status-publish","format-standard","has-post-thumbnail","category-science","tag-msft-content","tag-science","tag-united-states","tag-unitedstates","tag-us"],"share_on_mastodon":{"url":"https:\/\/pubeurope.com\/@us\/117231300930731920","error":""},"_links":{"self":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts\/1049353","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/comments?post=1049353"}],"version-history":[{"count":0,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts\/1049353\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/media\/1049354"}],"wp:attachment":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/media?parent=1049353"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/categories?post=1049353"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/tags?post=1049353"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}