Output details
11 - Computer Science and Informatics
University of York
Coined quantum walks lift the cospectrality of graphs and trees
<24>Describes a novel approach to using quantum walks for distinguishing graphs and trees using the support of the 3-step quantum walk. Provides currently fastest way of distinguishing known strongly regular graphs. Work formed part of EPSRC project "Quantum Algorithms for Inexact Graph Matching" which funded Emms and Severini. Severini later gained a Royal Society University Research Fellowship at UCL. Has inspired groups in Waterloo(Godsil) and Japan to study the proposed spectra. Formed basis of plenary talk at Spectral Graph Theory Workshop, Rio 2008 and invited talk at a Royal Society funded workshop on Complex Networks at RS Kavli Centre.