Qudit Twisted-Torus Codes in the Bivariate Bicycle Framework

• URL: http://arxiv.org/abs/2602.04443v1
• Date: Wed, 04 Feb 2026 11:15:51 GMT
• Title: Qudit Twisted-Torus Codes in the Bivariate Bicycle Framework
• Abstract summary: We study finite-length qudit quantum low-density parity-check (LDPC) codes from translation-invariant CSS constructions on two-dimensional tori with twisted boundary conditions.<n>For the finite sizes explored, twisted-torus qudit constructions typically achieve larger distances than their untwisted counterparts.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study finite-length qudit quantum low-density parity-check (LDPC) codes from translation-invariant CSS constructions on two-dimensional tori with twisted boundary conditions. Recent qubit work [PRX Quantum 6, 020357 (2025)] showed that, within the bivariate-bicycle viewpoint, twisting generalized toric patterns can significantly improve finite-size performance as measured by $k d^{2}/n$. Here $n$ denotes the number of physical qudits, $k$ the number of logical qudits, and $d$ the code distance. Building on this insight, we extend the search to qudit codes over finite fields. Using algebraic methods, we compute the number of logical qudits and identify compact codes with favorable rate--distance tradeoffs. Overall, for the finite sizes explored, twisted-torus qudit constructions typically achieve larger distances than their untwisted counterparts and outperform previously reported twisted qubit instances. The best new codes are tabulated.

Related papers

• Comments on the recent improvements of the MRRW bounds [59.04174294928297]
  We present the OpenAI proof in the language and context of coding theory, as an extension of the spectral method in which the single vector attached to a codeword is replaced by a subspace.<n>We also present the OpenAI proof in the language and context of coding theory, as an extension of the spectral method in which the single vector attached to a codeword is replaced by a subspace.
  arXiv  Detail & Related papers  (2026-09-01T20:43:23Z)
• Multi-agent discovery of practical quantum LDPC codes [2.763808510474517]
  Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks.<n>Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes.
  arXiv  Detail & Related papers  (2026-08-10T01:32:34Z)
• Logical computation with canonical lifted product codes [3.653555716265332]
  Code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes.<n>Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of emphcanonical lifted-product (LP) codes.<n>We show that these codes admit a emphcanonical logical basis, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes.
  arXiv  Detail & Related papers  (2026-07-30T17:55:34Z)
• A polynomial-time approximation scheme for minimum-weight decoding of topological codes [42.44256445495892]
  Two-dimensional topological translationally in (2D TTI) stabilizer codes lie at the heart of fault-tolerant quantum computation.<n>Minimum-weight decoding of these codes was recently shown to be NP-hard, even in basic settings.
  arXiv  Detail & Related papers  (2026-06-16T16:44:08Z)
• Single-Shot and Few-Shot Decoding via Stabilizer Redundancy in Bivariate Bicycle Codes [5.685589351789461]
  We prove that $g(z)$ dictates the code's stabilizer redundancy and the structure of the classical emphsyndrome codes required for single-shot decoding.<n>Within the coprime BB ansatz, high quantum rate imposes an upper bound on syndrome distance, limiting single-shot performance.
  arXiv  Detail & Related papers  (2026-01-03T09:49:58Z)
• Poincaré Duality and Multiplicative Structures on Quantum Codes [11.11194917284133]
  We build circuits composed of $mathrmCmathrmCZ$ gates as well as for higher order controlled-$Z$ gates.<n>We conjecture that they generate nontrivial logical actions, pointing towards fault-tolerant non-Clifford gates on nearly optimal qLDPC sheaf codes.
  arXiv  Detail & Related papers  (2025-12-26T08:38:08Z)
• 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)
• 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)
• Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions [1.6385815610837167]
  Quantum low-density parity-check codes are promising candidates for quantum error correcting codes.<n>We introduce the concept of pruning quantum codes.<n>We investigate fault-tolerant quantum computation using the constructed pruned codes by describing fold-transversal gates.
  arXiv  Detail & Related papers  (2024-12-05T14:20:44Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• 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)
• High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory [0.6144680854063939]
  We present a new family of quantum low-density parity-check codes, which we call radial codes. In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance. Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
  arXiv  Detail & Related papers  (2024-06-20T16:08:06Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Pseudonorm Approachability and Applications to Regret Minimization [73.54127663296906]
  We convert high-dimensional $ell_infty$-approachability problems to low-dimensional pseudonorm approachability problems. We develop an algorithmic theory of pseudonorm approachability, analogous to previous work on approachability for $ell$ and other norms.
  arXiv  Detail & Related papers  (2023-02-03T03:19:14Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

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.