dorsal/arxiv
View SchemaBreaking the Orthogonality Barrier in Quantum LDPC Codes
| Authors | Kenta Kasai |
|---|---|
| Categories | |
| ArXiv ID | 2601.08824vv2 |
| URL | https://arxiv.org/abs/2601.08824 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth of the Tanner graph while maintaining regular degree distributions leads simultaneously to good belief-propagation (BP) decoding performance and large minimum distance. In the quantum setting, however, this principle does not directly apply because quantum LDPC codes must satisfy additional orthogonality constraints between their parity-check matrices. When one enforces both orthogonality and regularity in a straightforward manner, the girth is typically reduced and the minimum distance becomes structurally upper bounded. In this work, we overcome this limitation by using permutation matrices with controlled commutativity and by restricting the orthogonality constraints to only the necessary parts of the construction, while preserving regular check-matrix structures. This design breaks the conventional trade-off between orthogonality, regularity, girth, and minimum distance, allowing us to construct quantum LDPC codes with large girth and without the usual distance upper bounds. As a concrete demonstration, we construct a girth-8, (3,12)-regular $[[9216,4612, \leq 48]]$ quantum LDPC code and show that, under BP decoding combined with a low-complexity post-processing algorithm, it achieves a frame error rate as low as $10^{-8}$ on the depolarizing channel with error probability $4 \%$.
{
"annotation_id": "39b74614-b91e-4213-98e4-26fdf0984220",
"date_created": "2026-02-17T05:53:16.187000Z",
"date_modified": "2026-02-17T05:53:16.187000Z",
"file_hash": "9cbc2c89f811719a2dd4ef2a4118e6b0a5390af43c2eb9a0d06b4789e2876586",
"private": false,
"record": {
"abstract": "Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth of the Tanner graph while maintaining regular degree distributions leads simultaneously to good belief-propagation (BP) decoding performance and large minimum distance. In the quantum setting, however, this principle does not directly apply because quantum LDPC codes must satisfy additional orthogonality constraints between their parity-check matrices. When one enforces both orthogonality and regularity in a straightforward manner, the girth is typically reduced and the minimum distance becomes structurally upper bounded.\n In this work, we overcome this limitation by using permutation matrices with controlled commutativity and by restricting the orthogonality constraints to only the necessary parts of the construction, while preserving regular check-matrix structures. This design breaks the conventional trade-off between orthogonality, regularity, girth, and minimum distance, allowing us to construct quantum LDPC codes with large girth and without the usual distance upper bounds. As a concrete demonstration, we construct a girth-8, (3,12)-regular $[[9216,4612, \\leq 48]]$ quantum LDPC code and show that, under BP decoding combined with a low-complexity post-processing algorithm, it achieves a frame error rate as low as $10^{-8}$ on the depolarizing channel with error probability $4 \\%$.",
"arxiv_id": "2601.08824",
"authors": [
"Kenta Kasai"
],
"categories": [
"quant-ph",
"cs.IT",
"math.IT"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Breaking the Orthogonality Barrier in Quantum LDPC Codes",
"url": "https://arxiv.org/abs/2601.08824",
"version": "v2"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "ac3b60da-cede-4c23-8395-d5716542bbbf",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}