most citedQUBO Formulations for Variation of Domination Problem

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2024

Exploring the Potential of Quantum Approximate Optimization Algorithm in Tackling the Perfect Domination Problem

Haoqian Pan, Changhong Lu, Yuqing Zheng +1

Perfect Domination Problem (PDP), a canonical challenge in combinatorial optimization, finds critical applications in real-world systems such as error-correcting codes, wireless co…

quant-ph2024

Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem

Haoqian Pan, Hang Yuan, Yang Liu +3

Recent advancements in quantum computing have spurred substantial research into the application of quantum algorithms to combinatorial optimization problems. Among these challenges…

cs.CE2024★ 1 cited

QUBO Formulations for Variation of Domination Problem

Haoqian Pan, Changhong Lu

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 Qu…

quant-ph2024

Solving the Independent Domination Problem by Quantum Approximate Optimization Algorithm

Haoqian Pan, Changhong Lu

In the wake of quantum computing advancements and quantum algorithmic progress, quantum algorithms are increasingly being employed to address a myriad of combinatorial optimization…

nlin.CG2023

Traffic flow phase transition phenomena based on the kinetic approach

Zhizhen Zhang, Changhong Lu

We develop a discrete Boltzmann-type model that uses dynamics in phase space to describe the behavior of traffic flows. Firstly, we model the traffic flow at mesoscopic scale using…

quant-ph2023

Occupation Number Representation of Graph

Haoqian Pan, Changhong Lu, Ben Yang

In this paper, we propose a new way to represent graphs in quantum space. In that approach, we replace the rows of the adjacency matrix of the graph by state vectors in the occupat…