PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

GRAPH EMBEDDING USING A QUASI-QUANTUM ANALOGUE OF THE HITTING TIMES OF CONTINUOUS TIME QUANTUM WALKS
David Emms, Richard Wilson and Edwin Hancock
QUANTUM INFORMATION & COMPUTATION Volume 9, Number 3-4, pp. 231-254, 2009. ISSN 1533-7146

Abstract

In this paper, we explore analytically and experimentally a quasi-quantum analogue of the hitting time of the continuous-time quantum walk on a graph. For the classical random walk, the hitting time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved performance. Our analysis shows that the quasi-quantum analogue of the hitting time of the continuous-time quantum walk can be determined via integrals of the Laplacian spectrum, calculated using Gauss-Laguerre quadrature. We analyse the quantum hitting times with reference to their classical counterpart. Specifically, we explore the graph embeddings that preserve hitting time. Experimentally, we show that the quantum hitting times can be used to emphasise cluster-structure.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:6838
Deposited By:Edwin Hancock
Deposited On:08 March 2010