Experimental Evaluations of Parallel Tempering on an Ising Machine

• Mukasa Yosuke

  Department of Computer Science and Communications Engineering, Waseda University

• Tanaka Shu

  Department of Applied Physics and Physico-Informatics, Keio University Green Computing System Research Organization, Waseda University

• Togawa Nozomu

  Department of Computer Science and Communications Engineering, Waseda University

Abstract

Ising machines have recently attracted much attention because they are expected to solve combinatorial optimization problems efficiently. We focus on an Ising machine whose algorithm is based on parallel tempering (PT), and experimentally evaluate the performance of the Ising machine for MIN-CUT problems. Experimental results show that the Ising machine outperforms a famous graph partitioning solver in terms of the quality of solution and the time-to-target-solution.

Journal

• IPSJ Transactions on System LSI Design Methodology

  IPSJ Transactions on System LSI Design Methodology 14 (0), 27-29, 2021

  Information Processing Society of Japan

Keywords

• Ising machines
• parallel tempering
• combinatorial optimization problem
• Ising model
• quadratic unconstrained binary optimization

Details

• CRID: 1390288933639553920
• NII Article ID: 130008071963
• DOI: 10.2197/ipsjtsldm.14.27
• ISSN: 18826687
• Web Site: https://www.jstage.jst.go.jp/article/ipsjtsldm/14/0/14_27/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed