Published In
Academia Quantum
Document Type
Article
Publication Date
5-19-2026
Subjects
Boolean oracles, Hamiltonians, classical optimization, approximation algorithms, quantum search algorithms, QAOA
Abstract
This article investigates the performance impact of five classical optimization approximation algorithms on our previously introduced quantum search algorithm, termed the Boolean–Hamiltonians Transform for Quantum Approximate Optimization Algorithm (BHT-QAOA), to effectively search for all best-approximated solutions for Boolean-based problems. These optimization approximation algorithms are BFGS, L-BFGS-B, SLSQP, COBYLA, and COBYQA. Their performance impact is evaluated and compared using two proposed performance metrics—(i) the final number of function evaluations (the lower numbers denote the best optimization approximation algorithms) and (ii) the final quality of qubit measurements (the higher values indicate all best-approximated solutions were found for a problem). Arbitrary classical Boolean problems in various logical structures were examined and evaluated using the BHT-QAOA, these five optimization approximation algorithms, and a simulated noisy model of an IBM quantum computer. Broadly, the BHT-QAOA, with these five algorithms, successfully finds all optimized approximated solutions for these problems. Specifically, both the BFGS and SLSQP algorithms successfully find all best-approximated solutions for these problems, in the context of fewer function evaluations and higher quality of qubit measurements.
Rights
Copyright (c) 2026 The Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
DOI
10.20935/AcadQuant7996
Persistent Identifier
https://archives.pdx.edu/ds/psu/44715
Publisher
Academia.edu Journals
Citation Details
Al-Bayaty, A., & Perkowski, M. (2025). The impact of optimization approximation algorithms on the performance of the BHT-QAOA. Academia Quantum, 2(4). https://doi.org/10.20935/acadquant7996