A New Quantum Algorithm Speeds Up Solving a Huge Class of Problems

Original version one This story appeared How many magazines.

Solving problems for computer scientists is like a little mountaineering. They must choose a problem to solve a problem to set a pic first and then develop a strategy to solve it. Classical and quantum researchers compete using different strategies with healthy competition between two. Quantum researchers believe that a quick way to solve a problem is that no one is worth climbing, then a summit to see that classic teams can find a better way

This competition ends almost always as a virtual tie: when researchers think of the quantum algorithm than everything or better work, classical researchers generally come with someone equal to it. A quantum acceleration published in the magazine last week ScienceIt was immediately doubted from two separate groups showing how to perform similar calculation in classic machines.

However, on a piece of paper placed on the website of the Scientific Protection site last year, researchers described the visible A quantum acceleration that is both convincing and useful. Researchers described a new quantum algorithm that works faster than all the best solution, looking for a wide range of a wide range of wide optimization problems (the best solution for selection.

So far, the classic algorithm has not killed a new algorithm known as the code interferfetry (DQA). This “is a progress in quantum algorithms,” he said CollegeA mathematician at Reichman University and The outstanding skeptic of quantum calculation. Quantum algorithms reports are partially and partly because they can illuminate new ideas about researchers, partial problems, because it is not clear that they will benefit from them for all the noises around quantum. A quantum algorithm that prefers all known classical ones on optimization tasks, will represent a great step in applying the potential of quantum computers.

“I am enthusiast about this,” he said Ronald de monsterNational Research Institute in the Netherlands, National Research Institute in the Netherlands, a theoretical scientist that is not related to the new algorithm. But at the same time, he will still find a classic algorithm that the researchers are still possible. Because of the lack of quantum hardest, the new algorithm will be empirically before testing.

Algorithm may inspire new job on the classic side Ewin tangAt the University of California, a computer scientist, Berkeley, became popular as a teenager Create classic algorithms that fit the quantum. New allegations “are interested enough to tell people the classic algorithms, ‘Hey, you should look at this paper and work on this problem,’ he said.

The best way forward?

When the classic and quantum algorithms are competing, often in optimization combat zone, it does it over an area to find the best options to solve a structural problem. Researchers are usually due to the number of the number of possible solutions as the problem increases. What is the best way for a delivery machine to visit 10 cities within three days? How should you pack parcel behind? Classical methods of solving these problems that often smartly flush through possible solutions are inconsistent.

The special optimization problem that solves DQA is about: a collection of points on a sheet of paper. It is necessary to meet a mathematical function passing through these points. In particular, your function must be a polynomial – the combination of variables raised to all numbered exponents and increased with coefficients. But there can be no complex, that is, the powers cannot be very high. This gives a curved line that is up and down as it moves on the page. Your job is to find a wiggly line touching the most points.

The changes in this problem, especially in various forms in the fields of misconceptions and cryptography, are focused on various forms, as transmitted to secure and accurate coding. DUSI researchers are mainly recognized that it is a better line, the noisy coded message is known to bring it closer to the exact meaning.