Bertlmann巧克力球与量子密码学
Bertlmann's chocolate balls and quantum type cryptography
摘要：
一些量子密码协议可以用特别准备的巧克力球来实现，而另一些受值不确定性保护的协议则不能。讨论了量子密码学和巧克力密码学的异同。基于这些考虑，提出了利用值的不确定性来证明量子随机数生成器和量子密码协议。这一特征，源自贝尔-斯派克和科琴-斯派克类型的论点，只存在于有三个或更多互斥结果的系统中。
英文摘要：
Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This feature, which derives itself from Bell- and Kochen-Specker type arguments, is only present in systems with three or more mutually exclusive outcomes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
