Generating hard quadratic unconstrained binary optimization instances via the method of combining bit reduction and duplication technique
X. H. Li, Koji Nakano, Shunsuke Tsukiyama, Yasuaki Ito, Takumi Kato, Yuya Kawamata · International Journal of Parallel Emergent and Distributed Systems · 2024
Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization problem defined by an energy function that consists of a quadratic formula involving multiple binary variables. We propose the method of combing bit reduction and duplication technique that can generate hard instances of QUBO problems from any original QUBO problem without changing the size. The idea is to reduce the original QUBO problem for a specified number of bits and duplicate the same number of bits while ensuring all duplicated pair of bits take the same binary values. Experimental results show that generated QUBO instances are much hard for solving.