First Page | Document Content | |
---|---|---|
Date: 2014-11-28 23:31:17Quantum 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† AbstractAdd to Reading ListSource URL: www.quantum-lab.orgDownload Document from Source WebsiteFile Size: 139,37 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |