Classical Verification of Quantum Computations in Linear Time. (arXiv:2202.13997v3 [quant-ph] UPDATED)

Web: http://arxiv.org/abs/2202.13997

In the quantum computation verification problem, a quantum server wants to
convince a client that the output of evaluating a quantum circuit $C$ is some
result that it claims. This problem is considered very important both
theoretically and practically in quantum computation [arXiv:1709.06984],
[arXiv:1704.04487], [arXiv:1209.0449]. The client is considered to be limited
in computational power, and one desirable property is that the client can be
completely classical, which leads to the classical verification of …

quantum verification