4.7 Article

Quantum Google in a Complex Network

Journal

SCIENTIFIC REPORTS
Volume 3, Issue -, Pages -

Publisher

NATURE PORTFOLIO
DOI: 10.1038/srep02773

Keywords

-

Funding

  1. Spanish MINECO
  2. European Regional Development Fund [FIS2012-33152, MTM2011-28800-C02-01]
  3. CAM research consortium QUITEMAD [S2009-ESP-1594]
  4. European Commission [249958]
  5. UCM-BS [GICC-910758]

Ask authors/readers for more resources

We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify and order the most relevant nodes. Furthermore, it is capable to clearly highlight the structure of secondary hubs and to resolve the degeneracy in importance of the low lying part of the list of rankings. The quantum algorithm displays an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance, as compared to the classical algorithm. We test the performance and confirm the listed features by applying it to real world examples from the WWW. Finally, we raise and partially address whether the increased sensitivity of the quantum algorithm persists under coordinated attacks in scale-free and random networks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available