60 citations · 178 across the 36 of their papers we have counts for
6 papers · 1 filter
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…
On the length of L-Grundy sequences
Rebekah Herrman, Stephen G. Z. Smith
An L- sequence of a graph is a sequence of distinct vertices such that . The length of the lo…
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…
Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
Rebekah Herrman, Thomas G. Wong
A continuous-time quantum walk on a dynamic graph evolves by Schrödinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for q…
Empirical performance bounds for quantum approximate optimization
Phillip C. Lotshaw, Travis S. Humble, Rebekah Herrman +2
The quantum approximate optimization algorithm (QAOA) is a variational method for noisy, intermediate-scale quantum computers to solve combinatorial optimization problems. Quantify…
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…