Variational Quantum PageRank

• URL: http://arxiv.org/abs/2304.12232v1
• Date: Wed, 19 Apr 2023 23:49:32 GMT
• Title: Variational Quantum PageRank
• Authors: Christopher Sims
• Abstract summary: PageRank is a graph-based algorithm that ranks pages based on how many other pages link to them. This work develops a variational quantum version of the PageRank algorithm and compares the performance of the two algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 how many other pages link to them. This work develops a variational quantum version of the PageRank algorithm and compares the performance of the two algorithms. It is found that quantum PageRank performs better at ranking websites than the normal PageRank algorithm

Related papers

• Quantum versatility in PageRank [6.797840514031587]
  arbitrary phase rotations (APR) have been introduced in the underlying Szegedy's quantum walk of quantum PageRank algorithm. We study the role APR plays in quantum PageRank and discover the resulting versatility from quantumness. Our results present the quantum-enabled perspective for PageRanking and shed light on the design and application of practical quantum PageRank algorithms.
  arXiv  Detail & Related papers  (2024-11-20T08:14:27Z)
• AGRaME: Any-Granularity Ranking with Multi-Vector Embeddings [53.78802457488845]
  We introduce the idea of any-granularity ranking, which leverages multi-vector embeddings to rank at varying levels of granularity. We demonstrate the application of proposition-level ranking to post-hoc citation addition in retrieval-augmented generation.
  arXiv  Detail & Related papers  (2024-05-23T20:04:54Z)
• Randomized SearchRank: A Semiclassical Approach to a Quantum Search Engine [0.0]
  The quantum SearchRank algorithm is a promising tool for a future quantum search engine based on PageRank quantization. We propose a modification of the algorithm, replacing the underlying Szegedy quantum walk with a semiclassical walk.
  arXiv  Detail & Related papers  (2024-01-03T06:00:23Z)
• Regularization-Based Methods for Ordinal Quantification [49.606912965922504]
  We study the ordinal case, i.e., the case in which a total order is defined on the set of n>2 classes. We propose a novel class of regularized OQ algorithms, which outperforms existing algorithms in our experiments.
  arXiv  Detail & Related papers  (2023-10-13T16:04:06Z)
• Bipartite Ranking Fairness through a Model Agnostic Ordering Adjustment [54.179859639868646]
  We propose a model agnostic post-processing framework xOrder for achieving fairness in bipartite ranking. xOrder is compatible with various classification models and ranking fairness metrics, including supervised and unsupervised fairness metrics. We evaluate our proposed algorithm on four benchmark data sets and two real-world patient electronic health record repositories.
  arXiv  Detail & Related papers  (2023-07-27T07:42:44Z)
• HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection [75.84584400866254]
  We propose a new algorithm selector leveraging special forests, combining the strengths of both approaches while alleviating their weaknesses. HARRIS' decisions are based on a forest model, whose trees are created based on optimized on a hybrid ranking and regression loss function.
  arXiv  Detail & Related papers  (2022-10-31T14:06:11Z)
• Generalized Quantum Google PageRank Algorithm with Arbitrary Phase Rotations [0.0]
  We present a modification of the quantum PageRank introducing arbitrary phase rotations (APR) in the underlying Szegedy's quantum walk. We have analyzed the behavior of the new algorithms in a small generic graph, observing that a decrease of the phase reduces the standard deviation of the instantaneous PageRank. We have found that one of our new algorithms whose PageRank distribution resembles the classical one, has a stability similar to the original quantum algorithm.
  arXiv  Detail & Related papers  (2022-09-27T15:15:54Z)
• Resolving degeneracies in Google search via quantum stochastic walks [0.0]
  The PageRank algorithm is the backbone of Google search, ranking web pages according to relevance and recency. We employ quantum walks (QSWs) to improve the classical PageRank (CPR) algorithm based on classical continuous time walks. For some networks, the two QSW schemes obtain a convergence time lower than CPR and an almost degeneracy-free ranking compared to CPR.
  arXiv  Detail & Related papers  (2022-07-23T06:23:33Z)
• PiRank: Learning To Rank via Differentiable Sorting [85.28916333414145]
  We propose PiRank, a new class of differentiable surrogates for ranking. We show that PiRank exactly recovers the desired metrics in the limit of zero temperature.
  arXiv  Detail & Related papers  (2020-12-12T05:07:36Z)
• Mastering Rate based Curriculum Learning [78.45222238426246]
  We argue that the notion of learning progress itself has several shortcomings that lead to a low sample efficiency for the learner. We propose a new algorithm, based on the notion of mastering rate, that significantly outperforms learning progress-based algorithms.
  arXiv  Detail & Related papers  (2020-08-14T16:34:01Z)
• TopRank+: A Refinement of TopRank Algorithm [0.0]
  A novel online learning algorithm was proposed based on topological sorting. In this work, we utilize method of mixtures and expansions of certain implicit function to provide a tighter, iterated-log-like boundary for the inequalities.
  arXiv  Detail & Related papers  (2020-01-21T15:44:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.