Quantum Approximation for Wireless Scheduling
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Jaeho | - |
dc.contributor.author | Oh, Seunghyeok | - |
dc.contributor.author | Kim, Joongheon | - |
dc.date.accessioned | 2021-08-30T13:50:17Z | - |
dc.date.available | 2021-08-30T13:50:17Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2020-10 | - |
dc.identifier.issn | 2076-3417 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/53030 | - |
dc.description.abstract | This paper proposes an application algorithm based on a quantum approximate optimization algorithm (QAOA) for wireless scheduling problems. QAOA is one of the promising hybrid quantum-classical algorithms to solve combinatorial optimization problems and it provides great approximate solutions to non-deterministic polynomial-time (NP) hard problems. QAOA maps the given problem into Hilbert space, and then it generates the Hamiltonian for the given objective and constraint. Then, QAOA finds proper parameters from the classical optimization loop in order to optimize the expectation value of the generated Hamiltonian. Based on the parameters, the optimal solution to the given problem can be obtained from the optimum of the expectation value of the Hamiltonian. Inspired by QAOA, a quantum approximate optimization for scheduling (QAOS) algorithm is proposed. The proposed QAOS designs the Hamiltonian of the wireless scheduling problem which is formulated by the maximum weight independent set (MWIS). The designed Hamiltonian is converted into a unitary operator and implemented as a quantum gate operation. After that, the iterative QAOS sequence solves the wireless scheduling problem. The novelty of QAOS is verified with simulation results implemented via Cirq and TensorFlow-Quantum. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | MDPI | - |
dc.subject | WEIGHTED INDEPENDENT SET | - |
dc.title | Quantum Approximation for Wireless Scheduling | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Joongheon | - |
dc.identifier.doi | 10.3390/app10207116 | - |
dc.identifier.scopusid | 2-s2.0-85092785663 | - |
dc.identifier.wosid | 000586149600001 | - |
dc.identifier.bibliographicCitation | APPLIED SCIENCES-BASEL, v.10, no.20 | - |
dc.relation.isPartOf | APPLIED SCIENCES-BASEL | - |
dc.citation.title | APPLIED SCIENCES-BASEL | - |
dc.citation.volume | 10 | - |
dc.citation.number | 20 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Chemistry | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Materials Science | - |
dc.relation.journalResearchArea | Physics | - |
dc.relation.journalWebOfScienceCategory | Chemistry, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Engineering, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Materials Science, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Physics, Applied | - |
dc.subject.keywordPlus | WEIGHTED INDEPENDENT SET | - |
dc.subject.keywordAuthor | quantum approximate optimization algorithm (QAOA) | - |
dc.subject.keywordAuthor | maximum weight independent set (MWIS) | - |
dc.subject.keywordAuthor | NP-hard | - |
dc.subject.keywordAuthor | wireless scheduling | - |
dc.subject.keywordAuthor | quantum application | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
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.