Back to Results
First PageMeta 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


Improved Soundness for QMA with Multiple Provers
Add to Reading List

Document Date: 2013-01-14 01:47:53

Open Document

File Size: 309,27 KB

Share Result on Facebook

Company

3SAT / CNF / Fn / Gap / Creative Commons / /

Country

Sudan / /

Event

FDA Phase / /

IndustryTerm

unitary operator / polynomial-time quantum algorithm / linear operator / /

Organization

National Science Foundation / U.S. Securities and Exchange Commission / /

Person

Michael A. Forbes Licensed / Michael A. Forbes / Bell Bell / Alessandro Chiesa / /

Product

Chen / Blier / /

Technology

prover LOCC-protocol / WAP / RAM / polynomial-time quantum algorithm / two-prover QMA protocol / non-LOCC protocol / LOCC protocol / finite state machine / QMA protocol / two-prover LOCC QMA protocol / QMA protocols / multi-prover QMA protocols / two-prover protocols / two-prover protocol / prover QMA protocol / LOCC QMA protocols / constant-prover LOCC QMA protocol / /

URL

http /

SocialTag