21 citations · 23 across the 8 of their papers we have counts for
11 papers
Upper bound for the -leaky forcing number of and -leaky forcing number of
Rebekah Herrman
Leaky-forcing is a recently introduced variant of zero-forcing that has been studied for families of graphs including paths, cycles, wheels, grids, and trees. In this paper, we ext…
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…
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…
Capture times in the Bridge-burning Cops and Robbers game
Rebekah Herrman, Peter van Hintum, Stephen G. Z. Smith
In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from…