.png){kind=icon}
返回
Quantum walks on regular uniform hypergraphs
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-018-27825-z.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information stored inherently. Therefore, we can explore the potential of quantum walks on hypergraphs. In this paper, by presenting the one-to-one correspondence between regular uniform hypergraphs and bipartite graphs, we construct a model for quantum walks on bipartite graphs of regular uniform hypergraphs with Szegedy's quantum walks, which gives rise to a quadratic speed-up. Furthermore, we deliver spectral properties of the transition matrix, given that the cardinalities of the two disjoint sets are different in the bipartite graph. Our model provides the foundation for building quantum algorithms on the strength of quantum walks on hypergraphs, such as quantum walks search, quantized Google's PageRank, and quantum machine learning.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
27.9W
被引数:
83.5W
机构
暂无机构信息
引用论文
分享收藏Innate immunity and the biological relevance of the acquired immune response固有免疫和获得性免疫应答的生物学相关性.png)
QJMOAAI
QJMIF0
OAAI分享收藏
查看更多内容