7 citations · 10 across the 5 of their papers we have counts for
11 papers
Perfect state transfer in quantum walks on orientable maps
Krystal Guo, Vincent Schmeits
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk…
Entanglement of Free Fermions on Hadamard Graphs
Nicolas Crampe, Krystal Guo, Luc Vinet
Free Fermions on vertices of distance-regular graphs are considered. Bipartition are defined by taking as one part all vertices at a given distance from a reference vertex. The gro…
Diagonal entries of the average mixing matrix
Chris Godsil, Krystal Guo, Mariia Sobchuk
We study the diagonal entries of the average mixing matrix of continuous quantum walks. The average mixing matrix is a graph invariant; it is the sum of the Schur squares of spectr…
The biclique covering number of grids
Krystal Guo, Tony Huynh, Marco Macchia
We determine the exact value of the biclique covering number for all grid graphs.
Partially ordering the class of invertible trees
Krystal Guo
A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1,…
Using the existence of t-designs to prove Erdős-Ko-Rado
Chris Godsil, Krystal Guo
In 1984, Wilson proved the Erdős-Ko-Rado theorem for -intersecting families of -subsets of an -set: he showed that if and is a family of $…