First Page | Document Content | |
---|---|---|
![]() Date: 2009-12-01 22:56:24Quantum complexity theory Stochastic process PP Pi Boolean algebra PostBQP Theoretical computer science Applied mathematics Statistics | Add to Reading List |
![]() | Visio-sscs_dkw081808_extended.vsdDocID: rpHK - View Document |
![]() | Proving the power of postselection⋆ Abuzer Yakaryılmaz1, ⋆⋆ and A.C. Cem Say2, ⋆ ⋆ ⋆ 1 arXiv:1111.3125v1 [cs.CC] 14 Nov 2011DocID: nntQ - View Document |
![]() | PEPS and Postselection The computational complexity of PEPSDocID: 5OPp - View Document |
![]() | Visio-sscs_dkw081808_extended.vsdDocID: 5p5E - View Document |
![]() | A Linear-Optical Proof that the Permanent is #P-Hard Scott Aaronson∗ For Les Valiant, on the occasion of his Turing AwardDocID: 4AZt - View Document |