2 code implementations • 14 Nov 2010 • Scott Aaronson, Alex Arkhipov
For this, we need two unproven conjectures: the "Permanent-of-Gaussians Conjecture", which says that it is #P-hard to approximate the permanent of a matrix A of independent N(0, 1) Gaussian entries, with high probability over A; and the "Permanent Anti-Concentration Conjecture", which says that |Per(A)|>=sqrt(n!
Quantum Physics Computational Complexity
