| Autor: |
Li, Xiaotian, Nakano, Koji, Ito, Yasuaki, Takafuji, Daisuke, Yazane, Takashi, Yano, Junko, Kato, Takumi, Ozaki, Shiro, Mori, Rie, Katsuki, Ryota |
| Předmět: |
|
| Zdroj: |
Concurrency & Computation: Practice & Experience; May2024, Vol. 36 Issue 10, p1-13, 13p |
| Abstrakt: |
Summary: Quadratic unconstrained binary optimization (QUBO) is a combinatorial optimization to find an optimal binary solution vector that minimizes the energy value defined by a quadratic formula of binary variables in the vector. The main contribution of this article is to propose the bit duplication technique that can specify the number of duplicated bits, so that it can generate hard QUBO problem with adjustable sizes. The idea is to duplicate specified number of bits and then to give constraints so that the corresponding two bits take the same binary values. By this technique, any QUBO problem with n$$ n $$ bits is converted to a hard QUBO problem with (m+n)$$ \left(m+n\right) $$ bits (0
|
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Plný text