积式是P-硬的线性光学证明
A Linear-Optical Proof that the Permanent is #P-Hard
摘要:
复杂性理论的皇冠上的宝石之一是Valiant在1979年的定理,即计算n*n矩阵的积和式是#P-hard的。在这里,我们表明,通过使用线性光学量子计算的模型-特别是由于Knill,Laflamme和Milburn的普适性定理-可以给出这个定理的不同的和可以说更直观的证明。
英文摘要:
One of the crown jewels of complexity theory is Valiant's 1979 theorem that computing the permanent of an n*n matrix is #P-hard. Here we show that, by using the model of linear-optical quantum computing---and in particular, a universality theorem due to Knill, Laflamme, and Milburn---one can give a different and arguably more intuitive proof of this theorem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。