60 citations · 178 across the 36 of their papers we have counts for
6 papers · 1 filter
Leaky forcing and resilience of Cartesian products of
Rebekah Herrman, Grace Wisdom
Zero forcing is a process on a graph in which a set of initially colored vertices,, can color their neighbors according to the color change rule. T…
Efficient Sparse State Preparation via Quantum Walks
Alvin Gonzales, Rebekah Herrman, Colin Campbell +4
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which…
An angle rounding parameter initialization technique for ma-QAOA
Anthony Wilkie, James Ostrowski, Rebekah Herrman
The multi-angle quantum approximate optimization algorithm (ma-QAOA) is a recently introduced algorithm that gives at least the same approximation ratio as the quantum approximate…
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…
Quantum approximate optimization algorithm with random and subgraph phase operators
Anthony Wilkie, Igor Gaidai, James Ostrowski +1
The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA a…
Quantum Distance Approximation for Persistence Diagrams
Bernardo Ameneyro, Rebekah Herrman, George Siopsis +1
Topological Data Analysis methods can be useful for classification and clustering tasks in many different fields as they can provide two dimensional persistence diagrams that summa…