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

Bringing Classical LDPC Design Principles to Quantum LDPC Codes

Kenta Kasai, Kenta Kasai

Published Sep 27, 2026• 0 citations
OpenAlex

Related papers

Bringing Classical LDPC Design Principles to Quantum LDPC Codes

Kenta Kasai, Kenta Kasai

•May 1, 2026•0 citations

Advancing Quantum LDPC Codes with Classical LDPC Design Principles

Kenta Kasai, Kenta Kasai

•Sep 27, 2026•0 citations

Advancing Quantum LDPC Codes with Classical LDPC Design Principles

Kenta Kasai, Kenta Kasai

•Jul 1, 2026•0 citations

Construction of Quantum LDPC Codes From Classical Row-Circulant QC-LDPCs

Zunaira Babar, Panagiotis Botsinis, Dimitrios Alanis +2 more

Classical row-circulant quasi-cyclic (QC) low-density parity check (LDPC) matrices are known to generate efficient high-rate short and moderate-length QC-LDPC codes, while the comparable random structures exhibit numerous short cycles of length-4. Therefore, we conceive a general formalism for constructing nondual-containing Calderbank-Shor-Steane (CSS)-type quantum low-density parity check (QLDPC) codes from arbitrary classical row-circulant QC-LDPC matrices. We apply our proposed formalism to the classical balanced incomplete block design (BIBD)-based row-circulant QC-LDPC codes for demonstrating that our designed codes outperform their dual-containing CSS-type counterparts as well as the entanglement-assisted (EA)-QLDPC codes.

IEEE Communications Letters•Dec 10, 2015•18 citations

Towards practical quantum LDPC codes

Joschka Roffe

•Nov 30, 2021•5 citations

Random Construction of Quantum LDPC Codes

Koki Okada, Kouki OKADA, Kenta Kasai

•Jan 1, 2025•0 citations
Classical row-circulant quasi-cyclic (QC) low-density parity check (LDPC) matrices are known to generate efficient high-rate short and moderate-length QC-LDPC codes, while the comparable random structures exhibit numerous short cycles of length-4. Therefore, we conceive a general formalism for constructing nondual-containing Calderbank-Shor-Steane (CSS)-type quantum low-density parity check (QLDPC) codes from arbitrary classical row-circulant QC-LDPC matrices. We apply our proposed formalism to the classical balanced incomplete block design (BIBD)-based row-circulant QC-LDPC codes for demonstrating that our designed codes outperform their dual-containing CSS-type counterparts as well as the entanglement-assisted (EA)-QLDPC codes.