On Quantum Interactive Proofs with Short Messages

First Page		Document Content
Date: 2012-12-09 02:04:20 Quantum complexity theory Models of computation Probabilistic complexity theory Quantum information science QIP QMA Interactive proof system IP Arthur–Merlin protocol Theoretical computer science Computational complexity theory Applied mathematics		On Quantum Interactive Proofs with Short Messages Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 231,77 KB Share Document on Facebook

	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rgbF - View Document
	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 DocID: 1raDV - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1r8mX - View Document
	An Eﬃcient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant DocID: 1qOst - View Document
	JOURNAL OF COMPUTER AND SYSTEM SCIENCES DocID: 1qf4Y - View Document