QUBO Formulations for Variation of Domination Problem

TL;DR

This paper develops efficient QUBO formulations for the classic Domination Problem and its variants, enabling more practical quantum computing solutions for these combinatorial optimization challenges.

Contribution

It introduces novel QUBO models for the Domination Problem and its variants, reducing qubit requirements and expanding quantum applicability.

Findings

QUBO model for classic DP uses fewer qubits

First QUBO formulations for DP variants

Facilitates quantum solutions for DP problems

Abstract

With the development of quantum computing, the use of quantum algorithms to solve combinatorial optimization problems on quantum computers has become a major research focus. The Quadratic Unconstrained Binary Optimization (QUBO) model serves as a bridge between combinatorial optimization problems and quantum computers, and is a prerequisite for these studies. In combinatorial optimization problems, the Domination Problem (DP) is related to many practical issues in the real world, such as the fire station problem, social network theory, and so on. Additionally, the DP has numerous variants, such as independent DP, total DP, k-domination, and so forth. However, there is a scarcity of quantum computing research on these variant problems. A possible reason for this is the lack of research on QUBO modeling for these issues. This paper investigates the QUBO modeling methods for the classic DP and its variants. Compared to previous studies, the QUBO modeling method we propose for the classic DP can utilize fewer qubits. This will lower the barrier for solving DP on quantum computers. At the same time, for many variants of DP problems, we provide their QUBO modeling methods for the first time. Our work will accelerate the entry of DP into the quantum era.