Quantum annealing can beat classical computing in limited cases
Bin Yan (left) and Nikolai Sinitsyn (right) developed an analytical proof based on quantum theory constraining the conditions under which a quantum annealing computer can outperform a classical computer, but only when specific conditions are met. Credit: Los Alamos National Laboratory

According to recent research, quantum computers can run faster than classical computers. When time is limited, a speed-up is not provided by quantum annealing.

We proved that you can reach a fast solution from the initial problem, but that's only true for a certain class of problems that can be set up so that the history of evolution of the quantum system doesn't interfere. The authors of the paper said that the different quantum histories enhance each other's chances of reaching the solution.

There are some examples of superior quantum performance that don't have proof. Researchers can infer that they have achieved quantum advantage, but they can't prove it. Results are often conflicting.

A quantum state can be transformed into a state with a computation. This process is used in just a small number of quantum programs. quantum computing is dependent on the interference of different system histories during computation. One can tune the time- dependent path for specific problems. The quantum algorithms are used in the quantum computer. Such interference is not guaranteed by them.

The problem can be solved during infinite time. Calculating time is always limited in practice. The researchers hope that quantum effects reduce the number of errors.

Sinitsyn and BinYan created a purely analytical approach to demonstrate a simple untuned process that can be used to solve any problem that can be considered by a quantum computer. At any point in the computation's run time, the accuracy can be measured.

The performance of a classical algorithm is almost always better than this one.

When many different quantum histories, which are simultaneously experienced by a quantum processor, interfere to amplify the useful information in the final state, quantum computing relies on quantum effects. The proper interference is unlikely without fine tuning. The niche for superior quantum computing is rare.

An observation that the considered process does not encounter the so-called spin glass transition is an inspiring one.

The approaches to quantum computing need to be considered with a lot of care.

Journal information: Nature Communications