arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.13451quant-phcs.NI
收藏

具有任意相位旋转的广义量子PageRank算法

Generalized Quantum PageRank Algorithm with Arbitrary Phase Rotations

Sergio A. Ortega, Miguel A. Martin-Delgado

摘要:

PageRank算法的量化是未来量子互联网的一个有前途的工具。在这里,我们提出了一个修改的量子PageRank引入任意相位旋转(APR)的基础Szegedy的量子行走。我们定义了三种不同的APR计划,只有一个阶段作为一个自由度。我们已经在一个小的通用图中分析了这些算法的行为,观察到相位的减少降低了瞬时PageRank的标准差,因此可以更好地区分网络的节点。但该算法收敛时间较长,不能任意减小相位。有了这些结果,我们为相位选择了一个具体的值,以便以后将算法应用于复杂的无标度图。在这些网络中,原始的量子PageRank能够打破剩余节点的简并性,并检测经典算法抑制的次要枢纽。然而,根据PageRank的定义,并不是所有检测到的二级枢纽都是真实的。一些APR方案可以克服这个问题,恢复退化的剩余节点,突出真正的次要枢纽的网络。最后,我们研究了新算法的稳定性。最初的量子算法被认为比经典算法更稳定。我们已经发现,我们的算法之一,其PageRank分布类似于经典的,具有类似于原来的量子算法的稳定性。

英文摘要:

The quantization of the PageRank algorithm is a promising tool for a future quantum internet. Here we present a modification of the quantum PageRank introducing arbitrary phase rotations (APR) in the underlying Szegedy's quantum walk. We define three different APR schemes with only one phase as a degree of freedom. We have analyzed the behavior of these algorithms in a small generic graph, observing that a decrease of the phase reduces the standard deviation of the instantaneous PageRank, so the nodes of the network can be distinguished better. However, the algorithm takes more time to converge, so the phase can not be decreased arbitrarily. With these results we choose a concrete value for the phase to later apply the algorithm to complex scale-free graphs. In these networks, the original quantum PageRank is able to break the degeneracy of the residual nodes and detect secondary hubs that the classical algorithm suppresses. Nevertheless, not all of the detected secondary hubs are real according to the PageRank's definition. Some APR schemes can overcome this problem, restoring the degeneration of the residual nodes and highlighting the truly secondary hubs of the networks. Finally, we have studied the stability of the new algorithms. The original quantum algorithm was known to be more stable than the classical. We have found that one of our algorithms, whose PageRank distribution resembles the classical one, has a stability similar to the original quantum algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑