No Cover Image

Journal article 160 views

Quantum Google algorithm / G. D. Paparo; M. Müller; F. Comellas; M. A. Martin-Delgado

The European Physical Journal Plus, Volume: 129, Issue: 7

Swansea University Author: Muller, Markus

Full text not available from this repository: check for access using links below.

DOI (Published version): 10.1140/epjp/i2014-14150-y

Abstract

We review the main findings on the ranking capabilities of the recently proposed QuantumPageRank algorithm (G.D. Paparo et al., Sci. Rep. 2, 444 (2012) and G.D. Paparo et al., Sci. Rep. 3, 2773(2013)) applied to large complex networks. The algorithm has been shown to identify unambiguously theunderl...

Full description

Published in: The European Physical Journal Plus
Published: 2014
URI: https://cronfa.swan.ac.uk/Record/cronfa28644
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: We review the main findings on the ranking capabilities of the recently proposed QuantumPageRank algorithm (G.D. Paparo et al., Sci. Rep. 2, 444 (2012) and G.D. Paparo et al., Sci. Rep. 3, 2773(2013)) applied to large complex networks. The algorithm has been shown to identify unambiguously theunderlying topology of the network and to be capable of clearly highlighting the structure of secondary hubsof networks. Furthermore, it can resolve the degeneracy in importance of the low-lying part of the list ofrankings. Examples of applications include real-world instances from the WWW, which typically display ascale-free network structure and models of hierarchical networks. The quantum algorithm has been shownto display an increased stability with respect to a variation of the damping parameter, present in theGoogle algorithm, and a more clearly pronounced power-law behaviour in the distribution of importanceamong the nodes, as compared to the classical algorithm.
College: College of Science
Issue: 7