2021
DOI: 10.1109/access.2021.3081685
|View full text |Cite
|
Sign up to set email alerts
|

Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine

Abstract: The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated. Many combinatorial optimization problems can be mapped to find the lowest-energy (ground) state of an Ising model or its equivalent model, the Quadratic Unconstrained Binary Optimization (QUBO). Since the Ising model and QUBO consist of binary variables, they often express integers as binary when using Ising machines. A typical example is the combinatorial op… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
12
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 32 publications
(22 citation statements)
references
References 42 publications
1
12
0
Order By: Relevance
“…It is known that some combinatorial optimization problems can be transformed into QUBO 13 . In addition, other transformation techniques for QUBO formulation have also been proposed, such as encoding techniques to a binary variable 14 , 15 and converting methods from higher-order polynomial to a quadratic model 16 . And, furthermore, many applications have been reported as the success cases of the QUBO formulation, including vehicle path generation 12 , 17 , traffic signal control 18 , portfolio optimization 19 , quantum chemistry 20 , and machine learning 21 .…”
Section: Introductionmentioning
confidence: 99%
“…It is known that some combinatorial optimization problems can be transformed into QUBO 13 . In addition, other transformation techniques for QUBO formulation have also been proposed, such as encoding techniques to a binary variable 14 , 15 and converting methods from higher-order polynomial to a quadratic model 16 . And, furthermore, many applications have been reported as the success cases of the QUBO formulation, including vehicle path generation 12 , 17 , traffic signal control 18 , portfolio optimization 19 , quantum chemistry 20 , and machine learning 21 .…”
Section: Introductionmentioning
confidence: 99%
“…It is known that some combinatorial optimization problems can be transformed into QUBO 11 . In addition, other transformation techniques for QUBO formulation have also been proposed, such as encoding techniques to a binary variable 12,13 and converting methods from higher-order polynomial to a quadratic model 14 . And, furthermore, many applications have been reported as the success cases of the QUBO formulation, including vehicle path generation 10,15 , traffic signal control 16 , portfolio optimization 17 , quantum chemistry 18 , and machine learning 19 .…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, it is known that the quality of solutions obtained from solid-state annealers greatly depends on the formulation method [18]. Therefore, if multiple formulation methods can exist for a COP, it is quite important to clarify their strengths and weaknesses.…”
Section: Introductionmentioning
confidence: 99%
“…While we need some integer encoding method in formulating the QKP as QUBO, two typical methods exist: binary encoding (BE) and unary encoding (UE). In the previous study [18], these two methods were compared based on the experimental results obtained from a solid-state annealer. However, it is still unclear why a method is superior (or inferior) to the other because the annealing process is unobservable in the previous annealers.…”
Section: Introductionmentioning
confidence: 99%