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

	Entanglement in correlated quantum systems: A quantum information perspective DocID: 1rbGG - View Document
	The density-matrix renormalization group in the age of matrix product states arXiv:1008.3477v2 [cond-mat.str-el] 3 JanUlrich Schollw¨ock DocID: 1pZqT - View Document
	ITensor E.M. Stoudenmire Simons Summer School - June 2016 ITensor – Key features DocID: 1pYtE - View Document
	Computational Science and Engineering (Int. Master’s Program) ¨ MUNCHEN ¨ TECHNISCHE UNIVERSITAT DocID: 1pU2S - View Document
	Welcome to the Group of Dr. Michael Römelt Dr. Michael Römelt Lehrstuhl für Theoretische Chemie Ruhr-Universität Bochum DBochum Germany DocID: 1p0R1 - View Document