CSS codes from the Bruhat order of Coxeter groups
Kamil Bradler

TL;DR
This paper introduces a novel method to generate CSS quantum error-correcting codes from Coxeter groups using the Bruhat order, resulting in codes with controlled and diverse stabilizer weights, including irregular distributions.
Contribution
It develops a new approach to construct CSS codes from Coxeter group structures and Bruhat order, enabling control over stabilizer weights and code parameters.
Findings
Generated CSS codes with stabilizer weights up to 14 and 16.
Created codes with irregular stabilizer weight distributions.
Developed a weight-reduction method for heavy stabilizers.
Abstract
I introduce a method to generate families of CSS codes with interesting code parameters. The object of study is Coxeter groups, both finite and infinite (reducible or not), and a geometrically motivated partial order of Coxeter group elements named after Bruhat. The Bruhat order is known to provide a link to algebraic topology -- it doubles as a face poset capturing the inclusion relations of the -dimensional cells of a regular CW~complex and that is what makes it interesting for QEC code design. Assisted by the Bruhat face poset interval structure unique to Coxeter groups I show that the corresponding chain complexes can be turned into multitudes of CSS codes. Depending on the approach, I obtain CSS codes (and their families) with controlled stabilizer weights, for example (stabilizer weights~14 and 9) and …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cellular Automata and Applications · Advanced Combinatorial Mathematics
