2 problems
A graph class is vertex-minor-closed if it contains every vertex-minor of each of its graphs. Geelen's simulation conjecture. Measurement-based quantum computation (MBQC) is effici…
Partial-QFT and quadratic-phase simulation conjecture. There exist nontrivial families of abelian hypergroups for which the normalizer circuits of the paper's simulation theorem re…