论文标题

在循环图上量子步行中的混乱订购

Order from chaos in quantum walks on cyclic graphs

论文作者

Panda, Abhisek, Benjamin, Colin

论文摘要

经典地,结合两个混乱的随机步行可以产生有序的(周期性)步行。我们在本文中的目的是为这个相当违反直觉的结果找到一个量子类似物。我们研究了环状量子步行的混乱和周期性,并专注于独特的情况,其中通过在同一图上的两个混乱量子步行的确定性组合生成了3周期图上的周期性量子步行。我们将结果扩展到偶数循环图,特别是4周期图。我们的结果将与量子密码学和量子混乱控制有关。

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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源