Characterization of all quadratic Bell constraints
Prove or refute the conjecture that every quadratic Bell constraint reduces, up to affine transformations, to stabilizer constraints and subsystem-purity constraints.
References
We conjecture that all quadratic Bell constraints necessarily reduce to stabilizer and subsystem purities (up to affine transformations). Proving this, would both simplify the analysis developed here, and clarify the intrinsic information content of the Bell distribution. Conversely, finding genuinely different families of symmetries, would then point to new classes of structured states admitting similar efficient learning algorithms.
— Efficient learning of Clifford disentanglers and typical $t$-doped unitaries with exponentially more $T$ gates
(2609.27565 - Aguilar et al., 23 Sep 2026) in Discussion and future work, paragraph “Open questions”