How to Reduce the Bit-Width of an Ising Model by Adding Auxiliary Spins

Daisuke Oku, Masashi Tawada, Shu Tanaka, Nozomu Togawa

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Annealing machines have been developed as non-von Neumann computers aimed at solving combinatorial optimization problems efficiently. To use annealing machines for solving combinatorial optimization problems, we have to represent the objective function and constraints by an Ising model, which is a theoretical model in statistical physics. Further, it is necessary to transform the Ising model according to the hardware limitations. In the transformation, the process of effectively reducing the bit-widths of coefficients in the Ising model has hardly been studied so far. Thus, when we consider the Ising model with a large bit-width, a naive method, which means right bit-shift, has to be applied. Since it is expected that obtaining highly accurate solutions is difficult by the naive method, it is necessary to construct a method for efficiently reducing the bit-width. This article proposes methods for reducing the bit-widths of interaction and external magnetic field coefficients in the Ising model and proves that the reduction gives theoretically the same ground state of the original Ising model. The experimental evaluations also demonstrate the effectiveness of our proposed methods.

Original languageEnglish
Pages (from-to)223-234
Number of pages12
JournalIEEE Transactions on Computers
Volume71
Issue number1
DOIs
Publication statusPublished - 2022 Jan 1

Keywords

  • Ising model
  • Quantum annealing
  • annealing machine
  • bit-width reduction
  • graph embedding

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'How to Reduce the Bit-Width of an Ising Model by Adding Auxiliary Spins'. Together they form a unique fingerprint.

Cite this