dc.contributor.author | Aaronson, Scott | |
dc.date.accessioned | 2012-08-09T14:47:58Z | |
dc.date.available | 2012-08-09T14:47:58Z | |
dc.date.issued | 2011-12 | |
dc.date.submitted | 2011-04 | |
dc.identifier.issn | 1471-2946 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/72067 | |
dc.description.abstract | One of the crown jewels of complexity theory is Valiant's 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 owing to Knill, Laflamme and Milburn—one can give a different and arguably more intuitive proof of this theorem. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (grant 0844626) | en_US |
dc.description.sponsorship | United States. Defense Advanced Research Projects Agency (YFA grant) | en_US |
dc.language.iso | en_US | |
dc.publisher | Royal Society, The | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1098/rspa.2011.0232 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | A linear-optical proof that the permanent is #P-hard | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Aaronson, S. “A linear-optical proof that the permanent is #P-hard.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467.2136 (2011): 3393-3405. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.approver | Aaronson, Scott | |
dc.contributor.mitauthor | Aaronson, Scott | |
dc.relation.journal | Proceedings of The Royal Society A: Mathematical, Physical and Engineering Sciences | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Aaronson, S. | en |
dc.identifier.orcid | https://orcid.org/0000-0003-1333-4045 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |