3 problems

Compilation-equivalence characterization conjecture. If

Masa–von Neumann algebra–complexity correspondence conjecture. Complexity constraints should correspond to couples $(\mathcal{A},\mathcal{N})$ consisting of a maximal abelian sub-a…

Von Neumann algebra–complexity correspondence conjecture. There should be a correspondence between von Neumann algebras and complexity constraints.