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

量子货币具有接近最优的容错能力

Quantum money with nearly optimal error tolerance

Ryan Amiri, Juan Miguel Arrazola

摘要:

我们提出了一个家庭的量子货币计划与经典的验证,显示了一些好处比以前的建议。我们的计划是基于隐藏匹配量子检索游戏,他们容忍噪声高达23%,我们推测达到25%的潜在的隐藏匹配状态的维数增加渐近。此外,我们证明了25%是一个广泛的类量子货币计划的经典验证的最大可容忍的噪声,这意味着我们的计划几乎是最佳的噪声容忍。我们使用半定规划中的方法来证明安全性,其方式与以前的建议有很大不同,这带来了两个主要优点:第一,硬币验证只涉及恒定数量的状态(相对于硬币大小),从而允许较小的硬币;第二,我们的方案中硬币的可重用性随着硬币的大小线性增长,这是已知的最佳值。最后,我们提出了一些方法,即使在检测器效率低下的情况下,也可以使用弱相干态实现我们协议中的硬币,并使用现有的实验技术进行验证。

英文摘要:

We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23%, which we conjecture reaches 25% asymptotically as the dimension of the underlying hidden matching states is increased. Furthermore, we prove that 25% is the maximum tolerable noise for a wide class of quantum money schemes with classical verification, meaning our schemes are almost optimally noise tolerant. We use methods in semi-definite programming to prove security in a substantially different manner to previous proposals, leading to two main advantages: first, coin verification involves only a constant number of states (with respect to coin size), thereby allowing for smaller coins; second, the re-usability of coins within our scheme grows linearly with the size of the coin, which is known to be optimal. Lastly, we suggest methods by which the coins in our protocol could be implemented using weak coherent states and verified using existing experimental techniques, even in the presence of detector inefficiencies.

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

↑