From the 1 of 20 linked papers with an AI index.
20 papers
Pair-Partition Constructions for CPM-Based Quantum LDPC Codes
Koki Okada, Kenta Kasai
The paper presents a method to build binary CSS quantum LDPC codes using circulant permutation matrices and pair-partition equations, providing several regular codes with specified…
Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
Kenta Kasai
In classical sparse-graph coding, spatial coupling is a mechanism by which belief-propagation (BP) decoding attains the maximum-a-posteriori (MAP) or area-threshold performance of…
Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts
Koki Okada, Kenta Kasai
We construct a rate- quantum low-density parity-check (LDPC) code from a -regular two-branch finite-field base and a circulant-permutation-matrix (CPM) lift of degree…
A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases
Koki Okada, Kenta Kasai
This paper develops a two-branch multiplicative-coset construction for regular Calderbank-Shor-Steane (CSS) quantum low-density parity-check base matrices. For a target column weig…
A Factor-Graph Formulation of CSS Syndrome Decoding: Joint BP and Four-State BP
Kenta Kasai
For CSS syndrome decoding, the two check matrices impose binary parity-check constraints on the two Pauli error components. The posterior can therefore be written as a binary facto…
High-Girth Regular Quantum LDPC Codes from Square-Base Hypergraph Products via CPM Lifts
Koki Okada, Kenta Kasai
We study square-base Calderbank--Shor--Steane (CSS) hypergraph-product codes as a finite-length class for regular high-girth quantum low-density parity-check (LDPC) design. For bas…