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

	Asymptotically faster quantum algorithms to solve multivariate quadratic equations Daniel J. Bernstein1 and Bo-Yin Yang2 1 Department of Computer Science DocID: 1xUCK - View Document
	Quantum Physics Meets Distributed Computing No one can doubt, that in the near future, our lives will be changed by a number of exciting scientific progresses. The quantum computer could be such a major invention. Using DocID: 1vjlT - View Document
	Chapter 2 Quantum Computing Principles The massive amount of processing power generated by computer manufacturers has not yet been able to quench our thirst for speed and computing capacity. In 1947, American computer e DocID: 1v5Pz - View Document
	CSE 599d - Quantum Computing Grover’s Algorithm Dave Bacon Department of Computer Science & Engineering, University of Washington After Peter Shor demonstrated that quantum computers could efficiently factor, great in DocID: 1v35w - View Document
	Dartmouth College Computer Science Technical Report TR2002The Future of Cryptography Under Quantum Computers DocID: 1uujH - View Document