Non-interactive classical verification of quantum computation

Understand

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.

• In this work, we show that this same task can in fact be performed non-interactively and in zero-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.