TY - JOUR

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

AU - Oku, Daisuke

AU - Tawada, Masashi

AU - Tanaka, Shu

AU - Togawa, Nozomu

N1 - Publisher Copyright:
© 1968-2012 IEEE.

PY - 2022/1/1

Y1 - 2022/1/1

N2 - 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.

AB - 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.

KW - Ising model

KW - Quantum annealing

KW - annealing machine

KW - bit-width reduction

KW - graph embedding

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

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

U2 - 10.1109/TC.2020.3045112

DO - 10.1109/TC.2020.3045112

M3 - Article

AN - SCOPUS:85098771339

VL - 71

SP - 223

EP - 234

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 1

ER -