We introduce multivariate multicycle (MM) codes, a Koszul-complex formulation of abelian multicycle (AMC) codes, which are multidimensional scalar lifted-product codes over a finite abelian group algebra, that unifies bivariate bicycle, multivariate bicycle, abelian two-block group algebra, generalized bicycle, trivariate tricycle, and toric codes. MM codes are Calderbank-Shor-Steane (CSS) codes defined from length-$(t+1)$ chain complexes, and for $t\geq4$ they possess metachecks for both types of checks, which can be used for single-shot decoding. We offer a framework that facilitates the construction of long-length chain complexes through the use of the Koszul complex. In particular, obtaining explicit boundary maps (parity check and metacheck matrices) is particularly straightforward in our approach. We also determine when an MM code encodes logical qubits, count the independent check relations not generated by its metachecks, and show that middle-degree codes with even $t$ have equal $X$ and $Z$ distances. This simple but very general parameterization of codes permitted us to efficiently perform a numerical search, where we identify several MM code candidates with high rates and high code distances. Examples of new codes with parameters $[[n,k,d]]$ include $[[96,12,8]]$, $[[144,12,12]]$, $[[486,24,12]]$, $[[630,70,9]]$, and $[[648,60,9]]$. For selected codes, we report confinement profiles and study single-shot and few-shot decoding under phenomenological and circuit-level noise. Our codes also include explicit collapsed 5D through 9D instances, and our 5D instances have check weights lower than those of recent small instances of quantum Tanner codes.
翻译:暂无翻译