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.
Original language | English |
---|---|
Pages (from-to) | 27-29 |
Number of pages | 3 |
Journal | IPSJ Transactions on System LSI Design Methodology |
Volume | 14 |
DOIs | |
Publication status | Published - 2021 |
Keywords
- Combinatorial optimization problem
- Ising machines
- Ising model
- Parallel tempering
- Quadratic unconstrained binary optimization
ASJC Scopus subject areas
- Computer Science Applications
- Electrical and Electronic Engineering