Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices

• URL: http://arxiv.org/abs/2605.03631v2
• Date: Tue, 12 May 2026 08:51:44 GMT
• Title: Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
• Abstract summary: This paper introduces two constructions of high-rate, quantum dual-containing (DC) Calderbank-Shor-Steane (CSS) low-density parity-check (LDPC) codes.<n>Their DC structure enables the implementation of the Hadamard gate, and, jointly with the sparsity of their parity-check matrices, enable low-complexity decoding.<n>We show that the quantum CSS LDPC codes obtained through these constructions achieve better finite-length error rate performance than existing DC codes across different block lengths and code rates.
• Score: 12.47911764690163
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Building scalable quantum computers requires quantum error-correcting codes that enable reliable operations in the presence of noise. Motivated by such need, this paper introduces two constructions of high-rate, quantum dual-containing (DC) Calderbank-Shor-Steane (CSS) low-density parity-check (LDPC) codes based on quasi-dyadic matrices. Their DC structure enables the transversal implementation of the Hadamard gate, and, jointly with the sparsity of their parity-check matrices enable low-complexity decoding via a standard binary belief-propagation algorithm. We provide several theoretical results concerning the cycle properties of these CSS codes. We also investigate their automorphism groups as well as their minimum distance. Furthermore, through numerical simulations, we show that the quantum CSS LDPC codes obtained through these constructions achieve better finite-length error rate performance than existing DC codes across different block lengths and code rates.

Related papers

• LDGM-Based Quantum Codes for Fault-Tolerant Quantum Computation [0.0]
  We construct a new family of Calderbank-Shor-Steane (CSS) codes using the generator and parity-check matrices of Low-Density Generator Matrix (LDGM) codes.<n>Decoding is performed in an iterative manner, by applying message passing over the associated graph, and discrete Density Evolution (DDE) is used to optimize performance in the depolarizing channel.
  arXiv  Detail & Related papers  (2026-07-16T16:02:16Z)
• Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search [6.754749859345508]
  Entment-assisted (EA) quantum QC-LDPC codes offer strong error-correction capabilities with structured parity-check matrices.<n>Their practical use depends on efficient encoder circuits and the availability of pre-shared Bell pairs (ebits)
  arXiv  Detail & Related papers  (2026-06-09T21:57:07Z)
• Self-dual Stacked Quantum Low-Density Parity-Check Codes [9.268855474673822]
  We introduce a method for constructing self-dual qLDPC codes by stacking non-self-dual qLDPC codes.<n>We conduct numerical calculations to assess the performance of these codes as quantum memory under the circuit-level noise model.
  arXiv  Detail & Related papers  (2026-02-17T05:55:48Z)
• Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding [6.0631162216423435]
  Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity.<n>We propose an algebraic construction based on dyadic matrices for designing both classical and quantum LDPC codes.
  arXiv  Detail & Related papers  (2026-01-13T15:11:41Z)
• Directional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware [0.0]
  Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise.<n>Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and feasible scalability.<n>We construct a new family of qLDPC codes, which outperforms the rotated planar code (RPC)<n>We numerically evaluate the performance of directional codes, encoding four, six and twelve logical qubits.
  arXiv  Detail & Related papers  (2025-07-25T16:57:21Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• 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)
• Decoding Quantum LDPC Codes Using Graph Neural Networks [52.19575718707659]
  We propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs) The proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm.
  arXiv  Detail & Related papers  (2024-08-09T16:47:49Z)
• Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices [45.997444794696676]
  Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers.<n>One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder.<n>We first propose to decode QLDPC codes with a belief propagation (BP) decoder operating on overcomplete check matrices.<n>We extend the neural BP (NBP) decoder, which was originally studied for suboptimal binary BP decoding of QLPDC codes, to quaternary BP decoders.
  arXiv  Detail & Related papers  (2023-08-16T08:24:06Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• 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)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)

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.