Multivariate Multicycle Codes for Complete Single-Shot Decoding

• URL: http://arxiv.org/abs/2601.18879v1
• Date: Mon, 26 Jan 2026 19:00:03 GMT
• Title: Multivariate Multicycle Codes for Complete Single-Shot Decoding
• Authors: Feroz Ahmed Mian, Owen Gwilliam, Stefan Krastanov,
• Abstract summary: We introduce a new family of quantum error correcting codes.<n>MM codes possess metachecks and high confinement.<n>Our codes surpass all known single-shot decodable quantum CSS codes of practical blocksize.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce multivariate multicycle (MM) codes, a new family of quantum error correcting codes that unifies and generalizes bivariate bicycle codes, multivariate bicycle codes, abelian two-block group algebra codes, generalized bicycle codes, trivariate tricycle codes, and n-dimensional toric codes. MM codes are Calderbank-Shor-Steane (CSS) codes defined from length-t chain complexes with $t \ge 4$. The chief advantage of these codes is that they possess metachecks and high confinement that permit complete single-shot decoding, while also having additional algebraic structure that might enable logical non-Clifford gates. We offer a framework that facilitates the construction of long-length chain complexes through the use of Koszul complex. In particular, obtaining explicit boundary maps (parity check and metacheck matrices) is particularly straightforward in our approach. This simple but very general parameterization of codes permitted us to efficiently perform a numerical search, where we identify several MM code candidates that demonstrate these capabilities at high rates and high code distances. Examples of new codes with parameters $[[n,k,d]]$ include $[[96, 12, 8]]$, $[[96, 44, 4]]$ $[[144, 40, 4]]$, $[[216, 12, 12]]$, $[[360, 30, 6]]$, $[[384, 80, 4]]$, $[[486, 24, 12]]$, $[[486, 66, 9]]$ and $[[648, 60, 9]]$. Notably, our codes achieve confinement profiles that surpass all known single-shot decodable quantum CSS codes of practical blocksize.

Related papers

• Quantum error correction beyond $SU(2)$: spin, bosonic, and permutation-invariant codes from convex geometry [48.254879700836376]
  We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces.<n>We prove that many codes and their gates in $SU(q)$ can be inter-converted between the three state spaces.<n>We present explicit constructions of codes with shorter length or lower total spin/excitation than known codes with similar parameters.
  arXiv  Detail & Related papers  (2025-09-24T20:21:30Z)
• Optimal Quantum $(r,δ)$-Locally Repairable Codes From Matrix-Product Codes [52.3857155901121]
  We study optimal quantum $(r,delta)$-LRCs from matrix-product (MP) codes.<n>We present five infinite families of optimal quantum $(r,delta)$-LRCs with flexible parameters.
  arXiv  Detail & Related papers  (2025-08-05T16:05:14Z)
• Generalized toric codes on twisted tori for quantum error correction [9.623534315687825]
  Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation.<n>Direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads.<n>We introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions.
  arXiv  Detail & Related papers  (2025-03-05T19:00:05Z)
• Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $mathbbZm$ with an arbitrary finite Coxeter group.<n> Coxeter codes also give rise to a family of quantum codes for which closed diagonal $Z$ rotations can perform non-trivial logic.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• Asymptotically good CSS-T codes and a new construction of triorthogonal codes [0.0]
  We propose a new systematic construction of CSS-T codes from any given CSS code using a map $phi$.<n>We prove the existence ofally good binary CSS-T codes, and ofally good quantum LDPC CSS-T codes.<n>An immediate application of these codes in dealing with coherent noise is discussed.
  arXiv  Detail & Related papers  (2024-12-11T18:03:58Z)
• Expanding self-orthogonal codes over a ring $\Z_4$ to self-dual codes and unimodular lattices [15.449427879628143]
  We show that all self-dual codes over $Z_4$ of lengths $4$ to $8$ can be constructed this way. We have found five new self-dual codes over $Z_4$ of lengths $27, 28, 29, 33,$ and $34$ with the highest Euclidean weight $12$.
  arXiv  Detail & Related papers  (2024-08-31T09:38:42Z)
• Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates [23.22566380210149]
  We construct quantum codes that support $CCZ$ gates over qudits of arbitrary prime power dimension $q$. The only previously known construction with such linear dimension and distance required a growing alphabet size $q$.
  arXiv  Detail & Related papers  (2024-08-17T16:54:51Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• Classification of Small Triorthogonal Codes [0.30458514384586394]
  Triorthogonal codes are a class of quantum error correcting codes used in magic state distillation protocols. We classify all triorthogonal codes with $n+kle 38$, where $n$ is the number of physical qubits and $k is the number of qubits of the code. In an appendix independent of the main text, we improve a magic state distillation protocol by reducing the time variance due to Clifford corrections.
  arXiv  Detail & Related papers  (2021-07-20T18:00:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.