### 抄録

Combinatorial optimization problems with a large solution space are difficult to solve just using von Neumann computers. Ising machines or annealing machines have been developed to tackle these problems as a promising Non-von Neumann computer. In order to use these annealing machines, every combinatorial optimization problem is mapped onto the physical Ising model, which consists of spins, interactions between them, and their external magnetic fields. Then the annealing machines operate so as to search the ground state of the physical Ising model, which corresponds to the optimal solution of the original combinatorial optimization problem. A combinatorial optimization problem can be firstly described by an ideal fully-connected Ising model but it is very hard to embed it onto the physical Ising model topology of a particular annealing machine, which causes one of the largest issues in annealing machines. In this paper, we propose a fully-connected Ising model embedding method targeting for CMOS annealing machine. The key idea is that the proposed method replicates every logical spin in a fully-connected Ising model and embeds each logical spin onto the physical spins with the same chain length. Experimental results through an actual combinatorial problem show that the proposed method obtains spin embeddings superior to the conventional de facto standard method, in terms of the embedding time and the probability of obtaining a feasible solution.

元の言語 | English |
---|---|

ページ（範囲） | 1696-1706 |

ページ数 | 11 |

ジャーナル | IEICE Transactions on Information and Systems |

巻 | E102D |

発行部数 | 9 |

DOI | |

出版物ステータス | Published - 2019 1 1 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence

### これを引用

*IEICE Transactions on Information and Systems*,

*E102D*(9), 1696-1706. https://doi.org/10.1587/transinf.2018EDP7411

**A fully-connected ising model embedding method and its evaluation for CMOS annealing machines.** / Oku, Daisuke; Terada, Kotaro; Hayashi, Masato; Yamaoka, Masanao; Tanaka, Shu; Togawa, Nozomu.

研究成果: Article

*IEICE Transactions on Information and Systems*, 巻. E102D, 番号 9, pp. 1696-1706. https://doi.org/10.1587/transinf.2018EDP7411

}

TY - JOUR

T1 - A fully-connected ising model embedding method and its evaluation for CMOS annealing machines

AU - Oku, Daisuke

AU - Terada, Kotaro

AU - Hayashi, Masato

AU - Yamaoka, Masanao

AU - Tanaka, Shu

AU - Togawa, Nozomu

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Combinatorial optimization problems with a large solution space are difficult to solve just using von Neumann computers. Ising machines or annealing machines have been developed to tackle these problems as a promising Non-von Neumann computer. In order to use these annealing machines, every combinatorial optimization problem is mapped onto the physical Ising model, which consists of spins, interactions between them, and their external magnetic fields. Then the annealing machines operate so as to search the ground state of the physical Ising model, which corresponds to the optimal solution of the original combinatorial optimization problem. A combinatorial optimization problem can be firstly described by an ideal fully-connected Ising model but it is very hard to embed it onto the physical Ising model topology of a particular annealing machine, which causes one of the largest issues in annealing machines. In this paper, we propose a fully-connected Ising model embedding method targeting for CMOS annealing machine. The key idea is that the proposed method replicates every logical spin in a fully-connected Ising model and embeds each logical spin onto the physical spins with the same chain length. Experimental results through an actual combinatorial problem show that the proposed method obtains spin embeddings superior to the conventional de facto standard method, in terms of the embedding time and the probability of obtaining a feasible solution.

AB - Combinatorial optimization problems with a large solution space are difficult to solve just using von Neumann computers. Ising machines or annealing machines have been developed to tackle these problems as a promising Non-von Neumann computer. In order to use these annealing machines, every combinatorial optimization problem is mapped onto the physical Ising model, which consists of spins, interactions between them, and their external magnetic fields. Then the annealing machines operate so as to search the ground state of the physical Ising model, which corresponds to the optimal solution of the original combinatorial optimization problem. A combinatorial optimization problem can be firstly described by an ideal fully-connected Ising model but it is very hard to embed it onto the physical Ising model topology of a particular annealing machine, which causes one of the largest issues in annealing machines. In this paper, we propose a fully-connected Ising model embedding method targeting for CMOS annealing machine. The key idea is that the proposed method replicates every logical spin in a fully-connected Ising model and embeds each logical spin onto the physical spins with the same chain length. Experimental results through an actual combinatorial problem show that the proposed method obtains spin embeddings superior to the conventional de facto standard method, in terms of the embedding time and the probability of obtaining a feasible solution.

KW - CMOS annealing

KW - Combinatorial optimization

KW - Graph embedding

KW - Ising computing

KW - Ising model

UR - http://www.scopus.com/inward/record.url?scp=85071909395&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85071909395&partnerID=8YFLogxK

U2 - 10.1587/transinf.2018EDP7411

DO - 10.1587/transinf.2018EDP7411

M3 - Article

AN - SCOPUS:85071909395

VL - E102D

SP - 1696

EP - 1706

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 9

ER -