Mostra el registre d'ítem simple

dc.contributor.authorPaparo, Giuseppe Davide
dc.contributor.authorMuller, Markus
dc.contributor.authorComellas Padró, Francesc de Paula
dc.contributor.authorMartin Delgado, Miguel Angel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2015-03-17T12:11:10Z
dc.date.available2015-03-17T12:11:10Z
dc.date.created2014-07
dc.date.issued2014-07
dc.identifier.citationPaparo, G.D [et al.]. Quantum Google algorithm. "European physical journal plus", Juliol 2014, vol. 129, núm. 7, p. 150-166.
dc.identifier.issn2190-5444
dc.identifier.urihttp://hdl.handle.net/2117/26756
dc.description.abstractWe review the main findings on the ranking capabilities of the recently proposed Quantum PageRank 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 the underlying topology of the network and to be capable of clearly highlighting the structure of secondary hubs of networks. Furthermore, it can resolve the degeneracy in importance of the low-lying part of the list of rankings. Examples of applications include real-world instances from the WWW, which typically display a scale-free network structure and models of hierarchical networks. The quantum algorithm has been shown to display 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 among the nodes, as compared to the classical algorithm.
dc.format.extent17 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.lcshComputational complexity
dc.subject.otherPageRank
dc.subject.otherquantum Google algorithm
dc.subject.othercomplex networks
dc.titleQuantum Google algorithm
dc.typeArticle
dc.subject.lemacComplexitat computacional
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.identifier.doi10.1140/epjp/i2014-14150-y
dc.relation.publisherversionhttp://link.springer.com/article/10.1140%2Fepjp%2Fi2014-14150-y
dc.rights.accessOpen Access
local.identifier.drac15432388
dc.description.versionPostprint (author’s final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/FP7/249958/EU/The physics of Ion Coulomb Crystals: Thermodynamics, Quantum control, and Quantum Simulators./PICC
local.citation.authorPaparo, G.D; Muller, M.; Comellas, F.; Martin, M.
local.citation.publicationNameEuropean physical journal plus
local.citation.volume129
local.citation.number7
local.citation.startingPage150
local.citation.endingPage166


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple