Related papers: Google in a Quantum Network

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.…

We investigate the behavior of the recently proposed quantum Google algorithm, or quantum PageRank, in large complex networks. Applying the quantum algorithm to a part of the real World Wide Web, we find that the algorithm is able to…

Complex networks are formal frameworks capturing the interdependencies between the elements of large systems and databases. This formalism allows to use network navigation methods to rank the importance that each constituent has on the…

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…

The design of the Quantum Internet protocol stack is at its infancy and early-stage conceptualization. And different heterogeneous proposals are currently available in the literature. The underlying assumption of the existing proposals is…

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…

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…

The quantum version of Google PageRank has recently been investigated by various groups and shown to be quadratically faster in time than the classical PageRank algorithm. In this paper we propose the implementation of Quantum PageRank by a…

HodgeRank generalizes ranking algorithms, e.g. Google PageRank, to rank alternatives based on real-world (often incomplete) data using graphs and discrete exterior calculus. It analyzes multipartite interactions on high-dimensional networks…

The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical…

Quantum computation promises to execute certain computational tasks on time scales much faster than any known algorithm on an existing classical computer, for example calculating the prime factors of large integers. Recently a research team…

We present a quantum algorithm for ranking the nodes on a network in their order of importance. The algorithm is based on a directed discrete-time quantum walk, and works on all directed networks. This algorithm can theoretically be applied…

Quantum mechanics empowers the emergence of quantum advantages in various fields, including quantum algorithms. Quantum PageRank is a promising tool for a future quantum internet. Recently, arbitrary phase rotations (APR) have been…

The quantum SearchRank algorithm is a promising tool for a future quantum search engine based on PageRank quantization. However, this algorithm loses its functionality when the $N/M$ ratio between the network size $N$ and the number of…

We present an idiosyncratic view of the race for quantum computational supremacy. Google's approach and IBM challenge are examined. An unexpected side-effect of the race is the significant progress in designing fast classical algorithms.…

Demonstrating quantum advantage has been a pressing challenge in the field. Most claimed quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner, which imposes a crucial constraint…

The quantization of the PageRank algorithm is a promising tool for a future quantum internet. Here we present a modification of the quantum PageRank introducing arbitrary phase rotations (APR) in the underlying Szegedy's quantum walk. We…

Following the emergence of quantum computing, the subsequent quantum revolution will be that of interconnecting individual quantum computers at global level. In the same way that classical computers only realised their full potential with…

Quantum networks offer a unifying set of opportunities and challenges across exciting intellectual and technical frontiers, including for quantum computation, communication, and metrology. The realization of quantum networks composed of…

The Quantum Internet is envisioned as the final stage of the quantum revolution, opening fundamentally new communications and computing capabilities, including the distributed quantum computing. But the Quantum Internet is governed by the…