Improved Soundness for QMA with Multiple Provers

First Page		Document Content
Date: 2013-01-14 01:47:53 Quantum complexity theory QMA Probabilistic complexity theory Proof theory Model theory IP Probabilistically checkable proof Cook–Levin theorem Time complexity Theoretical computer science Computational complexity theory Applied mathematics		Improved Soundness for QMA with Multiple Provers Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 309,27 KB Share Document on Facebook

	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document
	SelectNet_Manual_v2_April_2012.pdf DocID: 1qMoc - View Document
	WV Public Employees Insurance Agency Frequently Asked Questions on Picking a Primary Care Provider Q. Why is PEIA making me pick a physician? DocID: 1qjEP - View Document
	Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192. DocID: 1oP1q - View Document
	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 DocID: 1mroB - View Document