arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2507.02472quant-ph
收藏

快速变分知识图谱嵌入

Fast variational knowledge graph embedding

Pulak Ranjan Giri, Mori Kurokawa, Kazuhiro Saito

AI总结:

本文提出利用量子叠加态同时训练知识图谱中多个元素,在变分量子电路嵌入方法基础上进一步降低计算时间,提升知识图谱嵌入效率。

摘要:

以向量形式嵌入知识图谱(KG)的实体和关系,对于知识图谱数据库在链接预测、知识图谱补全和推荐等多个下游任务中的操作处理是一个重要方面。由于知识图谱数据库规模不断增长,经典计算机高效训练模型已成为一项艰巨任务。量子计算机可以通过将实体编码到多项式深度的变分量子电路中,帮助加速知识图谱的嵌入过程。通常,此类依赖变分电路的量子经典算法在每个训练轮次的时间复杂度为 $\mathcal{O}(N \mbox{poly}(\log M))$,其中 $N$ 是知识图谱中的元素数量,$M$ 是知识图谱中每个实体的特征数量。在本文中,我们通过在叠加态中训练知识图谱的多个元素来利用额外的量子优势,从而进一步减少知识图谱嵌入模型的计算时间。

英文摘要:

Embedding of a knowledge graph(KG) entities and relations in the form of vectors is an important aspect for the manipulation of the KG database for several downstream tasks, such as link prediction, knowledge graph completion, and recommendation. Because of the growing size of the knowledge graph databases, it has become a daunting task for the classical computer to train a model efficiently. Quantum computer can help speedup the embedding process of the KGs by encoding the entities into a variational quantum circuit of polynomial depth. Usually, the time complexity for such variational circuit-dependent quantum classical algorithms for each epoch is $\mathcal{O}(N \mbox{poly}(\log M))$, where $N$ is number of elements in the knowledge graph and $M$ is the number of features of each entities of the knowledge graph. In this article we exploit additional quantum advantage by training multiple elements of KG in superpositions, thereby reducing the computing time further for the knowledge graph embedding model.

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

↑