New algorithm optimizes quantum computing problem-solving
A Canadian quantum computer can solve complex problems more efficiently with an algorithm developed in Japan
- Date:
- April 10, 2019
- Source:
- Tohoku University
- Summary:
- Researchers have developed an algorithm that enhances the ability of a quantum computer to more efficiently find the best solution for complicated problems.
- Share:
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 quantum 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 problems.'. 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 city and returns to the origin 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.
PhD 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 original 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 quantum computing. "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 algorithm for various optimization problems.
Story Source:
Materials provided by Tohoku University. Note: Content may be edited for style and length.
Journal Reference:
- Shuntaro Okada, Masayuki Ohzeki, Masayoshi Terabe, Shinichiro Taguchi. Improving solutions by embedding larger subproblems in a D-Wave quantum annealer. Scientific Reports, 2019; 9 (1) DOI: 10.1038/s41598-018-38388-4
Cite This Page: