DeepAI AI Chat

Sensitivity of quantum PageRank

06/27/2019

∙

by Hirotada Honda, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

∙ 06/10/2021

Perturbation Theory for Quantum Information

We report lowest-order series expansions for primary matrix functions of...

0 Michael R Grace, et al. ∙

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

0 Aleksandrs Belovs, et al. ∙

∙ 06/06/2022

Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks

This paper studies the round complexity of computing the weighted diamet...

0 Xudong Wu, et al. ∙

∙ 04/22/2018

Union bound for quantum information processing

Gao's quantum union bound is a generalization of the union bound from pr...

0 Samad Khabbazi Oskouei, et al. ∙

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

0 Andrii Dmytryshyn, et al. ∙

∙ 09/22/2022

Quantum theory in finite dimension cannot explain every general process with finite memory

Arguably, the largest class of stochastic processes generated by means o...

0 Marco Fanizza, et al. ∙

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

0 Adán Cabello, et al. ∙