arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.04768quant-phcond-mat.dis-nncs.SIphysics.bio-ph
收藏

复杂网络中的量子链路预测

Quantum Link Prediction in Complex Networks

João P. Moutinho, André Melo, Bruno Coutinho, István A. Kovács, Yasser Omar

摘要:

预测物理、生物、社会或技术网络中的新联系具有重大的科学和社会影响。基于路径的链接预测方法利用节点之间的偶数和奇数长度路径的显式计数来量化评分函数并推断新的或未观察到的链接。在这里,我们提出了一个量子算法,基于路径的链接预测,QLP,使用受控的连续时间量子行走编码偶数和奇数路径为基础的预测分数。通过对几个真实网络的经典模拟,我们证实了量子行走评分函数与其他基于路径的链接预测器的性能相似。在一个简短的复杂性分析中,我们确定了我们的方法在揭示基于路径的链路预测的量子加速方面的潜力。

英文摘要:

Predicting new links in physical, biological, social, or technological networks has a significant scientific and societal impact. Path-based link prediction methods utilize explicit counting of even and odd-length paths between nodes to quantify a score function and infer new or unobserved links. Here, we propose a quantum algorithm for path-based link prediction, QLP, using a controlled continuous-time quantum walk to encode even and odd path-based prediction scores. Through classical simulations on a few real networks, we confirm that the quantum walk scoring function performs similarly to other path-based link predictors. In a brief complexity analysis we identify the potential of our approach in uncovering a quantum speedup for path-based link prediction.

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

↑