arrow
返回

Quantum Machine Learning Algorithm for Knowledge Graphs

delete2021-09-30
delete5
delete
OA
AI
Y
Yunpu Ma *
V
Volker Tresp
DOI:10.1145/3467982delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Semantic knowledge graphs are large-scale triple-oriented databases for knowledge representation and reasoning. Implicit knowledge can be inferred bymodeling the tensor representations generated fromknowledge graphs. However, as the sizes of knowledge graphs continue to grow, classical modeling becomes increasingly computationally resource intensive. This article investigates how to capitalize on quantum resources to accelerate the modeling of knowledge graphs. In particular, we propose the first quantum machine learning algorithm for inference on tensorized data, i.e., on knowledge graphs. Since most tensor problems are NP-hard [18], it is challenging to devise quantum algorithms to support the inference task. We simplify the modeling task by making the plausible assumption that the tensor representation of a knowledge graph can be approximated by its low-rank tensor singular value decomposition, which is verified by our experiments. The proposed sampling-based quantum algorithm achieves speedup with a polylogarithmic runtime in the dimension of knowledge graph tensor.
Keyword:
Knowledge graphs
relational database
quantum tensor singular value decomposition
quantum machine learning

期刊

A
ACM Transactions on Quantum Computing
IF:
6.8
论文数:
540
被引数:
508

机构

U
University of Munich
学者数:
5.7W
论文数: 4.2W
被引数: 68
引用论文

引用论文

err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容