arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.3245quant-phcs.CC
收藏

线性光学的计算复杂性

The Computational Complexity of Linear Optics

Scott Aaronson, Alex Arkhipov

摘要:

我们给出了新的证据,证明量子计算机--而且,完全由线性光学元件构建的基本量子计算机--不能被经典计算机有效地模拟。特别是,我们定义了一个计算模型,其中产生相同的光子,通过线性光学网络发送,然后非自适应测量,以计算每种模式下的光子数。这个模型是未知的,也不被认为是通用的量子计算,事实上,我们讨论了使用当前技术实现该模型的前景。另一方面,我们证明了该模型是能够解决抽样问题和搜索问题,是经典的棘手的合理假设下。我们的第一个结果表明,如果存在一个多项式时间经典算法,它从与线性光网络相同的概率分布中采样,那么P^#P=BPP^NP,因此多项式层次结构坍缩到第三级。不幸的是,这个结果假设了一个非常精确的模拟。我们的主要结果表明,即使是一个近似的或嘈杂的经典模拟已经意味着多项式层次的崩溃。为此,我们需要两个未经证明的猜想:“高斯恒常猜想”,它说的是,它是#P-难以近似的永久矩阵A的独立N(0,1)高斯元素,具有高概率超过A;和“永久反浓度猜想”,它说,|根据(A)|>=sqrt(n!)/ Poly(n)在A上具有高概率。我们提出的证据,这些acquitures,这两个似乎有趣,即使除了我们的应用程序。这篇论文并不假设量子光学的知识。事实上,它的部分目标是以理论计算机科学家可以理解的独立方式,发展我们模型背后的非相互作用玻色子的美丽理论,以及它与永久函数的联系。

英文摘要:

We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode. This model is not known or believed to be universal for quantum computation, and indeed, we discuss the prospects for realizing the model using current technology. On the other hand, we prove that the model is able to solve sampling problems and search problems that are classically intractable under plausible assumptions. Our first result says that, if there exists a polynomial-time classical algorithm that samples from the same probability distribution as a linear-optical network, then P^#P=BPP^NP, and hence the polynomial hierarchy collapses to the third level. Unfortunately, this result assumes an extremely accurate simulation. Our main result suggests that even an approximate or noisy classical simulation would already imply a collapse of the polynomial hierarchy. For this, we need two unproven conjectures: the "Permanent-of-Gaussians Conjecture", which says that it is #P-hard to approximate the permanent of a matrix A of independent N(0,1) Gaussian entries, with high probability over A; and the "Permanent Anti-Concentration Conjecture", which says that |Per(A)|>=sqrt(n!)/poly(n) with high probability over A. We present evidence for these conjectures, both of which seem interesting even apart from our application. This paper does not assume knowledge of quantum optics. Indeed, part of its goal is to develop the beautiful theory of noninteracting bosons underlying our model, and its connection to the permanent function, in a self-contained way accessible to theoretical computer scientists.

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

↑