Overview
Syllabus
Hermitian adjacency matrices of digraphs and root lattices over the Gaussian integers
Eigenvalue gaps and continuous walks
Quantum walks, scattering theory, and universal quantum computation
A construction of pairs of graphs with applications to homomorphism counting
Simplifying dynamic quantum walks for quantum gates
Optimal distortion embeddings of distance-regular graphs in Euclidean spaces
Fractional revival and generalizations
Topological graph states
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
Quantum Walks on Graphs and Group State Transfer
Path potentials preventing pretty good state transfer
Oriented Cayley Graphs
Spatial search on Johnson graphs by continuous-time quantum walk
Q-polynomial graphs and the positive part U+q of Uq(slˆ2)
Transferring states in discrete quantum walks
Entanglement of free Fermions on graphs
Taught by
Fields Institute