Generalized Grover search algorithm for traveling salesman problem (TSP)
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이진형 | - |
dc.date.accessioned | 2021-08-03T22:51:24Z | - |
dc.date.available | 2021-08-03T22:51:24Z | - |
dc.date.created | 2021-06-30 | - |
dc.date.issued | 2008-10-23 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/63446 | - |
dc.description.abstract | The search problem is to find the solution, in a given set, that satisfies certain conditions. Grover algorithm is probabilistic such that quantum states corresponding to solutions are observed in high probabilities and it is faster than any classical ones. Traveling salesman problem (TSP) is to find a minimal-cost tour for given cities. Observing the similarities between the two problems, in this work, we generalize Grover algorithm and attempt to design a quantum algorithm to solve TSP. For the purpose, we introduce rather generalized oracle which marks arbitrary phases on all the quantum states as well as the solutions. The generalized oracle, called a cost oracle, encodes the cost of tours to the arbitrary phases. We show that the probability of getting the quantum state corresponding to the minimal-cost tour can be maximized by adjusting another phase operation. | - |
dc.publisher | 한국물리학회 | - |
dc.title | Generalized Grover search algorithm for traveling salesman problem (TSP) | - |
dc.type | Conference | - |
dc.contributor.affiliatedAuthor | 이진형 | - |
dc.identifier.bibliographicCitation | 한국물리학회 가을 학술논문 발표회 | - |
dc.relation.isPartOf | 한국물리학회 가을 학술논문 발표회 | - |
dc.citation.title | 한국물리학회 가을 학술논문 발표회 | - |
dc.citation.conferencePlace | 광주 | - |
dc.type.rims | CONF | - |
dc.description.journalClass | 2 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.