My recent research focuses on quantum error correction using low-density parity-check (LDPC) codes, particularly the construction and decoding of Calderbank-Shor-Steane (CSS) quantum codes based on sparse binary or non-binary matrices. We aim to design quantum codes that approach the hashing bound under practical decoding algorithms.
One of our major achievements is the development of explicit quantum LDPC codes constructed from permutation matrices, which demonstrate excellent error-correcting performance over depolarizing and erasure channels. These constructions are designed to avoid short cycles in the Tanner graph to suppress the error floor phenomenon.
We are also working on decoding algorithms that handle degeneracy in quantum noise models, including syndrome-based decoding and belief propagation methods adapted for Galois fields. Recent results suggest that combining dual codes with appropriate post-processing significantly improves the decoding success rate.
This line of work contributes to the long-term goal of realizing scalable and fault-tolerant quantum communication and computation.
The paper "Efficient Mitigation of Error Floors in Quantum Error Correction using Non-Binary Low-Density Parity-Check Codes", authored by Kenta Kasai, has been accepted for presentation at the IEEE International Symposium on Information Theory (ISIT 2025).
This paper presents decoding algorithms designed to mitigate the error floor in quantum LDPC codes constructed over non-binary fields, achieving performance close to the hashing bound under practical quantum noise models.
As a follow-up to this work, we will present new results in the Recent Results Poster Session at ISIT 2025, to be held in Ann Arbor, Michigan.
Preprint available on arXiv.
Email: kenta@ict.eng.isct.ac.jp
Office: Room 418, South Building 3, Ookayama Campus, Tokyo Institute of Science and Technology
2-12-1 Ookayama, Meguro-ku, Tokyo 152-8550, Japan