Quantum walks defined by digraphs and generalized Hermitian adjacency matrices

S Kubota, E Segawa, T Taniguchi - Quantum Information Processing, 2021 - Springer
We propose a quantum walk defined by digraphs (mixed graphs). This is like Grover walk
that is perturbed by a certain complex-valued function defined by digraphs. The discriminant …

Quantum walks on regular graphs and eigenvalues

C Godsil, K Guo - arXiv preprint arXiv:1011.5460, 2010 - arxiv.org
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^+(U^ 3) $, a …

Quantum walks on generalized quadrangles

C Godsil, K Guo, TGJ Myklebust - arXiv preprint arXiv:1511.01962, 2015 - arxiv.org
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^+(U^ 3) $, a …

On extension of regular graphs

A Banerjee, S Bej - Journal of Discrete Mathematical Sciences and …, 2018 - Taylor & Francis
In this article, we discuss when one can extend an r-regular graph to an r+ 1 regular by
adding edges. Different conditions on the number of vertices n and regularity r are …

Phase measurement of quantum walks: application to structure theorem of the positive support of the Grover walk

N Konno, I Sato, E Segawa - arXiv preprint arXiv:1801.06209, 2018 - arxiv.org
We obtain a structure theorem of the positive support of the $ n $-th power of the Grover walk
on $ k $-regular graph whose girth is greater than $2 (n-1) $. This structure theorem is …

[PDF][PDF] Graph Isomorphism and Matrix Algebras

K Guo - 2022 - dwispc8.vub.ac.be
In these notes, we embark on an exploration approaching graph isomorphism using
algebraic graph theory. Our primary goal is to establish a framework to prove the …

[图书][B] Quantum and classical algorithms for graph classification and search problems

BL Douglas - 2011 - research-repository.uwa.edu.au
This thesis is split into three parts, each addressing the overarching theme of applying graph
theoretic techniques to classification and search problems. Part I explores this theme in the …