3 citations · 5 across the 4 of their papers we have counts for
4 papers
Bootstrap percolation and -hull number in direct products of graphs
Boštjan Brešar, Jaka Hedžet, Rebekah Herrman
The -neighbor bootstrap percolation is a graph infection process based on the update rule by which a vertex with infected neighbors becomes infected. We say that an initial…
Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
Moises Ponce, Rebekah Herrman, Phillip C. Lotshaw +4
The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current nois…
A Proof of the Grundy domination strong product conjecture
Rebekah Herrman, Stephen G. Z. Smith
The Grundy domination number of a simple graph is the length of the longest sequence of unique vertices , , that satisfies the proper…
Relating the multi-angle quantum approximate optimization algorithm and continuous-time quantum walks on dynamic graphs
Rebekah Herrman
In this work, we show that ma-QAOA is equivalent to a restriction of continuous-time quantum walks on dynamic graphs. We then show it is universal for computation by finding the ap…