ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR11-043 | 25th March 2011 08:45

A Linear-Optical Proof that the Permanent is #P-Hard

RSS-Feed




TR11-043
Authors: Scott Aaronson
Publication: 25th March 2011 08:45
Downloads: 1452
Keywords: 


Abstract:

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.



ISSN 1433-8092 | Imprint