where the subscript \(i\)  denotes the angle chosen for iteration \(i\)  of the algorithm. The classical parameters \(\gamma \)  and \(\beta \)  are chosen to maximize \({\left\langle \gamma , \beta  \right|}C{\left| \gamma ,\beta  \right\rangle }\) . While QAOA is typically thought of as an algorithm that solves CO problems, it has been shown to be a universal model of quantum computation [1]}, [2]}. Recently, multi-angle QAOA (ma-QAOA) was introduced as a generalization of QAOA that allows for additional classical parameters [3]}. In that same paper, it was shown that ma-QAOA always performs at least as well as QAOA for optimization and can strictly outperform it in some cases.
