You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of York » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of York

Return to search Previous output Next output

Output 32 of 139 in the submission

Article title

Coined quantum walks lift the cospectrality of graphs and trees

Type

D - Journal article

DOI

10.1016/j.patcog.2008.10.025

Title of journal

Pattern Recognition

Article number

Volume number

Issue number

First page of article

1988

ISSN of journal

0031-3203

Year of publication

2009

URL

http://www.sciencedirect.com/science/article/pii/S0031320308004524

Number of additional authors

Additional information

<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.

Interdisciplinary

Cross-referral requested

Research group

H - Computer Vision and Pattern Recognition

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract