Calderbank-Shor-Steane codes on group-valued qudits
Ben T. McDonough, Jian-Hao Zhang, Victor V. Albert, Andrew Lucas

TL;DR
This paper introduces a new class of quantum error-correcting codes on group-valued qudits, generalizing CSS codes and Kitaev quantum doubles, with applications to non-Abelian groups and topological states.
Contribution
It extends CSS codes to group-valued qudits, generalizes quantum double models to CW complexes, and explores non-Abelian codes with optimal parameters and boundary conditions.
Findings
Codes on non-Abelian simple groups have provable distance bounds.
Constructed non-Abelian codes with asymptotically optimal rate and distance.
Generalized quantum double models with defects and boundary conditions.
Abstract
Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting - and -type checks. We introduce CSS-like codes on -valued qudits for any finite group that reduce to qubit CSS codes for yet generalize the Kitaev quantum double model for general groups. The -checks of our group-CSS codes correspond to left and/or right multiplication by group elements, while -checks project onto solutions to group word equations. We describe quantum-double models on oriented two-dimensional CW complexes (which need not cellulate a manifold) and prove that, when is non-Abelian and simple, every -covariant group-CSS code with suitably upper-bounded -check weight and lower-bounded -distance reduces to a CW quantum double. We describe the codespace and logical operators of CW quantum doubles via the same intuition…
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
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Quantum Information and Cryptography
