.png){kind=icon}
.png){kind=icon}
Return
Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.tcs.2025.115649.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Quantum Approximate Optimization Algorithm (QAOA for short) has demonstrated great potential in solving NP-hard combinatorial optimization problems. This study proposes a penalty enhanced QAOA framework for addressing both maximization and minimization problems. By uniformly setting penalty coefficients, the framework provides general support for both types of problems. It ensures the feasibility of output solutions and improves the quality of approximate solutions by adjusting the objective function and the construction of the Hamiltonian. We apply this framework to the Minimum Vertex Cover problem (as a minimization task) and the Maximum Independent Set problem (as a maximization task), designing corresponding quantum Hamiltonians and penalty terms.
Keywords:
Quantum approximation optimization
algorithm
Hamiltonian
Vertex cover
Independent set
Journal
IF:
1
Papers:
248
Citations:
1.0W