Efficient partition of integer optimization problems with one-hot encoding

Abstract

Quantum annealing is a heuristic algorithm for solving combinatorial optimization problems, and D-Wave Systems Inc. has developed hardware for implementing this algorithm. The current version of the D-Wave quantum annealer can solve unconstrained binary optimization problems with a limited number of binary variables, although cost functions of many practical problems are defined by a large number of integer variables. To solve these problems with the quantum annealer, the integer variables are generally binarized with one-hot encoding, and the binarized problem is partitioned into small subproblems. However, the entire search space of the binarized problem is considerably extended compared to that of the original integer problem and is dominated by unfeasible solutions. Therefore, to efficiently solve large optimization problems with one-hot encoding, partitioning methods that extract subproblems with as many feasible solutions as possible are required.

14 pages, 6 figures, 3 tables

References in corpus (8)

• Mathematical Foundation of Quantum Annealing
• Observation of topological phenomena in a programmable lattice of 1,800 qubits
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
• Efficiency of quantum versus classical annealing in non-convex learning problems
• Item Listing Optimization for E-commerce Websites based on Diversity
• Direct comparison of quantum and simulated annealing on a fully-connected Ising ferromagnet
• The Chiral Potts Spin Glass in d=2 and 3 Dimensions

Cited by in corpus (3)

• Benchmark test of Black-box optimization using D-Wave quantum annealer
• CMOS-compatible Ising and Potts Annealing Using Single Photon Avalanche Diodes
• Fairness Implications of Encoding Protected Categorical Attributes