arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.2426quant-ph
收藏

线性光学量子计算的BosonSampling模型的容错性

Error tolerance of the BosonSampling model for linear optics quantum computing

Peter P. Rohde, Timothy C. Ralph

摘要:

线性光学量子计算(LOQC)是实现可扩展量子计算(QC)的一种很有前途的方法。然而,这种方法具有非常苛刻的物理资源要求。最近,Aaronson和Arkhipov表明,一个简化的模型,它避免了对快速前馈和后选择的要求,虽然可能无法有效地解决BQP完全问题,但可以解决一个有趣的抽样问题,被认为是经典的困难。损耗和模式失配是这种系统中误差的主要来源。我们提供的证据表明,即使有损耗的系统,或模式不匹配的系统,很可能是经典的难以模拟。这对于希望演示这种系统的实验者来说是有实际意义的,因为它表明即使在它们的实现中有错误,它们也可能实现一种经典上难以模拟的算法。我们的结果同样适用于多步行者量子行走模型。

英文摘要:

Linear optics quantum computing (LOQC) is a promising approach to implementing scalable quantum computation (QC). However, this approach has very demanding physical resource requirements. Recently, Aaronson & Arkhipov showed that a simplified model, which avoids the requirement for fast feed-forward and post-selection, while likely not capable of solving BQP-complete problems efficiently, can solve an interesting sampling problem, believed to be classically hard. Loss and mode-mismatch are the dominant sources of error in such systems. We provide evidence that even lossy systems, or systems with mode-mismatch, are likely to be classically hard to simulate. This is of practical interest to experimentalists wishing to demonstrate such systems, since it suggests that even with errors in their implementation, they are likely implementing an algorithm which is classically hard to simulate. Our results also equivalently apply to the multi-walker quantum walk model.

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

↑