Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.01305

Lifted-Product QLDPC Codes in the Polynomial Domain

Vahid Nourozi, Mohsen Moradi, Roxana Smarandache, David G. M. Mitchell

Published Sep 1, 2026• 2 citations
arXivHTMLPDF

Abstract

This paper presents a finite-length polynomial-domain formulation of lifted-product quantum low-density parity-check (QLDPC) codes. We formulate the code construction over the quotient ring F 2[D]/(D L + 1), where polynomial base matrices are lifted entrywise to binary circulant blocks. This representation gives a compact algebraic description of the lifted-product parity-check matrices and allows CSS orthogonality to be analyzed before binary expansion. We show that the standard circulant lifting map is compatible with polynomial conjugation, which implies that the resulting binary matrices satisfy the CSS commutation constraint. The construction is illustrated with a constraint length 7, rate 1/2 NASA convolutional code example, and numerical examples are provided from a 3 x 4 polynomial parity-check matrix. The finite-length performance of selected constructed codes is then evaluated over the depolarizing channel using various benchmark decoders. The resulting framework gives a structured method to construct finite-length lifted-product QLDPC codes from small polynomial base matrices.

DOI
10.48550/arxiv.2609.01305

Related papers

On the Minimum Distances of Finite-Length Lifted Product Quantum LDPC Codes

Nithin Raveendran, David Declercq, Bane V. Vasic

Quantum error correction (QEC) is critical for the practical realization of fault-tolerant quantum computing and quantum communication systems. Recently proposed families of quantum low-density parity-check (QLDPC) codes are prime candidates for advanced QEC hardware architectures. This paper focuses on finite-length QLDPC code design criteria, specifically aimed at constructing degenerate quasi-cyclic symmetric lifted-product (LP-QLDPC) codes with high minimum distances. We describe necessary conditions to ensure that the designed LP-QLDPC codes have a minimum distance strictly greater than the minimum weight stabilizer generators, thus ensuring superior error correction performance. The focus of the paper is on LP-QLDPC codes built from quasi-cyclic base codes belonging to the class of type-1 protographs, and the necessary constraints are efficiently expressed in terms of row and column indices of the base parity check matrix. This gives us combinatorial constraints - termed as Row-Column Partition Constraints (RCPC) - on classical quasi-cyclic base matrices to construct degenerate LP-QLDPC codes. For type-1 protographs, RCPC constraints provide an efficient certification approach to designing good codes, and we also give exhaustive search evidence on small base matrices. Simulations with BP+OSD decoding demonstrate significant logical error-rate gains when RCPC is avoided. We discuss extensions to circuit-level noise and outline sufficient conditions and research directions for exact distance preservation.

International Conference on Communications•May 24, 2026•1 citation

Quasi-Cyclic Qudit Lifted Product Codes with Almost Linear Minimum Distance

Shantom Kumar Borah, Abhinav Vaishya, V. Lalitha +3 more

Quantum low-density parity-check (QLDPC) codes are a promising route to fault-tolerant quantum computation with low overhead, and qudits offer advantages over qubits including more efficient information representation, improved magic state distillation, and richer algebraic structure for code design. Asymptotically good QLDPC codes arise from the lifted product (LP) construction with non-abelian lifts, but cyclic lifts remain attractive in practice because the resulting quasi-cyclic codes have circulant structure that hardware decoders exploit, which matters especially for non-binary decoders with costly check node operations. We introduce a qudit generalization of the LP construction over cyclic group algebras, which extends hypergraph product and LP codes to arbitrary prime-power dimensions and yields quasi-cyclic qudit CSS codes for every stacking order. We bound encoding rates via a connection to additive codes, and show that in the fully stacked case, qudit LP codes built from lifted Tanner codes on expander graphs form families with $Θ(\log N)$ logical qudits and almost linear minimum distance $Θ(N/\log N)$, via a distance bound that holds for a general class of LP factors. We also study an additive decoder for general qudit codes and a linear merged-syndrome decoder for fully stacked codes. Monte Carlo simulations under a depolarizing channel with equal symbol error probability show that qudit codes achieve lower frame error rates than comparable qubit codes, and that the linear decoder gives further gains for fully stacked codes.

arXiv:2611.15952•Nov 11, 2026•0 citations

Quantum Low‐density Parity Check Codes

Zunaira Babar, Daryus Chandra, Soon Xin Ng +1 more

The design of quantum low-density parity check (QLDPC) codes is discussed, with a special emphasis on their structural properties and iterative decoding techniques. We review diverse QLDPC code construction methods, including Calderbank–Shor–Steane (CSS), non-CSS, and entanglement-assisted variants. The chapter highlights the associated key design challenges, such as the presence of unavoidable length-4 cycles and their impact on decoding performance. Furthermore, a formalism is conceived for constructing high-rate row-circulant QLDPC codes from classical LDPC matrices. Additionally, an attractive nonbinary decoding algorithm is proposed for homogeneous CSS-type QLDPC codes to mitigate the effects of short cycles. The chapter also details a weighted belief propagation algorithm, which is a heuristic method of improving decoding over graphs exhibiting cycles. The limitations of the existing QLDPC designs in approaching the quantum Hashing bound are discussed, and the need for degenerate decoding strategies is emphasized.

Wiley eBooks•Dec 18, 2025•1 citation

Graphical Analysis of Lifted Product Code Constructions

Ragnar Freij-Hollanti, Kirsten D. Morris, Patricija Šapokaitė

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.

arXiv:2606.11987•Jun 10, 2026•0 citations

Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding

Alessio Baldelli, Massimo Battaglioni, Jonathan Mandelbaum +2 more

Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In this paper, we propose an algebraic construction based on dyadic matrices for designing both classical and quantum LDPC codes. The method first generates classical binary quasi-dyadic LDPC codes whose Tanner graphs have girth 6. It is then extended to the Calderbank-Shor-Steane (CSS) framework, where the two component parity-check matrices are built to satisfy the compatibility condition required by the recently introduced CAMEL-ensemble quaternary belief propagation decoder. This compatibility condition ensures that all unavoidable cycles of length 4 are assembled in a single variable node, allowing the mitigation of their detrimental effects by decimating that variable node.

cs.ITCross-listedarXiv:2601.08636•IEEE International Symposium on Information Theory (ISIT)•Jan 14, 2026•0 citations

Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes

Anthony Gómez-Fonseca, Gretchen L. Matthews, Kirsten D. Morris +1 more

Quantum low-density parity-check (QLDPC) codes offer a promising route to scalable fault-tolerant quantum computation, but their performance under iterative decoding is strongly influenced by short-cycle structure and other harmful subgraphs in the associated Tanner graphs. This paper develops an algebraic framework for constructing and analyzing (Q)LDPC codes from dyadic and quasi-dyadic matrices-translation-invariant $2^\ell \times 2^\ell$ binary matrices specified compactly by a signature row and forming a commutative ring with recursive block structure. Leveraging this structure, we relate cycles in lifted Tanner graphs to tailless backtrackless closed walks in the protograph and derive efficient, implementable methods to enumerate and control short cycles (notably $4$-, $6$-, and $8$-cycles). We introduce dyadic-aware PEG-style construction algorithms that use forbidden sets of shifts to maximize attainable girth when possible and otherwise minimize the multiplicity of the shortest cycles at the target girth. Motivated by error-floor phenomena, we further characterize and explicitly enumerate absorbing sets in key dyadic layout boundary cases, identifying configurations that induce abundant $(a,0)$-absorbing sets. Finally, we propose CSS-oriented dyadic constructions that satisfy commutation constraints by design and demonstrate via belief-propagation simulations that reducing short-cycle multiplicity can yield substantial decoding gains even when girth cannot be increased.

cs.ITCross-listedarXiv:2605.01942•May 5, 2026•2 citations
This paper presents a finite-length polynomial-domain formulation of lifted-product quantum low-density parity-check (QLDPC) codes. We formulate the code construction over the quotient ring F 2[D]/(D L + 1), where polynomial base matrices are lifted entrywise to binary circulant blocks. This representation gives a compact algebraic description of the lifted-product parity-check matrices and allows CSS orthogonality to be analyzed before binary expansion. We show that the standard circulant lifting map is compatible with polynomial conjugation, which implies that the resulting binary matrices satisfy the CSS commutation constraint. The construction is illustrated with a constraint length 7, rate 1/2 NASA convolutional code example, and numerical examples are provided from a 3 x 4 polynomial parity-check matrix. The finite-length performance of selected constructed codes is then evaluated over the depolarizing channel using various benchmark decoders. The resulting framework gives a structured method to construct finite-length lifted-product QLDPC codes from small polynomial base matrices.
Quantum error correction (QEC) is critical for the practical realization of fault-tolerant quantum computing and quantum communication systems. Recently proposed families of quantum low-density parity-check (QLDPC) codes are prime candidates for advanced QEC hardware architectures. This paper focuses on finite-length QLDPC code design criteria, specifically aimed at constructing degenerate quasi-cyclic symmetric lifted-product (LP-QLDPC) codes with high minimum distances. We describe necessary conditions to ensure that the designed LP-QLDPC codes have a minimum distance strictly greater than the minimum weight stabilizer generators, thus ensuring superior error correction performance. The focus of the paper is on LP-QLDPC codes built from quasi-cyclic base codes belonging to the class of type-1 protographs, and the necessary constraints are efficiently expressed in terms of row and column indices of the base parity check matrix. This gives us combinatorial constraints - termed as Row-Column Partition Constraints (RCPC) - on classical quasi-cyclic base matrices to construct degenerate LP-QLDPC codes. For type-1 protographs, RCPC constraints provide an efficient certification approach to designing good codes, and we also give exhaustive search evidence on small base matrices. Simulations with BP+OSD decoding demonstrate significant logical error-rate gains when RCPC is avoided. We discuss extensions to circuit-level noise and outline sufficient conditions and research directions for exact distance preservation.
Quantum low-density parity-check (QLDPC) codes are a promising route to fault-tolerant quantum computation with low overhead, and qudits offer advantages over qubits including more efficient information representation, improved magic state distillation, and richer algebraic structure for code design. Asymptotically good QLDPC codes arise from the lifted product (LP) construction with non-abelian lifts, but cyclic lifts remain attractive in practice because the resulting quasi-cyclic codes have circulant structure that hardware decoders exploit, which matters especially for non-binary decoders with costly check node operations. We introduce a qudit generalization of the LP construction over cyclic group algebras, which extends hypergraph product and LP codes to arbitrary prime-power dimensions and yields quasi-cyclic qudit CSS codes for every stacking order. We bound encoding rates via a connection to additive codes, and show that in the fully stacked case, qudit LP codes built from lifted Tanner codes on expander graphs form families with Θ(log⁡N)Θ(\log N)Θ(logN) logical qudits and almost linear minimum distance Θ(N/log⁡N)Θ(N/\log N)Θ(N/logN), via a distance bound that holds for a general class of LP factors. We also study an additive decoder for general qudit codes and a linear merged-syndrome decoder for fully stacked codes. Monte Carlo simulations under a depolarizing channel with equal symbol error probability show that qudit codes achieve lower frame error rates than comparable qubit codes, and that the linear decoder gives further gains for fully stacked codes.
The design of quantum low-density parity check (QLDPC) codes is discussed, with a special emphasis on their structural properties and iterative decoding techniques. We review diverse QLDPC code construction methods, including Calderbank–Shor–Steane (CSS), non-CSS, and entanglement-assisted variants. The chapter highlights the associated key design challenges, such as the presence of unavoidable length-4 cycles and their impact on decoding performance. Furthermore, a formalism is conceived for constructing high-rate row-circulant QLDPC codes from classical LDPC matrices. Additionally, an attractive nonbinary decoding algorithm is proposed for homogeneous CSS-type QLDPC codes to mitigate the effects of short cycles. The chapter also details a weighted belief propagation algorithm, which is a heuristic method of improving decoding over graphs exhibiting cycles. The limitations of the existing QLDPC designs in approaching the quantum Hashing bound are discussed, and the need for degenerate decoding strategies is emphasized.
Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices HXH_{\mathsf{X}}HX​ and HZH_{\mathsf{Z}}HZ​, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of HXH_{\mathsf{X}}HX​ and HZH_{\mathsf{Z}}HZ​ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.
Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In this paper, we propose an algebraic construction based on dyadic matrices for designing both classical and quantum LDPC codes. The method first generates classical binary quasi-dyadic LDPC codes whose Tanner graphs have girth 6. It is then extended to the Calderbank-Shor-Steane (CSS) framework, where the two component parity-check matrices are built to satisfy the compatibility condition required by the recently introduced CAMEL-ensemble quaternary belief propagation decoder. This compatibility condition ensures that all unavoidable cycles of length 4 are assembled in a single variable node, allowing the mitigation of their detrimental effects by decimating that variable node.
Quantum low-density parity-check (QLDPC) codes offer a promising route to scalable fault-tolerant quantum computation, but their performance under iterative decoding is strongly influenced by short-cycle structure and other harmful subgraphs in the associated Tanner graphs. This paper develops an algebraic framework for constructing and analyzing (Q)LDPC codes from dyadic and quasi-dyadic matrices-translation-invariant 2ℓ×2ℓ2^\ell \times 2^\ell2ℓ×2ℓ binary matrices specified compactly by a signature row and forming a commutative ring with recursive block structure. Leveraging this structure, we relate cycles in lifted Tanner graphs to tailless backtrackless closed walks in the protograph and derive efficient, implementable methods to enumerate and control short cycles (notably 444-, 666-, and 888-cycles). We introduce dyadic-aware PEG-style construction algorithms that use forbidden sets of shifts to maximize attainable girth when possible and otherwise minimize the multiplicity of the shortest cycles at the target girth. Motivated by error-floor phenomena, we further characterize and explicitly enumerate absorbing sets in key dyadic layout boundary cases, identifying configurations that induce abundant (a,0)(a,0)(a,0)-absorbing sets. Finally, we propose CSS-oriented dyadic constructions that satisfy commutation constraints by design and demonstrate via belief-propagation simulations that reducing short-cycle multiplicity can yield substantial decoding gains even when girth cannot be increased.