Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physics
Solving Combinatorial Optimization Problems Using The Quantum Approximation Optimization Algorithm, Nicholas J. Guerrero
Solving Combinatorial Optimization Problems Using The Quantum Approximation Optimization Algorithm, Nicholas J. Guerrero
Theses and Dissertations
The Quantum Approximation Optimization Algorithm (QAOA) is one of the most promising applications for noisy intermediate-scale quantum machines due to the low number of qubits required as well as the relatively low gate count. Much work has been done on QAOA regarding algorithm implementation and development; less has been done checking how these algorithms actually perform on a real quantum computer. Using the IBM Q Network, several instances of combinatorial optimization problems (the max cut problem and dominating set problem) were implemented into QAOA and analyzed. It was found that only the smallest toy max cut algorithms performed adequately: those …