Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs

• URL: http://arxiv.org/abs/2404.14770v2
• Date: Mon, 14 Oct 2024 05:56:59 GMT
• Title: Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs
• Authors: Supriyo Dutta,
• Abstract summary: This article presents a new quantum PageRank algorithm on graphs using discrete-time open quantum walks. Google's PageRank is an essential algorithm for arranging the web pages on the World Wide Web in classical computation.
• Score: 0.0
• License:
• Abstract: This article presents a new quantum PageRank algorithm on graphs using discrete-time open quantum walks. Google's PageRank is an essential algorithm for arranging the web pages on the World Wide Web in classical computation. From a broader perspective, it is also a fundamental measure for quantifying the importance of vertices in a network. Similarly, the new quantum PageRank also serves to quantify the significance of a network's vertices. In this work, we extend the concept of discrete-time open quantum walk on arbitrary directed and undirected graphs by utilizing the Weyl operators as Kraus operators. This new model of quantum walk is useful for building up the quantum PageRank algorithm, discussed in this article. We compare the classical PageRank and the newly defined quantum PageRank for different types of complex networks, such as the scale-free network, Erd\H{o}s-R\'enyi random network, Watts-Strogatz network, spatial network, Zachary Karate club network, GNC, GN, GNR networks, Barab\'asi and Albert network, etc. In addition, we study the convergence of the quantum PageRank process and its dependency on the damping factor $\alpha$. We observe that this quantum pagerank procedure is faster than many other proposals reported in the literature.

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)
• Hybrid Quantum-Classical Machine Learning with String Diagrams [49.1574468325115]
  This paper develops a formal framework for describing hybrid algorithms in terms of string diagrams. A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces.
  arXiv  Detail & Related papers  (2024-07-04T06:37:16Z)
• 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)
• A quantum walk-based scheme for distributed searching on arbitrary graphs [0.0]
  A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. This work introduces a new quantum walk-based searching scheme, designed to search nodes or edges on arbitrary graphs.
  arXiv  Detail & Related papers  (2023-10-16T14:35:05Z)
• Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions [66.27337498864556]
  This paper presents a comprehensive survey of entanglement-assisted quantum networks. It provides a detailed overview of the network structure, working principles, and development stages. It also emphasizes open research directions, including architecture design, entanglement-based network issues, and standardization.
  arXiv  Detail & Related papers  (2023-07-24T02:48:22Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• 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)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• TensorFlow Solver for Quantum PageRank in Large-Scale Networks [12.937513443750804]
  We present an efficient solver for quantum PageRank using the Runge-Kutta method to reduce the matrix dimension to O(N2) and employing parallel computing. Compared with the previous quantum PageRank solver, our solver dramatically reduces the required memory and time to only 1% and 0.2%, respectively, making it practical to work in a normal computer with a memory of 4-8 GB in no more than 100 seconds.
  arXiv  Detail & Related papers  (2020-03-10T18:58:15Z)
• Machine learning transfer efficiencies for noisy quantum walks [62.997667081978825]
  We show that the process of finding requirements on both a graph type and a quantum system coherence can be automated. The automation is done by using a convolutional neural network of a particular type that learns to understand with which network and under which coherence requirements quantum advantage is possible. Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.
  arXiv  Detail & Related papers  (2020-01-15T18:36:53Z)

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.