.png){kind=icon}
Return
Auxiliary-qubit-free quantum approximate optimization algorithm for the minimum dominating set problem
.png){kind=icon}
PRE
AI
DOI：10.1088/1674-1056/ae5052.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Quantum approximate optimization algorithm (QAOA) is a promising framework for solving combinatorial optimization problems on near-term quantum devices. One such problem is the minimum dominating set (MDS), which is known to be NP-hard. Existing QAOA algorithms for this problem typically require numerous auxiliary qubits, increasing circuit overhead and hardware requirements. In this paper, we propose an auxiliary-qubit-free QAOA algorithm based on Hamiltonian evolution (AQFH-QAOA) for the MDS problem. Unlike previous studies that require numerous auxiliary qubits, our algorithm eliminates the need for auxiliary qubits, thereby significantly reducing circuit overhead. In addition, we present an auxiliary-qubit-free optimized implementation of the previously proposed Guerrero's QAOA algorithm (AQFG-QAOA) by utilizing gate decomposition techniques. Through a detailed analysis of gate complexity, we evaluate the applicability of these two algorithms. Numerical experiments demonstrate that our proposed algorithm achieves competitive solution quality compared with existing QAOA algorithms, making it a promising candidate for implementation on near-term quantum devices.
Keywords:
quantum algorithm
quantum approximate optimization algorithm
minimum dominating set
Boolean algebra identities
03.67.Ac
03.67.Lx
Journal
C
IF:
1.5
Papers:
519
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more