Two-dimensional Entanglement-assisted Quantum Quasi-cyclic Low-density Parity-check Codes

2026-01-13

AI Summary

This work addresses the performance limitations of two-dimensional quantum low-density parity-check (QLDPC) codes arising from 4-cycles in their Tanner graphs and their reliance on a large number of pre-shared entangled bits (ebits). The authors propose a novel construction based on p×p×p tensor stacking, yielding the first two-dimensional quasi-cyclic LDPC (QC-LDPC) codes with girth greater than 4—indeed, exceeding 6—and strong erasure-correction capability, capable of correcting at least p×p erasures. Building upon this foundation, they construct two classes of two-dimensional entanglement-assisted QLDPC (EA-QLDPC) codes. Notably, one class requires only a single ebit and is free of 4-cycles, achieving significantly improved decoding performance and practicality while maintaining structural simplicity.

Technology Category

• Machine Learning: Quantum Machine Learning
• Knowledge Representation and Reasoning: Qualitative Reasoning
• Natural Language Processing: Question Answering

Application Category

• Graph Algorithms and Modeling for the Web: Graph embeddings and representation learning for Web-related graphs
• Economics, Online Markets and Human Computation: LLM based quality controls for crowd work
• Security and Privacy: Large-scale security measurements

Abstract

For any positive integer $g \ge 2$, we derive general condition for the existence of a $2g$-cycle in the Tanner graph of two-dimensional ($2$-D) classical quasi-cyclic (QC) low-density parity-check (LDPC) codes. Depending on whether $p$ is an odd prime or a composite number, we construct two distinct families of $2$-D classical QC-LDPC codes with girth $>4$ by stacking $p \times p \times p$ tensors. Furthermore, using generalized Behrend sequences, we propose an additional family of $2$-D classical QC-LDPC codes with girth $>6$, constructed via a similar tensor-stacking approach. All the proposed $2\text{-D}$ classical QC-LDPC codes exhibit an erasure correction capability of at least $p \times p$. Based on the constructed $2\text{-D}$ classical QC-LDPC codes, we derive two families of $2\text{-D}$ entanglement-assisted (EA) quantum low-density parity-check (QLDPC) codes. The first family of $2\text{-D}$ EA-QLDPC codes is obtained from a pair of $2\text{-D}$ classical QC-LDPC codes and is designed such that the unassisted part of the Tanner graph of the resulting EA-QLDPC code is free of $4$-cycles, while requiring only a single ebit to be shared across the quantum transceiver. The second family is constructed from a single $2\text{-D}$ classical QC-LDPC code whose Tanner graph is free from $4$-cycles. Moreover, the constructed EA-QLDPC codes inherit an erasure correction capability of $p \times p$, as the underlying classical codes possess the same erasure correction property.

Problem

• entanglement-assisted quantum codes
• quasi-cyclic LDPC codes
• Tanner graph
• girth
• erasure correction

Innovation

• entanglement-assisted quantum codes
• quasi-cyclic LDPC codes
• two-dimensional tensor stacking
• girth optimization
• erasure correction capability