solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看134次
Quantum Walk Search on Kronecker Graphs. (arXiv:1804.10560v2 [quant-ph] UPDATED)
来源于:arXiv
Kronecker graphs, obtained by repeatedly performing the Kronecker product of
the adjacency matrix of an "initiator" graph with itself, have risen in
popularity in network science due to their ability to generate complex networks
with real-world properties. In this paper, we explore spatial search by
continuous-time quantum walk on Kronecker graphs. Specifically, we give
analytical proofs for quantum search on first-, second-, and third-order
Kronecker graphs with the complete graph as the initiator, showing that search
takes Grover's $O(\sqrt{N})$ time. Numerical simulations indicate that
higher-order Kronecker graphs with the complete initiator also support optimal
quantum search. 查看全文>>