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.
|ジャーナル||IPSJ Transactions on System LSI Design Methodology|
|出版ステータス||Published - 2021|
ASJC Scopus subject areas
- コンピュータ サイエンスの応用