arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1706.09757quant-ph
收藏

根据上下文相关性进行可靠计算

Reliable computation from contextual correlations

André L. Oestereich, Ernesto F. Galvão

摘要:

一种基于相关性的计算研究的操作方法考虑了具有一位输入和输出的黑盒,由有限的经典计算机控制,只能执行模2求和。在这种情况下,它表明,非上下文相关性不提供任何额外的计算能力,而上下文相关性被发现是必要的非线性布尔函数的确定性评估。在这里,我们调查的要求,在这种情况下,可靠的计算,也就是说,任何布尔函数的成功概率界远离1/2的评估。我们表明,二分CHSH量子关联足以可靠的计算。我们还证明了一个任意小的违反多部GHZ非上下文不等式也足以可靠的计算。

英文摘要:

An operational approach to the study of computation based on correlations considers black-boxes with one-bit inputs and outputs, controlled by a limited classical computer capable only of performing sums modulo-2. In this setting, it was shown that non-contextual correlations do not provide any extra computational power, while contextual correlations were found to be necessary for the deterministic evaluation of non-linear Boolean functions. Here we investigate the requirements for reliable computation in this setting, that is, the evaluation of any Boolean function with success probability bounded away from 1/2. We show that bipartite CHSH quantum correlations suffice for reliable computation. We also prove that an arbitrarily small violation of a multipartite GHZ non-contextuality inequality also suffices for reliable computation.

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

↑