ECCC-Report TR11-043https://eccc.weizmann.ac.il/report/2011/043Comments and Revisions published for TR11-043en-usFri, 25 Mar 2011 08:45:44 +0200
Paper TR11-043
| A Linear-Optical Proof that the Permanent is #P-Hard |
Scott Aaronson
https://eccc.weizmann.ac.il/report/2011/043One 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.Fri, 25 Mar 2011 08:45:44 +0200https://eccc.weizmann.ac.il/report/2011/043