arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.1655cs.CCcs.FLquant-ph
收藏

与小型透明量子验证器的争论

Debates with small transparent quantum verifiers

Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci

摘要:

我们研究了一个模型,其中两个对立的证明者争论一种语言中给定字符串的成员身份,试图说服一个弱验证者,其硬币对所有人都是可见的。我们表明,仅两个量子位,否则经典的恒定空间验证器的合并提出了有争议的语言类从最多$\mathsf{NP}$的所有图灵判定语言(递归语言)的集合。当验证者进一步被约束为以概率1做出正确的决定时,相应的类从正则语言上升到至少$\mathsf{E}$。我们还表明,量子模型优于其经典的对应时,限制在多项式时间运行,并证明了一些非上下文无关的语言,有这样的短辩论与量子验证。

英文摘要:

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of debatable languages from at most $\mathsf{NP}$ to the collection of all Turing-decidable languages (recursive languages). When the verifier is further constrained to make the correct decision with probability 1, the corresponding class goes up from the regular languages up to at least $\mathsf{E}$. We also show that the quantum model outperforms its classical counterpart when restricted to run in polynomial time, and demonstrate some non-context-free languages which have such short debates with quantum verifiers.

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

↑