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

	On Quantum Interactive Proofs with Short Messages DocID: 13NSI - View Document
	Monday, July 17 9:30-10:30 G¨ odel and Computations, Pavel Pudlak 10:30-11:00 Coffee 11:00-11:30 Polynomial Identity Testing for Depth 3 Circuits, Neeraj Kayal, Nitin Saxena DocID: 13fgr - View Document
	Proofs that Yield All Languages Proof DocID: 132BP - View Document
	QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract DocID: Qoyk - View Document
	On the Power of a Unique Quantum Witness DocID: nhgH - View Document