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

Original version Of This is the story Present How many magazinesThe

For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve – Ack to identify the top of the climb and then they must develop a strategy to solve it. Classical and quantum researchers compete using various techniques, including a healthy challenge. Quantum researchers have reported a quick way to solve a problem – often a peak scale that no one feels like climbing – then the classical parties rush to see if they can find better ways.

This competition almost always ends as a virtual tie: when researchers think they have created a quantum algorithm that works faster or better than anything else, classical researchers usually bring about one equal. Just last week, a planned quantum speedup published in the journal ScienceWere seen with instant skepticism from two separate groups who showed how to perform Similar Calculation In the classical machine.

However, in a research paper posted on the scientific preprint site RXV.RG last year, researchers described what it looks like A quantum speedup that is both in the sight and usefulThe Researchers describe a new quantum algorithm that works faster than all familiar classmates to look for good solutions for a wide -class optimization problem (which are looking for the best possible solution in a large number of choices).

Until now, no classical algorithm has reduced the new algorithm, known as the decoded quantum interferometry (DQI). This is “a progress of quantum algorithm,” says CollegeReichman is a mathematician of the university and Quantum computing is a prominent skepticThe Quantum algorithm reports make researchers excited, partially because they can illuminate new ideas about difficult problems and partially, for all the rumors around the quantum machines, it is not clear which problems will actually benefit from them. A quantum algorithm that exceeds all known class of people in optimization functions will represent a major step in achieving the potential of quantum computer.

“I’m passionate about it,” says Ronald de WolfA CWI theoretical computer scientist, the National Research Institute for Mathematics and Computer Science in the Netherlands, who was not involved with the new algorithm. But at the same time, he warned that this is still possible researchers will finally find a classical algorithm that works well. And due to the lack of quantum hardware, it will be some time before they can examine the new algorithm with experience.

Algorithms may inspire the new work on the classical aspect, according to Yoin tangA computer scientist at the University of California, Berkeley, who gained fame as a teenager Creating a classical algorithm that matches the quantumThe The new claims are “interesting enough that I will tell the classical-algorithm people, ‘Hey, you should see this paper and work on this problem,” “he said.

The best way to move forward?

When the classical and quantum algorithms compete, they often do this in the battlefield of the optimization, a field focuses on looking for the best options to solve a fork problem. Researchers usually concentrate on problems where the number of potential solutions explodes as the problem is even bigger. What is the best way to visit 10 cities in three days of delivery truck? How should the parcels be packed behind? These problems are the classical methods to solve, which often involve churning through potential solutions in clever ways, quickly become ineligible.

The specific optimization problem that DequiI deal with is roughly: You have been given points on a paper sheet. You need to come up with a mathematical function that goes through these points. Specifically, your function has to be a twin year-multiplied by a combination of variables grown in exponents of Puro Number. However, it cannot be very complicated, which means that the energy cannot be too much. It gives you a bend line that wiggles up and down as soon as the page goes across. Your job is to look for the Wigley Line that touches the maximum points.

The variations of this problem are displayed in various forms across computer science, especially in errors coding and cryptography – the fields focus on securely and accurately encoding data infections. DCI researchers originally recognized that a better line conspiracy was similar to the transfer of a noise encoded message to its right meaning.