Proper Cost Hamiltonian Design for Combinatorial Optimization Problems: A Boolean Function Approach

Aeho Choi, Seunghyeok Oh, Soohyun Park, Jong Kook Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Advanced researches on the variational quantum algorithms are actively conducted. In particular, the quantum approximate optimization algorithm (QAOA) is one of the promising variational quantum algorithms and can be applied to various graph-based problems, and is a promising algorithm that shows good performance even in small quantum computers. As is widely known, QAOA obtains the approximate solution via the expectation value of the cost Hamiltonian on the parameterized state. Therefore, in addition to finding the optimal parameters, the proper design of the cost Hamiltonian is important. This paper designs the cost function of the combinatorial optimization problem via Boolean function and maps it to the proper cost Hamiltonian. The proposed cost Hamiltonian design method is applied to the maximum independent set (MIS) and minimum dominating set (MDS) problems.

Original languageEnglish
Title of host publication35th International Conference on Information Networking, ICOIN 2021
PublisherIEEE Computer Society
Pages469-472
Number of pages4
ISBN (Electronic)9781728191003
DOIs
Publication statusPublished - 2021 Jan 13
Externally publishedYes
Event35th International Conference on Information Networking, ICOIN 2021 - Jeju Island, Korea, Republic of
Duration: 2021 Jan 132021 Jan 16

Publication series

NameInternational Conference on Information Networking
Volume2021-January
ISSN (Print)1976-7684

Conference

Conference35th International Conference on Information Networking, ICOIN 2021
CountryKorea, Republic of
CityJeju Island
Period21/1/1321/1/16

Keywords

  • MDS
  • MIS
  • QAOA

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Fingerprint Dive into the research topics of 'Proper Cost Hamiltonian Design for Combinatorial Optimization Problems: A Boolean Function Approach'. Together they form a unique fingerprint.

Cite this