most citedLower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm

2 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph2021

Multi-angle Quantum Approximate Optimization Algorithm

Rebekah Herrman, Phillip C. Lotshaw, James Ostrowski +2

The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by paramet…

quant-ph2021

Globally optimizing QAOA circuit depth for constrained optimization problems

Rebekah Herrman, Lorna Treffert, James Ostrowski +3

We develop a global variable substitution method that reduces -variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variable…

quant-ph2021

Impact of Graph Structures for QAOA on MaxCut

Rebekah Herrman, Lorna Treffert, James Ostrowski +3

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has b…

quant-ph2020

Integer Programming from Quantum Annealing and Open Quantum Systems

Chia Cheng Chang, Chih-Chieh Chen, Christopher Koerber +2

While quantum computing proposes promising solutions to computational problems not accessible with classical approaches, due to current hardware constraints, most quantum algorithm…

quant-ph20202 cited

Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm

James Ostrowski, Rebekah Herrman, Travis S. Humble +1

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of co…