Efficient ising model mapping for induced subgraph isomorphism problems using ising machines

Natsuhito Yoshimura, Masashi Tawada, Shu Tanaka, Junya Arai, Satoshi Yagi, Hiroyuki Uchiyama, Nozomu Togawa

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

Abstract

Ising machines have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems. An induced subgraph isomorphism problem is one of the decision problems, which determines whether a specific graph structure is included in a whole graph or not. The problem can be represented by equality constraints. By using the penalty functions correspond to the equality constraints, we can utilize an Ising machine to the induced subgraph isomorphism problem. The induced subgraph isomorphism problem can be seen in many practical problems, for example, finding out a particular malicious circuit in a device or particular network structure of chemical bonds in a compound. However, due to the limitation of the number of spin variables in the current Ising machines, reducing the number of spin variables is a major concern. Here, we propose an efficient Ising model mapping method to solve the induced subgraph isomorphism problem by Ising machines. Our proposed method theoretically solves the induced subgraph isomorphism problem. Furthermore, the number of spin variables in the Ising model generated by our proposed method is theoretically smaller than that of the conventional method. Experimental results demonstrate that our proposed method can successfully solve the induced subgraph isomorphism problem using the Isingmodel based simulated annealing.

Original languageEnglish
Title of host publicationProceedings - 2019 IEEE 9th International Conference on Consumer Electronics, ICCE-Berlin 2019
EditorsGordan Velikic, Christian Gross
PublisherIEEE Computer Society
Pages227-232
Number of pages6
ISBN (Electronic)9781728127453
DOIs
Publication statusPublished - 2019 Sep
Event9th IEEE International Conference on Consumer Electronics, ICCE-Berlin 2019 - Berlin, Germany
Duration: 2019 Sep 82019 Sep 11

Publication series

NameIEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin
Volume2019-September
ISSN (Print)2166-6814
ISSN (Electronic)2166-6822

Conference

Conference9th IEEE International Conference on Consumer Electronics, ICCE-Berlin 2019
CountryGermany
CityBerlin
Period19/9/819/9/11

Keywords

  • Annealing machine
  • Induced subgraph
  • Ising machines
  • Ising model
  • Isomorphism problem

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Industrial and Manufacturing Engineering
  • Media Technology

Fingerprint Dive into the research topics of 'Efficient ising model mapping for induced subgraph isomorphism problems using ising machines'. Together they form a unique fingerprint.

  • Cite this

    Yoshimura, N., Tawada, M., Tanaka, S., Arai, J., Yagi, S., Uchiyama, H., & Togawa, N. (2019). Efficient ising model mapping for induced subgraph isomorphism problems using ising machines. In G. Velikic, & C. Gross (Eds.), Proceedings - 2019 IEEE 9th International Conference on Consumer Electronics, ICCE-Berlin 2019 (pp. 227-232). [8966218] (IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin; Vol. 2019-September). IEEE Computer Society. https://doi.org/10.1109/ICCE-Berlin47944.2019.8966218