论文标题
反锻造量子数据：量子计算功率的加密验证
Anti-Forging Quantum Data: Cryptographic Verification of Quantum Computational Power
论文作者
论文摘要
量子云计算正在成为一种流行的模型，使用户可以通过Internet体验量子计算的力量，从而使量子计算成为服务。问题是，当计算问题的规模无法触及古典计算机时，用户如何确定服务器发送的输出字符串实际上来自量子硬件？在2008年，Shepherd and Bremner提出了一种基于简化电路模型IQP（瞬时量子多项式时间）的加密验证协议，该模型可以可能应用于大多数现有的量子云平台。但是，Kahanamoku-Meyer最近证明了Shepherd-Bremner方案是不安全的。在这里，我们提出了一个基于IQP的加密验证协议的扩展模型，其中牧羊人 - 布雷姆纳构建可以视为一种特殊情况。该协议不仅可以避免Kahanamoku-Meyer的攻击，而且还为反填充量子数据提供了一些其他安全措施。特别是，我们的协议同时承认了多个秘密字符串的编码，从而显着加强了经典黑客的硬度。此外，我们提供了估计与秘密字符串相关的相关函数的方法，这是我们验证协议中的关键要素。
Quantum cloud computing is emerging as a popular model for users to experience the power of quantum computing through the internet, enabling quantum computing as a service. The question is, when the scale of the computational problems becomes out of reach of classical computers, how can users be sure that the output strings sent by the server are really from a quantum hardware? In 2008, Shepherd and Bremner proposed a cryptographic verification protocol based on a simplified circuit model called IQP (instantaneous quantum polynomial-time), which can potentially be applied to most existing quantum cloud platforms. However, the Shepherd-Bremner protocol has recently been shown to be insecure by Kahanamoku-Meyer. Here we present an extended model of IQP-based cryptographic verification protocol, where the Shepherd-Bremner construction can be regarded as a special case. This protocol not only can avoid the attack by Kahanamoku-Meyer but also provide several additional security measures for anti-forging quantum data. In particular, our protocol admits a simultaneous encoding of multiple secret strings, strengthening significantly the hardness for classical hacking. Furthermore, we provide methods for estimating the correlation functions associated with the secret strings, which are the key elements in our verification protocol.
