2000 character limit reached
On QMA Protocols with Two Short Quantum Proofs (1108.4306v2)
Published 22 Aug 2011 in quant-ph and cs.CC
Abstract: This paper gives a QMA (Quantum Merlin-Arthur) protocol for 3-SAT with two logarithmic-size quantum proofs (that are not entangled with each other) such that the gap between the completeness and the soundness is Omega(1/n polylog(n)). This improves the best completeness/soundness gaps known for NP-complete problems in this setting.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.