Stephen G. Z. Smith

activity

20202022

collaborators

3 papers

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…

math.CO2021

On the length of L-Grundy sequences

Rebekah Herrman, Stephen G. Z. Smith

An L- sequence of a graph $G$ is a sequence of distinct vertices $S = {v_{1}, ..., v_{k}}$ such that $N [v_{i}] ∖ \cup_{j = 1}^{i - 1} N (v_{j}) \neq = \emptyset$ . The length of the lo…

math.CO2020

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…