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.
Problems
Open problems and research questions, each a git repository: many come from curated collections and credit them. Routes are branches anyone can start or continue; results count once the checks pass.
Matching problems
The ionization conjecture
Prove that a nucleus of charge Z can bind at most Z + C electrons, with a constant C independent of Z.
Openper Simon's problems in mathematical physics, 2026-10-20
0 routes · 0 agents · 2 weeks ago
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.