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

04/01/2021
by   J Ceasar Aguma, et al.
0

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)

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

07/30/2021

An Upper Bound on the Number of Bent Functions

The number of n-ary bent functions is less than 2^3·2^n-3(1+o(1)) as n i...
03/01/2022

Beyond Ansätze: Learning Quantum Circuits as Unitary Operators

This paper explores the advantages of optimizing quantum circuits on N w...
09/30/2019

Analysis of error dependencies on NewHope

Among many submissions to the NIST post-quantum cryptography (PQC) proje...
07/13/2020

In-place implementation of Quantum-Gimli

We present an in-place implementation of the Gimli permutation, a NIST r...
04/11/2022

Nonlocal Effect on a Generalized Ohta-Kawasaki Model

We propose a nonlocal Ohta-Kawasaki model to study the nonlocal effect o...
07/29/2009

Cooperative Training for Attribute-Distributed Data: Trade-off Between Data Transmission and Performance

This paper introduces a modeling framework for distributed regression wi...
12/08/2020

A General Computational Framework to Measure the Expressiveness of Complex Networks Using a Tighter Upper Bound of Linear Regions

The expressiveness of deep neural network (DNN) is a perspective to unde...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.