arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0610240quant-ph

Optimal computation with non-unitary quantum walks

Viv Kendon, Olivier Maloyer

英文摘要:

Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these properties, producing a more uniform distribution on the line, and faster mixing times on the cycle. We investigate the interplay between quantum and random dynamics by comparing the resources required, and examining numerically how the level of quantum correlations varies during the walk. We show numerically that the optimal non-unitary quantum walk proceeds such that the quantum correlations are nearly all removed at the point of the final measurement. This requires only O(log T) random bits for a quantum walk of T steps

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

↑