Can I read An upper bound on the Universality of the Quantum Approximate Optimization Algorithm on EtoBox?

An upper bound on the Universality of the Quantum Approximate Optimization Algorithm by Aguma, J Ceasar is a scholarly article available to read on EtoBox.

What is An upper bound on the Universality of the Quantum Approximate Optimization Algorithm about?

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)

Author

Aguma, J Ceasar

Published

2021

Language

EN