Sensitivity of quantum PageRank
This work addresses stability analysis for quantum PageRank algorithms, which is incremental as it builds on existing methods to assess robustness in quantum information processing.
The paper tackles the sensitivity of quantum PageRank to small perturbations in the Google matrix, using finite-dimensional perturbation theory to estimate changes and provide bounds for convergence radius and error in the perturbed PageRank expansion.
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.