Sensitivity of quantum PageRank

06/27/2019
by   Hirotada Honda, et al.
0

In this paper, we discuss the sensitivity of quantum PageRank. By using the finite dimensional perturbation theory, we estimate the change of the quantum PageRank under a small analytical perturbation on the Google matrix. In addition, we will show the way to estimate the lower bound of the convergence radius as well as the error bound of the finite sum in the expansion of the perturbed PageRank.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2021

Perturbation Theory for Quantum Information

We report lowest-order series expansions for primary matrix functions of...
research
12/29/2017

Quantum Lower Bound for a Tripartite Version of the Hidden Shift Problem

In this paper, we prove a polynomial lower bound of Ω(n^1/3) on the quan...
research
06/06/2022

Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks

This paper studies the round complexity of computing the weighted diamet...
research
04/22/2018

Union bound for quantum information processing

Gao's quantum union bound is a generalization of the union bound from pr...
research
08/04/2020

Recovering a perturbation of a matrix polynomial from a perturbation of its linearization

A number of theoretical and computational problems for matrix polynomial...
research
04/26/2022

Complexity of quantum circuits via sensitivity, magic, and coherence

Quantum circuit complexity-a measure of the minimum number of gates need...
research
04/10/2020

Hidden variables simulating quantum contextuality increasingly violate the Holevo bound

In this paper from 2011 we approach some questions about quantum context...

Please sign up or login with your details

Forgot password? Click here to reset