Anybody familiar with linear algebra over rings? I want to find the null space of a matrix whose entries are elements of a (finite) group algebra (over a finite field).
Help?
Figured it out: it's the transversal SUM gate.
Qubit CSS codes can be characterized by (a) stabilizers that are purely X or Z type, or equivalently (b) a transversal CNOT gate.
What's the equivalent of condition (b) for quDit CSS codes?
Reminder to self, yet again: the surface code has no threshold with BP-OSD. This can be the source of much confusion when testing or debugging code.
The real lift-off moment will be when major journals start accepting the typst.app format. Until then, sunsetting latex is only a sweet fantasy...
arxiv.org/abs/2409.18175 has a really neat way to identify transversal gates of a QEC code, which I was inspired to add to github.com/Infleqtion/qLDPC
What other useful tools/methods for QEC and FTQC should I add to qLDPC?
