Quantum error correction codes (QECCs) can be constructed from the known classical
coding paradigm by exploiting the inherent isomorphism between the classical and quantum …

In this paper, we construct protograph-based spatially coupled low-density parity-check
(LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner …

The current best asymptotic lower bound on the minimum distance of quantum LDPC codes
with a fixed non-zero rate is logarithmic in the blocklength. We propose a construction of …

The Second Edition of Quantum Information Processing, Quantum Computing, and Quantum
Error Correction: An Engineering Approach presents a self-contained introduction to all …

The near-capacity performance of classical low-density parity check (LDPC) codes and their
efficient iterative decoding makes quantum LDPC (QLPDC) codes a promising candidate for …

The recent advances in quantum information processing, sensing, and communications are
surveyed with the objective of identifying the associated knowledge gaps and formulating a …

The well-documented capacity-approaching performance of sparse codes in the realm of
classical communications has inspired the search for their quantum counterparts. Sparse …

We propose a simple decoding algorithm for CSS codes taking into account the correlations
between the X part and the Z part of the error. Applying this idea to surface codes, we derive …

We design classes of quantum low-density paritycheck (LDPC) codes, called quasi-cyclic
stabilizer (QCS) codes, from conventional QC-LDPC codes. The proposed QCS codes …

We propose here a new construction of quantum codes combining an improved version of a
family of spatially coupled quantum LDPC codes, suggested in [1], with a family of error …