arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.2098quant-phcs.CC
收藏

使用多个校准器改进QMA的可靠性

Improved Soundness for QMA with Multiple Provers

Alessandro Chiesa, Michael A. Forbes

摘要:

我们提出了三个贡献的理解QMA与多个证明:1)我们给出了严格的可靠性分析的协议[Blier和Tapp,ICQNM '09],产生可靠性差距Ω(1/N^2)。我们的改进是在不使用具有恒定可靠性间隙的实例的情况下实现的(即,不使用PCP)。2)我们给出了[Chen和Drucker,ArXiV '10]的协议的严格可靠性分析,从而将他们的结果从需要Theta(sqrt(N))证明器以便具有任何可靠性间隙的单片协议改进为具有证明器数量k和可靠性间隙Omega(k^2/N)之间的平滑权衡的协议,只要k>=Omega(log N)。(And当k=Theta(sqrt(N))时,我们恢复了Chen和Drucker的原始参数。3)我们朝着[Aaronson等人,ToC '09]关于什么样的NP完全问题适合于次线性多证明器QMA协议,通过观察可以很容易地从PCP文献中已经存在的结果中导出一大类这样的例子-即,至少是在准线性时间内由非确定性RAM识别的语言。

英文摘要:

We present three contributions to the understanding of QMA with multiple provers: 1) We give a tight soundness analysis of the protocol of [Blier and Tapp, ICQNM '09], yielding a soundness gap Omega(1/N^2). Our improvement is achieved without the use of an instance with a constant soundness gap (i.e., without using a PCP). 2) We give a tight soundness analysis of the protocol of [Chen and Drucker, ArXiV '10], thereby improving their result from a monolithic protocol where Theta(sqrt(N)) provers are needed in order to have any soundness gap, to a protocol with a smooth trade-off between the number of provers k and a soundness gap Omega(k^2/N), as long as k>=Omega(log N). (And, when k=Theta(sqrt(N)), we recover the original parameters of Chen and Drucker.) 3) We make progress towards an open question of [Aaronson et al., ToC '09] about what kinds of NP-complete problems are amenable to sublinear multiple-prover QMA protocols, by observing that a large class of such examples can easily be derived from results already in the PCP literature - namely, at least the languages recognized by a non-deterministic RAMs in quasilinear time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑