# Generalized quantum PageRank algorithm with arbitrary phase rotations

@article{Ortega2022GeneralizedQP, title={Generalized quantum PageRank algorithm with arbitrary phase rotations}, author={Sergio {\'A}lvarez Ortega and Miguel A. Martin-Delgado}, journal={Physical Review Research}, year={2022} }

The quantization of the PageRank algorithm is a promising tool for a future quantum internet. Here we present a modiﬁcation of the quantum PageRank introducing arbitrary phase rotations (APR) in the underlying Szegedy’s quantum walk. We deﬁne three diﬀerent APR schemes with only one phase as a degree of freedom. We have analyzed the behavior of these algorithms in a small generic graph, observing that a decrease of the phase reduces the standard deviation of the instantaneous PageRank, so the…

## References

SHOWING 1-10 OF 46 REFERENCES

### Quantum Google in a Complex Network

- Computer ScienceScientific reports
- 2013

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.

### Google in a Quantum Network

- Computer ScienceScientific reports
- 2012

This work has 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.

### Scale-free characteristics of random networks: the topology of the world-wide web

- Computer Science
- 2000

### Deterministic Grover search with a restricted oracle

- Computer SciencePhysical Review Research
- 2022

A deterministic, two-parameter “D2p” protocol that achieves a 100% success rate in no more than one additional iteration compared to the optimal number of steps as in the original Grover’s search enabling the same quadratic speed up.

### Experimental realization of continuous-time quantum walks on directed graphs and their application in PageRank

- Computer Science
- 2020

This paper experimentally realizes continuous-time quantum walks for directed graphs with non-Hermitian adjacency matrices by using linear optical circuits and single photons and finds that the node classical centrality in a directed graph is correlated with the maximum node probability resulting from a continuous- time quantum walk.

### Teleportation Systems Toward a Quantum Internet

- PhysicsPRX Quantum
- 2020

This work achieves quantum teleportation of time-bin qubits at the telecommunication wavelength of 1536.5 nm using fiber-coupled devices and measures teleportation fidelities that are consistent with an analytical model of the system, which includes realistic imperfections.

### Evolution of Credit Risk Using a Personalized Pagerank Algorithm for Multilayer Networks

- Computer ScienceArXiv
- 2020

This paper presents a novel algorithm to study the evolution of credit risk across complex multilayer networks, and shows how default risk is a challenging phenomenon that propagates and evolves through the network across time.

### TensorFlow solver for quantum PageRank in large-scale networks.

- Computer ScienceScience bulletin
- 2021

### Discrete-time quantum walk algorithm for ranking nodes on a network

- Computer ScienceQuantum Inf. Process.
- 2020

A quantum algorithm for ranking the nodes of a network in their order of importance based on a directed discrete-time quantum walk that can theoretically be applied to the entire internet and thus can function as a quantum PageRank algorithm.