Quantum computers reach “unconditional supremacy”

A quantum computer professor at the University of Texas, USA, called William Kretschmer, along with his team, completed an experiment that would demonstrate the so -called “unconditional supremacy” of quantum computers.

The expression “unconditional supremacy” refers to a permanent advantage of quantum machines above the classics.

In other words, for specific tasks, a quantum computer will always be more efficient than any traditional possible computer.

According to researchers, their «result is demonstrable and permanent: no future development in classic algorithms You can close this gap ».

In addition, they claim that the advantage obtained It cannot be eliminated by future advances in traditional computing.

What did the experiment try to demonstrate that quantum supremacy?

He experimentpublished on September 19, was held with 12 cubits (Qubits In English, basic units of quantum information) built from laser controlled ions by the company Quantinuum.

The design was based on a problem of complexity of communication, a branch of mathematics that Study efficiency in the exchange of information between two parts.

In the experiment, the researchers divided the quantum computer into two parts, which they called “Alice” and “Bob.”

It can be thought of as a riddle game: Alice prepares a letter with a secret message and sends it to Bob. Bob’s task is to decide How to look at that letter to discover the hidden message and give an answer.

When repeating this exchange thousands of times, Alice and Bob were perfecting their methods until they anticipate with great precision what would be Bob’s response even before Alice revealed her letter.

According to the report, this dynamic It was repeated 10,000 times To refine the communication protocol.

The final result showed that no classic computer with less than 62 bits capacity could match The efficiency of this 12 -tank machine.

Even on the most favorable stage, a classic system would need 330 bit to perform the same task, which equivalent to almost 30 times more computational effort to achieve comparable performance.

Ashley Montanaroquantum computer professor at the University of Bristol, he commented on the results:

“This is a notable scientific finding that shows that the panorama of the ‘quantum advantages’ is broader than what was thought. Unlike most demonstrations of quantum advantage or supremacy, here there is no possibility that a better classic algorithm appears: it is impossible.”

Ashley Montanaro, a quantum computer professor at the University of Bristol board.

For Wolf Ronaldof the Institute of Mathematics and Computing Sciences of the Netherlands, the essay reflected how recent advances in quantum computers allow to apply mathematical theories that had been developing decades.

In simple terms, the relevance of this study is that, at least in that specific type of experiments, quantum computers demonstrated performance that classic systems could never reachregardless of how optimized they are in the future.

This notion of “unconditional supremacy” marks a contrast to what was previously called “quantum supremacy”, which was sometimes questioned when classic solutions capable of matching certain results were discovered.

The new evidence, on the other hand, reinforces the idea that quantum computing opens a land in which the classic machines, however optimized they are, They cannot compete.

Source link