A Quantum Algorithm for Minimum Steiner Tree Problem
| Language | English |
|---|---|
| Type | Proceedings of International Conferences |
| Authors | Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise |
| Title | A Quantum Algorithm for Minimum Steiner Tree Problem |
| Journal | Proc. 19th Asian Quantum Information Science Conference (AQIS2019) |
| Number of pages | 2 |
| Location | Seoul, Korea |
| Reviewed | Reviewed |
| Presentation type | Poster |
| Date | August 2019 |
| Research fields | Quantum Computing |
| Key | Miyamoto2019_AQISa (id=1680) |
Abstract
Minimum Steiner tree problem is a well-known NP-hard problem. For the minimum Steiner tree problem in graphs with $n$ vertices and $k$ terminals, there are many classical algorithms that take exponential time in $k$. In this paper, to the best of our knowledge, we propose the first quantum algorithm for the minimum Steiner tree problem. The complexity of our algorithm is $\mathcal{O}^*(1.812^k)$. A key to realize the proposed method is how to reduce the computational time of dynamic programming by using a quantum algorithm because existing classical (non-quantum) algorithms in the problem rely on dynamic programming. Fortunately, dynamic programming is realized by a quantum algorithm for the travelling salesman problem, in which Grover's quantum search algorithm is introduced. However, due to difference between their problem and our problem to be solved, recursions are different. Hence, we cannot apply their technique to the minimum Steiner tree problem in that shape. We solve this issue by introducing a decomposition of a graph proposed by Fuchs et al.
Note
Files
- …
Export this publication
Format definition
How to write the definition
Insert a field with braces like {authors}. A part enclosed in [ ... ] is omitted entirely when any field inside it is empty. Available fields:
{authors}{authors_and}{authors_ja}{authors_ja_tight}{authors_en}{authors_en_and}{authors_tight}{first_author}{title}{title_ja}{title_en}{journal}{journal_ja}{journal_en}{book_title}{volume}{number}{series}{presen_id}{pages}{pp}{num_pages}{year}{month}{month_en}{month_short}{ym}{date}{date_ja}{date_en}{publisher}{address}{location}{review}{review_ja}{review_en}{reviewed_mark}{presen_type}{type}{type_label}{doi}{url}{key}{awards}