Non-interactive classical verification of quantum computation
Non-interactive classical verification of quantum computation
复制标题
DOI:
10.1007/978-3-030-64381-2_6
复制
发表时间:
2019-11
期刊:
影响因子:
--
通讯作者:
G. Alagic;Andrew M. Childs;A. Grilo;S. Hung
中科院分区:
文献类型:
--
作者:
G. Alagic;Andrew M. Childs;A. Grilo;S. Hung
In a recent breakthrough, Mahadev constructed an interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. We show that this same task can in fact be performednon-interactively(with setup) and inzero-knowledge.Our protocols result from a sequence of significant improvements to the original four-message protocol of Mahadev. We begin by making the first message instance-independent and moving it to an offline setup phase. We then establish a parallel repetition theorem for the resulting three-message protocol, with an asymptotically optimal rate. This, in turn, enables an application of the Fiat-Shamir heuristic, eliminating the second message and giving a non-interactive protocol. Finally, we employ classical non-interactive zero-knowledge (NIZK) arguments and classical fully homomorphic encryption (FHE) to give a zero-knowledge variant of this construction. This yields the first purely classical NIZK argument system for, a quantum analogue of.We establish the security of our protocols under standard assumptions in quantum-secure cryptography. Specifically, our protocols are secure in the Quantum Random Oracle Model, under the assumption that Learning with Errors is quantumly hard. The NIZK construction also requires circuit-private FHE.