The original version Injured This story I appeared How much magazine is.
For computer scientists, solving problems is a bit like a climber. First they have to choose one problem to solve – to identify the peak to climb – and then develop a strategy to solve them. Classic and quantum researchers fight with various strategies with healthy enmity. Quantum researchers report a fast way to solve a problem – often scaling the peak that no one was able to climb – then the classic teams ran to see if they could find a better way.
This competition almost always ends as a virtual tie: When researchers believe that they have developed a quantum algorithm that works faster or better than anything, classical researchers usually meet with what is equal to it. Just last week, a desired quantum speed -up published in the journal ScienceTwo separate groups met with immediate doubts that showed how to perform Likewise Account On classical machines.
But in an article published on the Scientific Print Print Site Arxiv.org last year, researchers told A quantum speed -up that is convinced and useful. Researchers describe a new quantum algorithm that works faster than all well -known classic, which looks for a good solution for wide -class correction issues (which find a huge potential solution to a large number of selection).
So far, no classic algorithm has eliminated the new algorithm, called the Decoded Quantum Interface (DQI). This is “a breakthrough in the quantum algorithm.” CollegeA mathematician at Reichman University and A significant skeptical of quantum computing. Quantum algorithms report enthusiasts to researchers, partially because they can illuminate new ideas about difficult problems, and partially, for all the resonance of quantum machines, it is unclear which issues will really benefit them. A quantum algorithm that improves all well -known classic on correction work will represent an important step in exercising the ability of quantum computers.
“I’m passionate about it,” Ronald de WolfThe National Research Institute for Mathematics and Computer Science, CWI, in the Netherlands, a theoretical computer scientist, who was not included in the new algorithm. But at the same time, he warned that it is still quite possible. Researchers will eventually get a classic algorithm who does exactly. And due to the lack of quantum hardware, before they can test the new algorithm.
According to, the algorithm may encourage new work on the classic aspect Avon TangBerkeley, a computer scientist at the University of California, who came to fame as a teenager Creating a classic algorithm that meets quantum. “The new claims are so interesting that I will tell the classic-al-Gortham people, ‘Hey, you should look at this article and work on this issue,” he said.
The best way forward?
When the classic and quantum algorithms compete, they often do so in the battlefield, a field that focuses on finding the best powers to solve the thorny problem. Researchers generally focus on issues in which the number of potential solutions to the problem increases. What is the best way to visit 10 cities in three days for a delivery truck? How should you pack the parcel into the back? The classic ways of solving these problems, which often include transition through potential solutions in smart ways, is quickly unbearable.
The issue of specific correction that is dealt with by DQI is almost: You have been given a combination of points on a paper sheet. You need to come with a mathematical event that goes through these points. In particular, your function must be a multinational. But it cannot be more complicated, that is, powers cannot be high. This gives you a curved line that walks up and down all over the page. Your job is to find a vigilant line that touches the most points.
The variations of this problem appear in different forms in computer science, especially in error coding and encryption – fields that are focused on secure and accurately encoding data as it moves. Basically, DQI researchers recognized that planning a better line is like moving a noise -encoded message closer to its true meaning.