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)

翻译：使用测谎代数,这一简短的文字对质量保证的普及性规定了上限。 也就是说,我们证明,为了接近一个通用门套件,对质量保证的修改次数的上限是在O(n)之内。