Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1112.2079 · Scientific Reports

Google in a Quantum Network

G. D. Paparo, M. A. Martin-Delgado

Published Jun 8, 2012• 138 citations
arXivHTMLPDF

Abstract

We introduce the characterization of a class of quantum PageRank algorithms in a scenario in which some kind of quantum network is realizable out of the current classical internet web, but no quantum computer is yet available. This class represents a quantization of the PageRank protocol currently employed to list web pages according to their importance. We have found an instance of this class of quantum protocols that outperforms its classical counterpart and may break the classical hierarchy of web pages depending on the topology of the web.

DOI
10.1038/srep00444

Related papers

Adiabatic Quantum Algorithm for Search Engine Ranking

Silvano Garnerone, Paolo Zanardi, Daniel A. Lidar

We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web pages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top-ranked log(n) entries of the quantum PageRank state can then be estimated with a polynomial quantum speed-up. Moreover, the quantum PageRank state can be used in "q-sampling" protocols for testing properties of distributions, which require exponentially fewer measurements than all classical schemes designed for the same task. This can be used to decide whether to run a classical update of the PageRank.

arXiv:1109.6546•Physical Review Letters•Jun 4, 2012•111 citations

Quantum walk based algorithm on scale free networks

German Alamilla Peralta

The classification of information contained in complex networks such as the WWW is a central problem in network science for its technological impact. A highly successful methodology for this purpose is Google’s PageRank algorithm. It allows to measure the importance or relevance of a web page depending on the relationship between pages and its connections, i.e, the hyperlink structure. Finding ways to apply the advantages of quantum computers to real world computational tasks is an active research area. In this thesis, we implement a quantum gate-based algorithm that replicates the behaviour of the Quantum PageRank algorithm. We present a comprehensive analysis with the Szegedy quantum walk formalism. The implementation procedure is based in the quantum circuit model of quantum computing. Here, we review a Quantum PageRank algorithm and illustrate the main findings. We show the behaviour of the quantum PageRank algorithm using the IBM’s Q experience framework for quantum computing. We investigate the behavior of the Quantum PageRank algorithm using quantum walks by giving explicit connections with corresponding classical algorithm. We make a comparative analysis of our findings and discuss the capabilities of a quantum computing platform applied to the Quantum PageRank algorithm. Within the restrictions imposed by hardware, we implement a multiple-controlled gate using ancilla qubits and all other elements required for implementing our quantum algorithm.

•Mar 14, 2020•0 citations

Quantum Google in a Complex Network

Giuseppe Davide Paparo, Markus Müller, Francesc Comellas +1 more

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.

arXiv:1303.3891•Scientific Reports•Oct 4, 2013•93 citations

Construction and Application to Complex Networks

Francesc Comellas

We review the main ndings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (1,2) 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 struc- ture 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.

•Jan 1, 2014•0 citations

Variational Quantum PageRank

Sims, Christopher

The PageRank algorithm is used to rank web pages by their importance. Since its development, the PageRank algorithm is a critical and fundamental part of search engines today. PageRank is a graph-based algorithm that ranks pages based on how many other pages link to them. This work develops a variational quantum version of the PageRank algorithm and compares the performance of the two algorithms. It is found that quantum PageRank performs better at ranking websites than the normal PageRank algorithm

arXiv:2304.12232•Apr 19, 2023•0 citations

An Enhanced Quantum PageRank Algorithm Integrated with Quantum Search

Huiquan Wang, Junjie Wu, Xuejun Yang +2 more

The Google's PageRank algorithm is one of the most famous algorithms in data mining. A quantum version of this algorithm has been proposed in 2012. It is a meaningful step towards the quantum search engine but it can not search solutions. In this paper, we integrate a special operator of quantum search into the quantum PageRank algorithm to make a new quantum algorithm. We called it the Search Rank algorithm. This new algorithm is able to search solutions and rank results according to their importance at the same time. It is the first algorithm possessing this ability as far as we know. And it outperforms all classical algorithms when searching an unsorted database.

International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)•Jul 1, 2014•5 citations
We introduce the characterization of a class of quantum PageRank algorithms in a scenario in which some kind of quantum network is realizable out of the current classical internet web, but no quantum computer is yet available. This class represents a quantization of the PageRank protocol currently employed to list web pages according to their importance. We have found an instance of this class of quantum protocols that outperforms its classical counterpart and may break the classical hierarchy of web pages depending on the topology of the web.
We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web pages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top-ranked log(n) entries of the quantum PageRank state can then be estimated with a polynomial quantum speed-up. Moreover, the quantum PageRank state can be used in "q-sampling" protocols for testing properties of distributions, which require exponentially fewer measurements than all classical schemes designed for the same task. This can be used to decide whether to run a classical update of the PageRank.
The classification of information contained in complex networks such as the WWW is a central problem in network science for its technological impact. A highly successful methodology for this purpose is Google’s PageRank algorithm. It allows to measure the importance or relevance of a web page depending on the relationship between pages and its connections, i.e, the hyperlink structure. Finding ways to apply the advantages of quantum computers to real world computational tasks is an active research area. In this thesis, we implement a quantum gate-based algorithm that replicates the behaviour of the Quantum PageRank algorithm. We present a comprehensive analysis with the Szegedy quantum walk formalism. The implementation procedure is based in the quantum circuit model of quantum computing. Here, we review a Quantum PageRank algorithm and illustrate the main findings. We show the behaviour of the quantum PageRank algorithm using the IBM’s Q experience framework for quantum computing. We investigate the behavior of the Quantum PageRank algorithm using quantum walks by giving explicit connections with corresponding classical algorithm. We make a comparative analysis of our findings and discuss the capabilities of a quantum computing platform applied to the Quantum PageRank algorithm. Within the restrictions imposed by hardware, we implement a multiple-controlled gate using ancilla qubits and all other elements required for implementing our quantum algorithm.
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.
We review the main ndings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (1,2) 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 struc- ture 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.
The PageRank algorithm is used to rank web pages by their importance. Since its development, the PageRank algorithm is a critical and fundamental part of search engines today. PageRank is a graph-based algorithm that ranks pages based on how many other pages link to them. This work develops a variational quantum version of the PageRank algorithm and compares the performance of the two algorithms. It is found that quantum PageRank performs better at ranking websites than the normal PageRank algorithm
The Google's PageRank algorithm is one of the most famous algorithms in data mining. A quantum version of this algorithm has been proposed in 2012. It is a meaningful step towards the quantum search engine but it can not search solutions. In this paper, we integrate a special operator of quantum search into the quantum PageRank algorithm to make a new quantum algorithm. We called it the Search Rank algorithm. This new algorithm is able to search solutions and rank results according to their importance at the same time. It is the first algorithm possessing this ability as far as we know. And it outperforms all classical algorithms when searching an unsorted database.