论文标题
与信任中心的量子计算对量子计算的无相互作用的信息信息
Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center
论文作者
论文摘要
后验证方案[J. F. Fitzsimons, M. Hajdu{\v s}ek, and T. Morimae, Physical Review Letters {\bf120}, 040501 (2018)] enables an information-theoretically-sound non-interactive verification of quantum computing, but the message from the prover to the verifier is quantum and the verifier has to do single-qubit measurements. Mahadev协议删除了这些量子零件，但声音变为计算零件。在本文中，我们构建了一种通过信任中心进行量子计算的理论上信息的非交互式经典验证协议。受信任的中心将随机的BB84状态发送给供奉献者，将这些BB84状态的经典描述发送给验证者。从中心到供供者和验证者的消息独立于实例。通过稍微修改我们的协议，我们还与受信任中心构建了QMA的非相互作用统计零知识证明系统。
The posthoc verification protocol [J. F. Fitzsimons, M. Hajdu{\v s}ek, and T. Morimae, Physical Review Letters {\bf120}, 040501 (2018)] enables an information-theoretically-sound non-interactive verification of quantum computing, but the message from the prover to the verifier is quantum and the verifier has to do single-qubit measurements. The Mahadev protocol removes these quantum parts, but the soundness becomes the computational one. In this paper, we construct an information-theoretically-sound non-interactive classical verification protocol for quantum computing with a trusted center. The trusted center sends random BB84 states to the prover, and the classical descriptions of these BB84 states to the verifier. The messages from the center to the prover and the verifier are independent of the instance. By slightly modifying our protocol, we also construct a non-interactive statistical zero-knowledge proof system for QMA with the trusted center.
