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.
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.
This article presents a new quantum PageRank algorithm on graphs using discrete-time open quantum walks. Google's PageRank is a widely used algorithm for ranking the web pages on the world wide web in classical computation. From a broader perspective, it is also a fundamental measure for quantifying the importance of vertices in a network. Similarly, the new quantum PageRank also serves to quantify the significance of a network's vertices. In this work, we extend the concept of discrete-time open quantum walk on arbitrary directed and undirected graphs by utilizing the Weyl operators as Kraus operators. This new model of quantum walk is useful for building up the quantum PageRank algorithm, discussed in this article. We compare the classical PageRank and the newly defined quantum PageRank for different types of complex networks, such as the scale-free network, Erdős-Rényi random network, Watts-Strogatz network, spatial network, Zachary Karate club network, GNC, GN, GNR networks, Barabási and Albert network, etc. In addition, we study the convergence of the quantum PageRank process and its dependency on the damping factor α. We observe that this quantum PageRank procedure is faster than many other proposals reported in the literature.
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.
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 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.
This thesis provides an introduction to the quantum walk based search method which is the quantum analogue of the classical Markov chain based search. We develop the basic theory of the Markov chain based search together with its quantisation due to Mario Szegedy[Sz2]. We deeply analyse their relationship, and sketch some of the possible algorithmic applications. The thesis also addresses the question of the implementation, which is largely hidden by the high level description. We show how to implement the quantum walk based search algorithm in the case of the element distinctness problem. We implement the necessary operations using only very basic data structures, mainly arrays. Also while we use a weak and basic computational model we could still significantly reduce the exponent of the polylog terms arising from counting non oracle calls. Another interesting achievement is that we could parallelise the Setup operation reducing its circuit depth form O(N ) to O(polylog(N)). Probably the most important tool we introduced for the implementation is the use of reversible sorting networks, but we introduce some other tricks as well. The optimal quantum query algorithm for the element distinctness problem was first described by Andris Ambainis [Amb3] and provided the basis of the generalised method. In this seminal paper Ambainis also addressed the question of implementation. However that implementation method does not fully cast into the general framework which was introduced later. The operations described by Ambainis use some involved data structures, such as skip lists and hash table. Also it uses a strong computational model for example, a qRAM query has cost only 1. In contrast with Ambainis’s single node implementation method ours uses bipartite style approach fitting the general framework of Szegedy. At first sight it may seem unnecessary since it results in a duplication of a large amount of data stored during the walk steps, but in fact it simplifies the implementation process. On the structure of the thesis: Section 1 covers some background on quantum walks and basic techniques related to the quantum walk based search method. Section 2-5 gives a comprehensive description of the general scheme introduced by Szegedy and derives the main theorems showing the quadratic speed-up compared to the classical case. These Sections roughly follow the structure of Szegedy’s original paper [Sz2], but the proofs are restructured, so that I could state the main theorem in a slightly stronger form with a much improved constant. Section 6 addresses the implementation issues already mentioned. Finally, Section 7 gives a brief overview of the further generalised scheme introduced by Frederic Magniez, Ashwin Nayak, Jeremie Roland and Miklos Santha. Quantum walk based search methods and algorithmic applications 2
We present a quantum algorithm for obtaining a quantum state that encodes the PageRank vector of the Google matrix through multistep quantum resonant transition (mQRT). In the algorithm, the PageRank vector is encoded in the ground state of a problem Hamiltonian associated with the Google matrix. By dividing the web graph corresponding to the Google matrix into a series of subgraphs with nested structure, we construct a sequence of Hamiltonians based on the subgraphs to form a Hamiltonian evolution path from a simple initial Hamiltonian to the problem Hamiltonian. The ground state of the problem Hamiltonian is obtained by going through ground states of the intermediate Hamiltonians via QRT step by step. This algorithm requires only one ancillary qubit, and the runtime of the algorithm is proportional to the number of steps. It provides a new way for efficiently obtaining the quantum state of the PageRank vector of large-scale networks.