<--- Back to Details
First PageDocument Content
Quantum complexity theory / QMA / Probabilistic complexity theory / Proof theory / Model theory / IP / Probabilistically checkable proof / Cook–Levin theorem / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2013-01-14 01:47:53
Quantum complexity theory
QMA
Probabilistic complexity theory
Proof theory
Model theory
IP
Probabilistically checkable proof
Cook–Levin theorem
Time complexity
Theoretical computer science
Computational complexity theory
Applied mathematics

Improved Soundness for QMA with Multiple Provers

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Download Document from Source Website

File Size: 309,27 KB

Share Document on Facebook

Similar Documents

QMA 2019 MAS Topical Conference Quantitative Microanalysis June 24-27, 2019 University of Minnesota, MN

DocID: 1u5j4 - View Document

QMa_logo_k [Converted].eps

DocID: 1sKv0 - View Document

Q2 2016 Outlook & Review A QUARTERLY MARKET PERSPECTIVE FROM QMA’S ASSET ALLOCATION GROUP KEY POINTS Economic Outlook

DocID: 1swYP - View Document

Q4 2015 Outlook & Review A QUARTERLY MARKET PERSPECTIVE FROM QMA’S ASSET ALLOCATION GROUP KEY POINTS Economic Outlook

DocID: 1sf4g - View Document

Q3 2016 Outlook & Review A QUARTERLY MARKET PERSPECTIVE FROM QMA’S ASSET ALLOCATION GROUP KEY POINTS Economic Outlook

DocID: 1s60w - View Document