Developed explicit quantum LDPC codes from permutation matrices with strong error-correcting performance over depolarizing channels
Designed codes avoiding short cycles in Tanner graphs to suppress error floors
Achieved performance close to the hashing bound, reduced error floors in low-rate regimes, constructed large-girth codes, and discovered binary LDPC codes with sharp error-rate transitions
Published results in npj Quantum Information (arXiv:2506.15636)
Released open-source joint and degeneracy-aware BP decoder for non-binary LDPC quantum error correction on GitHub
Made parity-check matrix data from the paper publicly available
Background
Associate Professor, Department of Information and Communications Engineering, Institute of Science Tokyo
Research Interests: Quantum Error Correction, Coding Theory, Information Theory
Focuses on designing practical quantum LDPC codes approaching the hashing bound
Specializes in construction and decoding of Calderbank–Shor–Steane (CSS) quantum codes based on sparse binary or non-binary matrices
Aims to realize scalable and fault-tolerant quantum communication and computation