By the same authors

From the same journal

From the same journal

GRAPH EMBEDDING USING A QUASI-QUANTUM ANALOGUE OF THE HITTING TIMES OF CONTINUOUS TIME QUANTUM WALKS

Research output: Contribution to journalArticle

Author(s)

Department / unit(s)

Publication details

JournalQUANTUM INFORMATION COMPUTATION
DatePublished - 1 Mar 2009
Issue number3-4
Volume9
Number of pages24
Pages (from-to)231-254
Original languageEnglish

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.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations