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

Efficient Mitigation of Error Floors in Quantum Error Correction using Non-Binary Low-Density Parity-Check Codes

Kenta Kasai

Published Jan 1, 2025• 0 citations
OpenAlex

Related papers

Error correction with quantum low-density parity check codes

Alexey A. Kovalev, Leonid P. Pryadko

Bulletin of the American Physical Society•Mar 20, 2013•0 citations

Efficient Mitigation of Error Floors in Quantum Error Correction Using Non-Binary Low-Density Parity-Check Codes

Kenta Kasai

In this paper, we propose an efficient method to reduce error floors in quantum error correction using non-binary low-density parity-check (LDPC) codes. We identify and classify cycle structures in the parity-check matrix where estimated noise becomes trapped, and develop tailored decoding methods for each cycle type. For Type-I cycles, we propose a method to make the difference between estimated and true noise degenerate. Type-II cycles are shown to be un-correctable, while for Type-III cycles, we utilize the fact that cycles in non-binary LDPC codes do not necessarily correspond to codewords, allowing us to estimate the true noise. Our method significantly improves decoding performance and reduces error floors.

arXiv:2501.13923•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•3 citations

1 Quantum Error Correction beyond the Bounded Distance Decoding Limit

Kenta Kasai, Manabu Hagiwara, Hideki Imai +3 more

In this paper, we consider quantum error correction over depolarizing channels with non-binary low-density parity-check codes defined over Galois field of size $2^p$ . The proposed quantum error correcting codes are based on the binary quasi-cyclic CSS (Calderbank, Shor and Steane) codes. The resulting quantum codes outperform the best known quantum codes and surpass the performance limit of the bounded distance decoder. By increasing the size of the underlying Galois field, i.e., $2^p$, the error floors are considerably improved.

•Aug 16, 2016•38 citations

A Performance Analysis of Quantum Low-Density Parity-Check Codes for Correcting Correlated Errors

Jihao Fan

International Journal of Theoretical Physics•Oct 20, 2020•1 citation

Error floors of non-binary LDPC codes

T. Nozaki, Kenta Kasai, Kohichi Sakaniwa

In this paper, we analyze (2, k)-regular non-binary low-density parity-check codes over the binary erasure channels. We propose a method to improve the error floors by optimizing labels in zigzag cycles in the Tanner graph. We analyze the error floors for codes designed by the proposed optimization method and show that the error floors are decreasing in the size of Galois field.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•7 citations

Quantum Error Correction with Non-Binary LDPC Codes

Kasai Kenta, Manabu Hagiwara, Hideki Imai +1 more

IEICE Technical Report; IEICE Tech. Rep.•Oct 28, 2010•0 citations
In this paper, we propose an efficient method to reduce error floors in quantum error correction using non-binary low-density parity-check (LDPC) codes. We identify and classify cycle structures in the parity-check matrix where estimated noise becomes trapped, and develop tailored decoding methods for each cycle type. For Type-I cycles, we propose a method to make the difference between estimated and true noise degenerate. Type-II cycles are shown to be un-correctable, while for Type-III cycles, we utilize the fact that cycles in non-binary LDPC codes do not necessarily correspond to codewords, allowing us to estimate the true noise. Our method significantly improves decoding performance and reduces error floors.
In this paper, we consider quantum error correction over depolarizing channels with non-binary low-density parity-check codes defined over Galois field of size 2p2^p2p . The proposed quantum error correcting codes are based on the binary quasi-cyclic CSS (Calderbank, Shor and Steane) codes. The resulting quantum codes outperform the best known quantum codes and surpass the performance limit of the bounded distance decoder. By increasing the size of the underlying Galois field, i.e., 2p2^p2p, the error floors are considerably improved.