arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.09012quant-ph
收藏

Spekkens玩具模型中的量子协议

Quantum Protocols within Spekkens' Toy Model

Leonardo Disilvestro, Damian Markham

摘要:

与经典模型相比,量子力学在信息处理任务中提供了显著的改进。这些优势包括从计算速度到安全性的提高。关键问题是这些优势从何而来。由Spekkens [R. W. Spekkens PRA 75,032110(2012)]模拟了量子力学的许多特征,例如纠缠和非克隆,尽管是局部隐藏变量理论,但在这方面被认为是重要的。在这项工作中,我们研究了Spekkens的玩具模型中的几个协议,我们看到它也可以模仿量子情况下显示的优点和局限性。我们首先提供明确的证明玩具比特承诺的不可能性和存在的玩具纠错协议和随之而来的$k-$阈值秘密共享。然后,定义了一个基于量子单向计算机的玩具计算模型,证明了盲协议和验证协议的存在性。重要的是,众所周知,这最后两个量子协议可以实现比经典更好的安全性。我们的研究结果表明,这种量子改进不需要产生任何贝尔型非局域性或上下文,而是作为一个结果的指导相关性。

英文摘要:

Quantum mechanics is known to provide significant improvements in information processing tasks when compared to classical models. These advantages range from computational speeds-up to security improvements. A key question is where these advantages come from. The toy model developed by Spekkens [R. W. Spekkens PRA 75, 032110 (2012)] mimics many of the features of quantum mechanics, such as entanglement and no-cloning, regarded as being important in this regard, despite being a local hidden variable theory. In this work we study several protocols within Spekkens' toy model where we see it can also mimic the advantages and limitations shown in the quantum case. We first provide explicit proofs for the impossibility of toy bit-commitment and the existence of a toy error correction protocol and consequent $k-$threshold secret sharing. Then, defining a toy computational model based on the quantum one-way computer we prove the existence of blind and verified protocols. Importantly, these two last quantum protocols are known to achieve a better-than-classical security. Our results suggest that such quantum improvements need not arise from any Bell-type non locality or contextuality, but rather as a consequence of steering correlations.

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

↑