A linear-optical proof that the permanent is #P-hard
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 dif...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Royal Society, The,
2012-08-09T14:47:58Z.
|
| Subjects: | |
| Online Access: | Get fulltext |