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

基于样本复杂性的玻色子采样

Boson-Sampling in the light of sample complexity

C. Gogolin, M. Kliesch, L. Aolita, J. Eisert

摘要:

玻色子采样是一个经典的计算困难的问题,可以-在原则上-有效地解决量子线性光网络。最近,一股实验活动的热潮已经点燃,目的是开发这种设备作为量子模拟器的可行实例。如果描述光网络的幺正矩阵是由Haar测度得到的,那么即使是近似的玻色子采样也被认为是困难的。在这项工作中,我们表明,在这种设置中,概率指数接近1的玻色子的数量,没有对称算法可以区分玻色子采样分布从均匀的一个比指数多的样本。这意味着这两个分布在没有详细的先验知识的情况下在操作上是不可区分的。我们仔细讨论的前景,有效地利用知识的实施酉设计非对称算法,可能会改善这一点。我们的结论是,由于玻色子采样被认为是困难的,有效的经典认证的玻色子采样设备似乎是遥不可及的事实。

英文摘要:

Boson-Sampling is a classically computationally hard problem that can - in principle - be efficiently solved with quantum linear optical networks. Very recently, a rush of experimental activity has ignited with the aim of developing such devices as feasible instances of quantum simulators. Even approximate Boson-Sampling is believed to be hard with high probability if the unitary describing the optical network is drawn from the Haar measure. In this work we show that in this setup, with probability exponentially close to one in the number of bosons, no symmetric algorithm can distinguish the Boson-Sampling distribution from the uniform one from fewer than exponentially many samples. This means that the two distributions are operationally indistinguishable without detailed a priori knowledge. We carefully discuss the prospects of efficiently using knowledge about the implemented unitary for devising non-symmetric algorithms that could potentially improve upon this. We conclude that due to the very fact that Boson-Sampling is believed to be hard, efficient classical certification of Boson-Sampling devices seems to be out of reach.

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

↑