Kenta Kasai 笠井健太 (@kasai_lab) header
Kenta Kasai 笠井健太 (@kasai_lab) profile picture

Assoc. Prof. Science Tokyo, Quantum LDPC codes 准教授 東京科学大学(旧 東京工業大学)量子LDPC符号を研究しています。

Joined May 2025
Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)Photo by Kenta Kasai 笠井健太 (@kasai_lab)
I’ve posted a new preprint on arXiv. Classical (J,L)-regular LDPC codes built from random permutations have linear minimum distance with high probability under suitable degree conditions. I expected the same for CSS codes and encouraged people to pursue this direction at every opportunity. This preprint proves that my expectation was wrong for the uniform ensemble of commuting CSS check-matrix pairs built as full J×L arrays of permutation matrices. For fixed J≥3 and even L>2J, the relative minimum distance d/n converges to zero in probability. This does not rule out the existence of (J,L)-regular CSS LDPC families with linear distance. Existence and finding good codes with high probability by random sampling are different questions. arxiv.org/abs/2611.21389
11
856
I’ll be at JMM 2027 in Chicago, January 12–15! On January 12, 8:00–8:30 a.m. CST, I’ll present “Designing Quantum LDPC Codes Through Classical Coding Theory” in the AMS Special Session “Coding Theory: From Foundations to Frontiers, I.” Hope to see you there! Program: meetings.ams.org/math/jmm202…
1
138
I enjoy seeing promising codes posted on QEC Challenge. With recent progress in certifying distance lower bounds, I’d love to see more codes showcased with certified lower bounds on their distance. qecchallenge.com
1
12
744
Honored that Victor Albert (NIST) highlighted my quantum error-correcting codes as “one standout” in Riverlane’s QEC Report 2026. Grateful to my collaborators and students as we work toward practical quantum error correction. riverlane.com/quantum-error-…
1
18
1,194
Slides from today’s talk at the CWI QEC workshop in Amsterdam are now online! Ultra-High-Rate Quantum LDPC Codes Slides: kasai.ict.eng.isct.ac.jp/fil…
1
5
417
Slides from today’s talk at Frontiers in Scaling Superconducting Quantum Computing in Riva del Garda, Italy, are now online! Ultra-High-Rate Quantum LDPC Codes Slides: kasai.ict.eng.isct.ac.jp/pre…
1
5
481
What a fantastic talk. This puts into words exactly what I’ve been trying to say, though I’m not sure I got it across in my own talk. youtube.com/watch?v=mqzGfnkV…
4
1
32
3,965
Kenta Kasai 笠井健太 retweeted
Excited to share our work on parallel algebraic surgery for high-rate qLDPC code with constant shuttling depth on neutral atom quantum computers. Preprint: scirate.com/arxiv/2609.39874 Animation: tiangangzhou.github.io/hardw…
4
1
4
270
I gave a talk today at the YITP workshop “Fault-tolerant Logical Processing” at Kyoto University. The title was “Ultra-High-Rate Quantum LDPC Codes.” I have uploaded the slides here: kasai.ict.eng.isct.ac.jp/fil… The talk covers CPM-based pair-partition codes, certified minimum distances, symplectic halving, and low-weight canonical logical bases.
1
8
938
New preprint with Koki Okada : “Low-Weight Canonical Logical Bases from Pair-Partition Codes.” We construct complete canonical logical bases for CPM-PP quantum LDPC codes with [[320,80,14]], [[448,112,18]], and [[2048,512,24]]. All three have maximum check weight 10 on both the X and Z sides. Their canonical logical representatives have binary weights 25, 27, and 27, respectively, on both the X and Z sides. scirate.com/arxiv/2609.35601
9
986
I’m delighted to speak at the 49th RQC Colloquium! “Ultra-High-Rate Quantum LDPC Codes” 📅 Oct. 14, 2026, 16:00–17:00 JST 📍 RIKEN Wako / Zoom (hybrid) rqc.riken.jp/en/pdf/49th_RQC…
2
16
936
Our new preprint, “Design Principles for Ultra-High-Rate Quantum Codes,” is now available on arXiv! Joint work with Jong Yeon Lee, Koki Okada, Nishad Maskara, and Hengyun Zhou. How can we protect more logical qubits with fewer physical qubits? We develop systematic design principles for navigating the tradeoffs among encoding rate, distance, check weight, and blocklength. Combining pair-partition constructions with a halving transformation, we obtain compact non-CSS codes with weight-10 checks, including [[90,21,11]], [[140,31,15]], and [[200,43,20]]. We identify column weight as a key design parameter and use symmetry to find low-weight logical bases. This work also subsumes the earlier results of arXiv:2607.14091. scirate.com/arxiv/2609.30069
3
30
2,167
My favorite reading of "Cecilia" by Simon & Garfunkel: it's a song about superintelligence. She shakes his confidence daily. He steps away for a minute and finds another man already in his place. And when she comes back, he's overjoyed anyway. Written in 1970. youtube.com/watch?v=a5_QV97e…
650
I’m planning to attend the CWI Quantum Error Correction Workshop in Amsterdam on October 28–30. Looking forward to catching up with colleagues, meeting new people, and discussing quantum error correction!
10
1,553
GPT-6 Astraの性能がすごい! 研究では量子誤り訂正用の新しい符号も発見してくれるし、ファミコンロッキーの裏技「巨大化ハットリくん」も作ってくれました。小さい頃、信じて騙されたなぁ。
3
538
今週はTSUBAMEがメンテナンスで、研究がはかどらない。TSUBAMEの料金が安すぎて、自前で計算サーバを立てようという気も起こらない。
382