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

	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