Physics – Quantum Physics
Scientific paper
2011-09-08
Physics
Quantum Physics
12 pages, 2 figures, to appear in Proceedings of the Royal Society A. doi: 10.1098/rspa.2011.0232
Scientific paper
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.
No associations
LandOfFree
A Linear-Optical Proof that the Permanent is #P-Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Linear-Optical Proof that the Permanent is #P-Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Linear-Optical Proof that the Permanent is #P-Hard will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-475020