Establish a classification-free automorphism-group bound
Prove the upper bound on the logical automorphism group of stabilizer codes without invoking classification results for finite groups, with the aim of exposing the structural origin of the bound and enabling extensions to other code and gate models.
References
First, can the automorphism logical-group bound for stabilizer codes be proved without invoking classification results of finite groups?
Third, CSS structure makes the SSD and PSD classification natural; is there an analogous classification for general stabilizer codes, with correspondingly finer-grained logical-group bounds?
Going beyond our code construction, an open question is whether an asymptotic constant rate is compatible with a linear gate depth in the number of logical qubits to implement an arbitrary logical Clifford gate.