Original version With This story appeared in How much warehouse.
For IT specialists, solving problems is a bit like a mountaineer. First, they need to choose a problem – akin to identify the climbing peak – and then they have to develop a strategy to solve it. Classic and quantum researchers compete using various strategies with hearty competition between them. Quantum researchers report a quick way to solve the problem – often by scaling the peak, which no one considered climbing about – then classic teams race or can find a better way.
This competition almost always ends with a virtual draw: when scientists think they have developed a quantum algorithm that works faster or better than anything else, classic researchers usually invent one that equal to it. Last week, alleged quantum acceleration, published in the journal ScienceHe met with immediate skepticism from two separate groups that showed how to do similar calculations on classic machines.
But in an article published on the scientific website of preprint arxiv.org last year, scientists described what it looks like quantum speed, which is both convincing and useful. Scientists have described a fresh quantum algorithm that works faster than all known classic in finding good solutions for a wide class optimization problems (which are looking for the best possible solution among the huge number of choices).
So far, no classic algorithm has dethroned the fresh algorithm known as decoded quantum interferometry (DQI). It’s “a breakthrough in quantum algorithms,” he said Collegemathematician at the University of Reichman i An outstanding skeptic of quantum calculations. Reports about quantum algorithms arouse scientists, partly because they can illuminate fresh ideas on hard problems, and partly because despite all the noise around quantum machines, it is not clear which problems will actually utilize them. The quantum algorithm, which exceeds all known classic in optimization tasks, would be a significant step forward in using the potential of quantum computers.
“I am enthusiastic,” he said Ronald de WolfTheoretical IT specialist at CWI, the National Research Institute for Mathematics and Computer Science in the Netherlands, which was not involved in the fresh algorithm. But at the same time he warned that it is still quite possible that scientists will eventually find a classic algorithm that does it just as well. Due to the lack of quantum equipment, it will take some time before they can empirically test the fresh algorithm.
According to the algorithm, it can inspire fresh work on the classical side Ewin TangIT specialist from the University of California, Berkeley, who gained meaning as a teenager Creating classic algorithms that match quantum. Recent claims “are so interesting that I would tell people with classic algorithms:” Hey, you should look at this article and work on this problem, “she said.
The best way forward?
When classic and quantum algorithms compete, they often do it on the optimization battlefield, a field focused on finding the best options for solving an irritable problem. Scientists usually focus on problems in which the number of possible solutions explodes when the problem becomes greater. What is the best way to visit 10 cities in three days? How should you pack the packages at the back? Classic methods of solving these problems, which often include whipping possible solutions in a clever way, quickly become unsuccessful.
A specific optimization problem, which DQI deals with roughly: you give a collection of points on a piece of paper. You must come up with a mathematical function that goes through these points. In particular, your function must be a polynomial-including variables raised to the exponents of the entire number and multiplied by the coefficients. But this cannot be too complicated, which means that the powers cannot be too high. This gives a curved line that moves up and down when it moves on the side. Your task is to find the Wiglyy line that affects the most points.
The differences in this problem appear in various forms between computer science, especially in coding of errors and cryptography – fields focused on safe and sound and precise data coding as it is sent. DQI researchers decided that deleting a better line is similar to the shift of a clamorous coded message closer to its exact meaning.