Quantum Google Algorithm: Construction and Application to Complex Networks
arXiv:1409.3793
Abstract
We 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.
References in corpus (38)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- The Quantum Internet
- Lethality and centrality in protein networks
- The diameter of the world wide web
- The architecture of complex weighted networks
- Hierarchical organization of modularity in metabolic networks
- Network robustness and fragility: Percolation on random graphs
- Hierarchical Organization in Complex Networks
- Self-similarity of complex networks
- Quantum States and Phases in Driven Open Quantum Systems with Cold Atoms
- Field test of quantum key distribution in the Tokyo QKD Network
- Universal computation by quantum walk
- Quantum repeaters based on entanglement purification
- Information and Computation: Classical and Quantum Aspects
- Deterministic Scale-Free Networks
- Universal computation by multi-particle quantum walk
- Controlling edge dynamics in complex networks
- Resilience to damage of graphs with degree correlations
- Entanglement Percolation in Quantum Networks
- Telecommunication-wavelength solid-state memory at the single photon level
- Quantum speedup for active learning agents
- Quantum Navigation and Ranking in Complex Networks
- Adiabatic quantum algorithm for search engine ranking
- Entanglement Distribution in Pure-State Quantum Networks
- Quantum Google in a Complex Network
- Entanglement percolation in quantum complex networks
- Exact scaling properties of a hierarchical network model
- Approaches for a quantum memory at telecommunication wavelengths
- Asymptotic behavior of the Kleinberg model
- Universally Optimal Noisy Quantum Walks on Complex Networks
- Spectral properties of the Google matrix of the World Wide Web and other directed networks
- Exploring Maps with Greedy Navigators
- Limited path entanglement percolation in quantum complex networks
- Thermodynamic formalism for dissipative quantum walks
- Discrete time quantum walks on percolation graphs
- Ranking pages and the topology of the web