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.

中文翻译：

---

具有可信中心的量子计算的信息理论上健全的非交互式经典验证

事后验证协议 [JF Fitzsimons, M. Hajdu{\vs}ek, and T. Morimae, Physical Review Letters {\bf120}, 040501 (2018)] 支持对量子计算进行信息理论上合理的非交互式验证，但是从证明者到验证者的信息是量子的，验证者必须进行单量子位测量。Mahadev 协议删除了这些量子部分，但稳健性变成了计算部分。在本文中，我们为具有可信中心的量子计算构建了一个信息理论上合理的非交互式经典验证协议。可信中心向证明者发送随机 BB84 状态，并将这些 BB84 状态的经典描述发送给验证者。从中心到证明者和验证者的消息与实例无关。通过稍微修改我们的协议，