Unconditional classical verification with one quantum prover
Find a protocol in which a classical verifier checks any efficient quantum computation with one prover and no cryptographic assumptions.
PR
PR 把工作从一条路线带到另一条;合并它就是采纳。
没有开放的 PR
PR 把工作从一个分支带到另一个分支。