A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract

First Page		Document Content
Date: 2014-11-28 23:31:17 Quantum information science Complexity classes Interactive proof system QMA NEXPTIME IP Probabilistically checkable proof Qubit Quantum computer Theoretical computer science Applied mathematics Computational complexity theory		A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract Add to Reading List Source URL: www.quantum-lab.org Download Document from Source Website File Size: 139,37 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