RT Journal Article
T1 Quantum Google in a complex network
A1 Paparo, Giuseppe Davide
A1 Müller, Markus
A1 Comellas, Francesc
A1 Martín-Delgado Alcántara, Miguel Ángel
AB 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.
PB Nature Publishing Group
SN 2045-2322
YR 2013
FD 2013-10-04
LK https://hdl.handle.net/20.500.14352/35609
UL https://hdl.handle.net/20.500.14352/35609
LA eng
NO © 2013 All autors. The authors acknowledge the Centro de Supercomputación y Visualización de Madrid (CeSViMa) for CPU time on the Magerit2 cluster. This work has been supported by the Spanish MINECO grants and the European Regional Development Fund under projects FIS2012-33152, MTM2011-28800-C02-01, CAM research consortium QUITEMAD S2009-ESP-1594, European Commission PICC: FP7 2007-2013, Grant No. 249958 and UCM-BS grant GICC-910758.
NO Unión Europea. FP7
NO Ministerio de Economía y Competitividad (MINECO)
NO Comunidad de Madrid
NO Universidad Complutense de Madrid/Banco de Santander
DS Docta Complutense
RD 24 abr 2025