arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.00316quant-phcond-mat.dis-nncs.NEmath.QAnlin.CD
收藏

Order from chaos in quantum walks on cyclic graphs

Abhisek Panda, Colin Benjamin

英文摘要:

It has been shown classically that combining two chaotic random walks can yield an ordered(periodic) walk. Our aim in this paper is to find a quantum analog for this rather counter-intuitive result. We study chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on a 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. We extend our results to even-numbered cyclic graphs, specifically a 4-cycle graph too. Our results will be relevant in quantum cryptography and quantum chaos control.

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

↑