An upper bound on the Universality of the Quantum Approximate Optimization Algorithm

2021/04/01 by J. Ceasar Aguma, Aguma, J Ceasar
Computer Science · #Computational Complexity (cs.CC) #F.2.0 #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Machine Learning and Algorithms #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.2104.01993

openalex publication_date 2021/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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)

Citations

• A Quantum Approximate Optimization Algorithm
• Quantum approximate optimization is computationally universal

Related

• Quantum approximate optimization is computationally universal
• An Introduction to the Quantum Approximate Optimization Algorithm
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• The Quantum Approximate Optimization Algorithm Can Require Exponential Time to Optimize Linear Functions
• An Analysis of the Quantum Approximation Optimisation Algorithm