.png){kind=icon}
返回
Quantum search with prior knowledge
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-023-3972-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The combination of contextual side information and search is a powerful paradigm in the scope of artificial intelligence. The prior knowledge enables the identification of possible solutions but may be imperfect. Contextual information can arise naturally, for example in game AI where prior knowledge is used to bias move decisions. In this work we investigate the problem of taking quantum advantage of contextual information, especially searching with prior knowledge. We propose a new generalization of Grover's search algorithm that achieves the optimal expected success probability of finding the solution if the number of queries is fixed. Experiments on small-scale quantum circuits verify the advantage of our algorithm. Since contextual information exists widely, our method has wide applications. We take game tree search as an example.
Keyword:
quantum computing
quantum search
quantum query algorithm
prior knowledge
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Fabrication of porous hollow γ-Al2O3 nanofibers by facile electrospinning and its application for water remediation静电纺丝法制备多孔中空 γ-Al2O3纳米纤维及其在水体修复中的应用
PREAI
分享收藏分享收藏
查看更多内容