activity
20152020
most citedImproving the query complexity of quantum spatial search in two dimensions

4 citations · 8 across the 6 of their papers we have counts for

collaborators

8 papers

math.CO2020

A Bipartite Graph That Is Not the -Graph of a Bipartite Graph

Christopher M. van Bommel

For a graph , the -graph of is the graph whose vertex set is the collection of minimum dominating sets, or -sets of , and two -sets are adjacent if they…

math.CO2020

Italian Domination of Cartesian Products of Directed Cycles

Christopher M. van Bommel

An Italian dominating function on a (di)graph with vertex set is a function such that every vertex such that has an (in…

quant-ph2020★ 2 cited

Pretty Good State Transfer and Minimal Polynomials

Christopher M. van Bommel

We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good sta…

quant-ph2019

Pretty Good State Transfer of Multiple Qubit States on Paths

Christopher M. van Bommel

We discuss pretty good state transfer of multiple qubit states and provide a model for considering state transfer of arbitrary states on unmodulated XX-type spin chains. We then pr…

math.CO2019★ 1 cited

-Graphs of Trees

Stephen Finbow, Christopher M. van Bommel

For a graph , the -graph of , denoted , is the graph whose vertex set is the collection of minimum dominating sets, or -sets of , and t…

quant-ph2018★ 4 cited

Improving the query complexity of quantum spatial search in two dimensions

Abhijith J., Apoorva Patel

The question of whether quantum spatial search in two dimensions can be made optimal has long been an open problem. We report progress towards its resolution by showing that the or…