2026-09-09 東京科学大学
図1. 提案した量子誤り訂正符号の基本設計（ボストンでの招待講演資料［参考文献4］より）。ĤXとĤZは2種類の誤りを見つけるための検査を表す。色は、行列の小さなブロックを規則正しく並べる方法を示している。
＜関連情報＞
量子LDPC符号における直交性の壁を打破する Breaking the Orthogonality Barrier in Quantum LDPC Codes
Kenta Kasai
Quantum Published:2026-09-09
DOI:https://doi.org/10.22331/q-2026-09-09-2205
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 active part of the construction, while preserving regular check-matrix structures. This design circumvents conventional structural distance limitations induced by parent-matrix orthogonality, and enables the construction of quantum LDPC codes with large girth while avoiding latent low-weight logical operators. As a concrete demonstration, we construct a girth-8, (3,12)-regular [[9216,4612,≤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%.
