Lifted surgery for non-Abelian two-block group-algebra codes

Abstract:Code surgery measures a logical operator of a quantum LDPC code with $O(d)$ rounds of syndrome extraction. Lifted surgery amortises this cost on Abelian group-algebra codes by measuring an orbit of logical operators under a translation symmetry in one merged code. We extend it to two-block group-algebra codes over non-Abelian groups and ask whether non-commutativity lets one merged code measure more operators than any Abelian group of its symmetries. We classify the block-affine automorphisms of these codes and find that, measured against this full group, most apparent non-Abelian gains disappear. We prove that the gain is at most the index of a largest Abelian subgroup. We find codes with exact distance up to $13$ where the gain is two, including codes in which one merged code reads out every logical qubit, and codes over products of $A_4$, $S_4$ and SL(2,3) with gain three for a best logical, up to $[[336,26,12]]$. A merged-distance lemma gives a simple condition for the gadget to preserve the code distance. In circuit-level simulations with Relay-BP decoding, at the error rates we can resolve, the non-Abelian gadget is as reliable as, or more reliable than, the Abelian gadgets it replaces within statistical error, while using two to three times fewer rounds.

arXiv:2610.05307 [quant-ph]

(or arXiv:2610.05307v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.05307 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.