  Using lie algebra, this brief text provides an upper bound on the
universality of QAOA. That is, we prove that the upper bound for the number of
alterations of QAOA required to approximate a universal gate set is within O(n)
