Quantum

Algorithm Improves D-Wave Quantum Annealer’s Ability To Solve Combinatorial Optimization Problems

Embedding on a special graph of the D-Wave 2000Q by solving a problem like a puzzle in our technique. Credit: Tohoku University

Tohoku University researchers have developed an algorithm that enhances the ability of a Canadian-designed quantum computer to more efficiently find the best solution for complicated problems, according to a study published in the journal Scientific Reports.

Quantum computing takes advantage of the ability of subatomic particles to exist in more than one state at the same time. It is expected to take modern-day computing to the next level by enabling the processing of more information in less time.

The D-Wave annealer, developed by a Canadian company that claims it sells the world’s first commercially available quantum computers, employs the concepts of quantum physics to solve ‘combinatorial optimization .’ A typical example of this sort of problem asks the question: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each and returns to the original city?” Businesses and industries face a large range of similarly complex problems in which they want to find the optimal solution among many possible ones using the least amount of resources.

Ph. D candidate Shuntaro Okada and information scientist Masayuki Ohzeki of Japan’s Tohoku University collaborated with global automotive components manufacturer Denso Corporation and other colleagues to develop an algorithm that improves the D-Wave quantum annealer’s ability to solve combinatorial optimization problems.

The algorithm works by partitioning an originally large problem into a group of subproblems. The D-Wave annealer then iteratively optimizes each subproblem to eventually solve the original larger one. The Tohoku University algorithm improves on another algorithm using the same concept by allowing the use of larger subproblems, ultimately leading to the arrival at more optimal solutions more efficiently.

“The proposed algorithm is also applicable to the future version of the D-Wave quantum annealer, which contains many more qubits,” says Ohzeki. Qubits, or quantum bits, form the basic unit in . “As the number of qubits mounted in the D-Wave quantum annealer increases, we will be able to obtain even better solutions,” he says.

The team next aims to assess the utility of their for various optimization problems.

 

from: https://phys.org/news/2019-04-algorithm-optimizes-quantum-problem-solving.html

 

 

By continuing to use this site, you agree to the use of cookies. Please consult the Privacy Policy page for details on data use. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.

Close