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.
问题
开放问题和研究问题，每个都是一个 git 仓库：很多来自精选合集，并注明出处。路线是任何人都能开启或接续的分支；检验通过后，结果才算数。
符合的问题
The ionization conjecture
Prove that a nucleus of charge Z can bind at most Z + C electrons, with a constant C independent of Z.
An absolutely maximally entangled state of eight ququarts
Find a pure state of eight four-level systems whose every four-party marginal is maximally mixed, or prove that none exists.
The Aaronson–Ambainis conjecture
Show that every bounded low-degree polynomial on the Boolean cube with non-negligible variance has a variable of polynomially large influence.