5 research outputs found
Switching for Small Strongly Regular Graphs
We provide an abundance of strongly regular graphs (SRGs) for certain
parameters with . For this we use Godsil-McKay
(GM) switching with a partition of type and Wang-Qiu-Hu (WQH) switching
with a partition of type . In most cases, we start with a highly
symmetric graph which belongs to a finite geometry. To our knowledge, most of
the obtained graphs are new.
For all graphs, we provide statistics about the size of the automorphism
group. We also find the recently discovered Kr\v{c}adinac partial geometry,
therefore finding a third method of constructing it.Comment: 15 page
Discrete Quantum Walks on Graphs and Digraphs
This thesis studies various models of discrete quantum walks on graphs and digraphs via a spectral approach.
A discrete quantum walk on a digraph is determined by a unitary matrix , which acts on complex functions of the arcs of . Generally speaking, is a product of two sparse unitary matrices, based on two direct-sum decompositions of the state space. Our goal is to relate properties of the walk to properties of , given some of these decompositions.
We start by exploring two models that involve coin operators, one due to Kendon, and the other due to Aharonov, Ambainis, Kempe, and Vazirani. While is not defined as a function in the adjacency matrix of the graph , we find exact spectral correspondence between and . This leads to characterization of rare phenomena, such as perfect state transfer and uniform average vertex mixing, in terms of the eigenvalues and eigenvectors of . We also construct infinite families of graphs and digraphs that admit the aforementioned phenomena.
The second part of this thesis analyzes abstract quantum walks, with no extra assumption on . We show that knowing the spectral decomposition of leads to better understanding of the time-averaged limit of the probability distribution. In particular, we derive three upper bounds on the mixing time, and characterize different forms of uniform limiting distribution, using the spectral information of .
Finally, we construct a new model of discrete quantum walks from orientable embeddings of graphs. We show that the behavior of this walk largely depends on the vertex-face incidence structure. Circular embeddings of regular graphs for which has few eigenvalues are characterized. For instance, if has exactly three eigenvalues, then the vertex-face incidence structure is a symmetric -design, and is the exponential of a scalar multiple of the skew-symmetric adjacency matrix of an oriented graph. We prove that, for every regular embedding of a complete graph, is the transition matrix of a continuous quantum walk on an oriented graph
Quantum walks on generalized quadrangles
We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of S+(U3), a matrix based on the amplitudes of walks in the quantum walk, dis-tinguishes strongly regular graphs. We probabilistically compute the spectrum of the line intersection graphs of two non-isomorphic generalized quadrangles of order (52; 5) under this matrix and thus provide strongly regular counter-examples to the conjecture.SCOPUS: ar.jinfo:eu-repo/semantics/publishe