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 |
QMA 2019 MAS Topical Conference Quantitative Microanalysis June 24-27, 2019 University of Minnesota, MNDocID: 1u5j4 - View Document | |
QMa_logo_k [Converted].epsDocID: 1sKv0 - View Document | |
Q2 2016 Outlook & Review A QUARTERLY MARKET PERSPECTIVE FROM QMA’S ASSET ALLOCATION GROUP KEY POINTS Economic OutlookDocID: 1swYP - View Document | |
Q4 2015 Outlook & Review A QUARTERLY MARKET PERSPECTIVE FROM QMA’S ASSET ALLOCATION GROUP KEY POINTS Economic OutlookDocID: 1sf4g - View Document | |
Q3 2016 Outlook & Review A QUARTERLY MARKET PERSPECTIVE FROM QMA’S ASSET ALLOCATION GROUP KEY POINTS Economic OutlookDocID: 1s60w - View Document |