PEPS and Postselection The computational complexity of PEPS

First Page		Document Content
Date: 2014-05-30 09:02:45 PostBQP PP QMA Computational complexity theory Quantum computer BQP Density matrix renormalization group Oracle machine PEPS Theoretical computer science Applied mathematics Quantum complexity theory		PEPS and Postselection The computational complexity of PEPS Add to Reading List Source URL: www.mpq.mpg.de Download Document from Source Website File Size: 721,48 KB Share Document on Facebook

	Visio-sscs_dkw081808_extended.vsd DocID: rpHK - View Document
	Proving the power of postselection⋆ Abuzer Yakaryılmaz1, ⋆⋆ and A.C. Cem Say2, ⋆ ⋆ ⋆ 1 arXiv:1111.3125v1 [cs.CC] 14 Nov 2011 DocID: nntQ - View Document
	PEPS and Postselection The computational complexity of PEPS DocID: 5OPp - View Document
	Visio-sscs_dkw081808_extended.vsd DocID: 5p5E - View Document
	A Linear-Optical Proof that the Permanent is #P-Hard Scott Aaronson∗ For Les Valiant, on the occasion of his Turing Award DocID: 4AZt - View Document