arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv quant-ph/0606205quant-ph
收藏

量子行走算法和量子通信的局域化及其后果

Localization and its consequences for quantum walk algorithms and quantum communication

J. P. Keating, N. Linden, J. C. F. Matthews, A. Winter

摘要:

相对于经典粒子在同一图上的扩散,量子在特定图上的行走速度呈指数级增长,这是一个惊人的观察结果。它提出了新的快速量子算法的可能性。我们在这里指出,通过局域化现象,量子力学也可以导致这些图上运动的指数抑制(即使在没有退相干的情况下)。事实上,对于图的物理体现,这将是通用的行为。它也对使用自旋网络(包括自旋链)作为量子通信通道的建议产生了影响。

英文摘要:

The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that quantum mechanics can also lead, through the phenomenon of localization, to exponential suppression of motion on these graphs (even in the absence of decoherence). In fact, for physical embodiments of graphs, this will be the generic behaviour. It also has implications for proposals for using spin networks, including spin chains, as quantum communication channels.

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

↑