Stephen G. Z. Smith

activity

20152023

most citedThe poset on connected graphs is Sperner

2 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Extending Grundy domination to $k$ -Grundy domination

Rebekah Herrman, Stephen G. Z. Smith

The Grundy domination number of a graph $G = (V, E)$ is the length of the longest sequence of unique vertices $S = (v_{1}, \dots, v_{k})$ satisfying $N[v_i] \setminus \cup_{j=1}^{i-1}N…

quant-ph2022

Approximating Output Probabilities of Shallow Quantum Circuits which are Geometrically-local in any Fixed Dimension

Suchetan Dontha, Shi Jie Samuel Tan, Stephen Smith +2

We present a classical algorithm that, for any $D$ -dimensional geometrically-local, quantum circuit $C$ of polylogarithmic-depth, and any bit string $x \in 0, 1^{n}$ , can compute th…

Extending Grundy domination to k-Grundy domination

Approximating Output Probabilities of Shallow Quantum Circuits which are Geometrically-local in any Fixed Dimension

Extending Grundy domination to $k$ -Grundy domination