Florida Atlantic Undergraduate Research Journal
College
Harriet L. Wilkes Honors College
Keywords
Quantum, computing, algorithms, Quantum Approximate Optimization Algorithm (QAOA), Combinatorial optimization, Noisy Intermediate-Scale Quantum (NISQ) devices, circuit, barren plateau, hardwarae, optimization, Protein folding
Document Type
Article
Abstract
As quantum computing research advances, the Quantum Approximate Optimization Algorithm (QAOA) has emerged as a leading approach to harnessing current quantum hardware for solving complex combinatorial optimization problems. This pedagogical, expository paper outlines the mathematical foundations of QAOA, explains its step-by-step implementation from first principles in a manner accessible to advanced undergraduate students and non-specialists, and explores real-world applications such as protein folding and job scheduling. We also examine the algorithm’s performance challenges, including barren plateaus and circuit depth limitations.
Advisors
Terje Hill
Recommended Citation
Stafford, Vincent
(2026)
"A Comprehensive Overview of the Quantum Approximate Optimization Algorithm,"
Florida Atlantic Undergraduate Research Journal: Vol. 15, Article 24.
Available at:
https://digitalcommons.fau.edu/faurj/vol15/iss1/24
Included in
Arts and Humanities Commons, Business Commons, Life Sciences Commons, Social and Behavioral Sciences Commons