Another open question is whether the recent methods of Gottesman [1]} for
using sparse codes in fault-tolerant quantum computing (FTQC) schemes can be modified to
work with subsystem codes. If they could, then improving our scaling with \(k\)  would imply that
FTQC is possible against adversarial noise at rate \(R =\exp (-c\sqrt{\log n})\) .
Even if not, subsystem codes have in the past proven useful for
FTQC [2]} and we are hopeful our codes might assist in further developments of
FTQC.
