Discrete-time open quantum walks for vertex ranking in graphs

Area of Science:

• Quantum Information Science
• Network Science
• Computer Science

Background:

• Google's PageRank algorithm is crucial for web page ranking and quantifying vertex importance in classical networks.
• Quantum walks offer a new paradigm for information processing on graphs.

Purpose of the Study:

• To develop and present a new quantum PageRank algorithm.
• To extend the concept of discrete-time open quantum walks for network analysis.

Main Methods:

• Utilizing Weyl operators as Kraus operators to extend discrete-time open quantum walks.
• Implementing a quantum PageRank algorithm based on this extended quantum walk model.
• Comparing the quantum PageRank with classical PageRank on various complex networks.

Main Results:

• The proposed quantum PageRank algorithm quantifies vertex significance in networks.
• The quantum PageRank demonstrates faster convergence than other reported quantum methods.
• Performance is analyzed across diverse network types including scale-free, random, and spatial networks.

Conclusions:

• The developed quantum PageRank algorithm provides an efficient method for network analysis.
• This quantum approach offers a promising alternative to classical PageRank for complex systems.
• The study highlights the potential of quantum walks in advancing network science.