@misc{10481/110929,
year = {2026},
month = {2},
url = {https://hdl.handle.net/10481/110929},
abstract = {In recent years, several quantum algorithms have been proposed for addressing combinatorial optimization problems. Among them, the Quantum Approximate Optimization Algorithm (QAOA) has become a widely used approach. However, reported limitations of QAOA have motivated the development of multiple algorithmic variants, including recursive hybrid methods such as the Recursive Quantum Approximate Optimization Algorithm (RQAOA), as well as the Quantum-Informed Recursive Optimization (QIRO) framework. In this work, we integrate the Quantum Alternating Operator Ansatz within the QIRO framework in order to improve its quantum inference stage. Both the original and the enhanced versions of QIRO are applied to the Minimum Vertex Cover problem, an NP-complete problem of practical relevance. Performance is evaluated on a benchmark of Erdös-Rényi graph instances with varying sizes, densities, and random seeds. The results show that the proposed modification leads to a higher number of successfully solved instances across the considered benchmark, indicating that refinements of the variational layer can improve the effectiveness of the QIRO framework.},
publisher = {MDPI},
keywords = {Quantum computing},
keywords = {QAOA},
keywords = {QIRO},
title = {On the Use of the Quantum Alternating Operator Ansatz in Quantum-Informed Recursive Optimization: A Case Study on the Minimum Vertex Cover},
doi = {10.3390/appliedmath6020024},
author = {Ramos Ruiz, Pablo and Fuentes Jiménez, Antonio Miguel and Ramos-Ruiz, José E. and Jiménez-Manchado, Inmaculada},
}