Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm.
James OstrowskiRebekah HerrmanTravis S. HumbleGeorge SiopsisPublished in: CoRR (2020)
Keyphrases
- optimization algorithm
- lower bound
- multi objective
- logic circuits
- exact solution
- upper bound
- objective function
- differential evolution
- optimization method
- particle swarm optimization pso
- branch and bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- optimization strategy
- global optima
- evolutionary multi objective
- optimal solution
- high speed
- artificial bee colony
- logic synthesis
- optimization problems
- harmony search
- quantum computing
- swarm intelligence
- multiobjective optimization
- computational intelligence
- search algorithm
- hybrid optimization algorithm