arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1303.5319quant-phcs.DS
收藏

相位阻尼下的胶合树算法

Glued trees algorithm under phase damping

J. Lockhart, C. Di Franco, M. Paternostro

摘要:

我们研究了Childs等人在[STOC '03,Proc.35th ACM Symposium on Theory of Computing(2004)59]中描述的胶合树算法在退相干下的行为。我们考虑一个离散时间的连续时间量子行走协议的重新制定和应用相位阻尼通道的硬币状态,调查这样的机制上的步行者出现在图的目标顶点的概率的效果。我们特别注意任何潜在的优势来自使用弱退相干的传播的步行整个胶合树图。

英文摘要:

We study the behaviour of the glued trees algorithm described by Childs et al. in [STOC `03, Proc. 35th ACM Symposium on Theory of Computing (2004) 59] under decoherence. We consider a discrete time reformulation of the continuous time quantum walk protocol and apply a phase damping channel to the coin state, investigating the effect of such a mechanism on the probability of the walker appearing on the target vertex of the graph. We pay particular attention to any potential advantage coming from the use of weak decoherence for the spreading of the walk across the glued trees graph.

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

↑