线性光学单向计算的最小资源
Minimal resources for linear optical one-way computing
摘要：
利用线性光学的工具箱，我们解决了需要多少个最大纠缠光子对才能建立用于量子计算的团簇态的问题。由于双轨编码中所需的门必然是概率性的，具有已知的最佳成功概率，因此从经典控制的角度来看，这个问题相当于找到建立集群状态的最佳策略。我们开发了一个经典的战略的概念，并提出了严格的声明，最终的最大和最小使用资源的全局最优策略。我们发现，这种策略-也是最强大的退相干方面-产生的优势已经超过一个数量级的最大纠缠对的数量时，建设链的预期长度L=40，相比其他合法的策略。对于二维团簇状态，我们提出了第一个方案，实现最佳的二次渐近标度。这一分析表明，选择适当的经典控制，导致一个非常显着的减少资源消耗。
英文摘要：
We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies, and present rigorous statements on the ultimate maximal and minimal use of resources of the globally optimal strategy. We find that this strategy - being also the most robust with respect to decoherence - gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of L=40, compared to other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling. This analysis shows that the choice of appropriate classical control leads to a very significant reduction in resource consumption.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
