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

	The Space ‟Just Above” BQP Adam Bouland Based on joint work with Scott Aaronson, Joseph Fitzsimons and Mitchell Lee arXiv: 1412:6507 ITCS ‘16 DocID: 1sxeE - View Document
	NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗ DocID: 1pr8U - View Document
	Limitations of Quantum Advice and One-Way Communication DocID: 1pojZ - View Document
	LA-URTheory Component of the Quantum Information Processing DocID: 1p9P7 - View Document
	c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation DocID: 1oB0X - View Document