Zobrazeno 1 - 10
of 1 231
pro vyhledávání: '"P, Herrman"'
Autor:
Herrman, Rebekah, Wisdom, Grace
Zero forcing is a process on a graph $G = (V,E)$ in which a set of initially colored vertices,$B_0(G) \subset V(G)$, can color their neighbors according to the color change rule. The color change rule states that if a vertex $v$ can color a neighbor
Externí odkaz:
http://arxiv.org/abs/2411.03178
Autor:
Gonzales, Alvin, Herrman, Rebekah, Campbell, Colin, Gaidai, Igor, Liu, Ji, Tomesh, Teague, Saleem, Zain H.
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 to envision quantum algorithms. In this work we develop a mapping from
Externí odkaz:
http://arxiv.org/abs/2405.20273
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 optimization algorithm (QAOA) and, in most cases, gives a significantl
Externí odkaz:
http://arxiv.org/abs/2404.10743
The $r$-neighbor bootstrap percolation is a graph infection process based on the update rule by which a vertex with $r$ infected neighbors becomes infected. We say that an initial set of infected vertices propagates if all vertices of a graph $G$ are
Externí odkaz:
http://arxiv.org/abs/2403.10957
Publikováno v:
Physical Review A 110.2 (2024): 022441
The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA ansatz consists of an alternating application of the cost and mixer Ham
Externí odkaz:
http://arxiv.org/abs/2402.18412
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 summarize important information about the shape of potentially complex and
Externí odkaz:
http://arxiv.org/abs/2402.17295
Autor:
Gaidai, Igor, Herrman, Rebekah
In this paper we consider the scalability of Multi-Angle QAOA with respect to the number of QAOA layers. We found that MA-QAOA is able to significantly reduce the depth of QAOA circuits, by a factor of up to 4 for the considered data sets. However, M
Externí odkaz:
http://arxiv.org/abs/2312.00200
Autor:
Ponce, Moises, Herrman, Rebekah, Lotshaw, Phillip C., Powers, Sarah, Siopsis, George, Humble, Travis, Ostrowski, James
The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constrai
Externí odkaz:
http://arxiv.org/abs/2306.00494
Autor:
Igor Gaidai, Rebekah Herrman
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-9 (2024)
Abstract In this paper we consider the scalability of multi-angle QAOA with respect to the number of QAOA layers. We found that MA-QAOA is able to significantly reduce the depth of QAOA circuits, by a factor of up to 4 for the considered data sets. M
Externí odkaz:
https://doaj.org/article/de88ecfe5cd340f7b5d9a8af7492ebaa
Autor:
Herrman, Rebekah, Smith, Stephen G. Z.
The Grundy domination number of a graph $G = (V,E)$ is the length of the longest sequence of unique vertices $S = (v_1, \ldots, v_k)$ satisfying $N[v_i] \setminus \cup_{j=1}^{i-1}N[v_j] \neq \emptyset$ for each $i \in [k]$. Recently, a generalization
Externí odkaz:
http://arxiv.org/abs/2212.09861