arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.16331quant-ph
收藏

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

On the complexity of quantum link prediction in complex networks

João P. Moutinho, Duarte Magano, Bruno Coutinho

摘要:

链路预测方法使用已知网络数据中的模式来推断哪些连接可能丢失。以前的工作已经表明,连续时间量子行走可以用来表示基于路径的链接预测,我们在这里进一步研究,以开发一个更优化的量子算法。使用链接预测的采样框架,我们分析了产生一定数量的预测样本所需的输入网络的查询访问。考虑到这两个著名的经典的基于路径的算法使用的权力的邻接矩阵,以及我们提出的量子算法的基于路径的链路预测,我们认为,有一个多项式量子优势依赖于$N$,在网络中的节点数。我们进一步认为,我们的算法的复杂性,虽然次线性的$N$,是有限的复杂性进行量子模拟的网络的邻接矩阵,这可能被证明是一个重要的问题,在量子算法的发展一般网络科学。

英文摘要:

Link prediction methods use patterns in known network data to infer which connections may be missing. Previous work has shown that continuous-time quantum walks can be used to represent path-based link prediction, which we further study here to develop a more optimized quantum algorithm. Using a sampling framework for link prediction, we analyze the query access to the input network required to produce a certain number of prediction samples. Considering both well-known classical path-based algorithms using powers of the adjacency matrix as well as our proposed quantum algorithm for path-based link prediction, we argue that there is a polynomial quantum advantage on the dependence on $N$, the number of nodes in the network. We further argue that the complexity of our algorithm, although sub-linear in $N$, is limited by the complexity of performing a quantum simulation of the network's adjacency matrix, which may prove to be an important problem in the development of quantum algorithms for network science in general.

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

↑