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

arXiv:2310.16504 · Designs Codes and Cryptography

Structure of CSS and CSS-T quantum codes

Elena Berardini, A. Caminata, Alberto Ravagnani

Published May 24, 2024• 12 citations
arXivHTMLPDF
DOI
10.1007/s10623-024-01415-9

Related papers

Quantum CSS Duadic and Triadic Codes: New Insights and Properties

Reza Dastbasteh, Olatz Sanz Larrarte, Josu Etxezarreta Martínez +3 more

arXiv:2407.07753•Lecture notes in computer science•Jan 1, 2025•3 citations

Optimization of LDGM-based quantum codes using Density Evolution

Kejing Liu, Javier Garcia‐Frias

We introduce the use of Discrete Density Evolution (DDE) to optimize LDGM-based quantum codes. These are Calderbank-Shor-Steane (CSS) codes based on the generator and parity-check matrices of an LDGM code, which is designed with a specific structure inspired in the parallel concatenation of LDGM codes. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph CSS quantum codes, while leading to better performance.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2010•6 citations

Quantum Universality from Magic States Distillation Applied to CSS Codes

Ben W. Reichardt

arXiv:quant-ph/0411036•Quantum Information Processing•Aug 1, 2005•143 citations

Quantum CSS LDPC Codes with Quasi-Dyadic Structure

Alessio Baldelli, Massimo Battaglioni, Paolo Santini

Quantum quasi-cyclic (QC) and quantum low-density parity-check (LDPC) codes have received significant attention due to their algebraic regularity and performance under low-complexity decoding. In this work, we explore a class of structured quantum codes based on reproducible matrices, which generalize known families such as cyclic, QC, and dyadic codes. Focusing on sparse quasi-dyadic (QD) structures, we investigate how their symmetries influence Tanner graph cycles. Moreover, we construct quantum LDPC codes within the Calderbank-Shor-Steane (CSS) framework, analyzing dual-containing configurations, and assess their error rates.

International Symposium on Turbo Codes and Iterative Information Processing•Aug 18, 2025•2 citations

Encoding and Decoding of CSS-Type Quantum Convolution Codes

Linrang Zhang

The polynomial representation of a quantum state is defined.Based on the Calderbank-Shor-Steane(CSS)-type construction of quantum codes,a new method for encoding and decoding of CSS-type quantum convolution codes is presented.Its corresponding networks are also described.The basis state of the code is transformed into the multiplication of an information polynomial by the generator polynomial.Then networks can be realized with operations of polynomial multiplication. The simple method possesses a highly regular structure,and the networks are easy to realize.

Beijing Youdian Xueyuan xuebao•Jan 1, 2008•0 citations

Constructions of new families of nonbinary CSS codes

Giuliano G. La Guardia, Reginaldo Palazzo

Discrete Mathematics•Aug 4, 2010•54 citations
Quantum quasi-cyclic (QC) and quantum low-density parity-check (LDPC) codes have received significant attention due to their algebraic regularity and performance under low-complexity decoding. In this work, we explore a class of structured quantum codes based on reproducible matrices, which generalize known families such as cyclic, QC, and dyadic codes. Focusing on sparse quasi-dyadic (QD) structures, we investigate how their symmetries influence Tanner graph cycles. Moreover, we construct quantum LDPC codes within the Calderbank-Shor-Steane (CSS) framework, analyzing dual-containing configurations, and assess their error rates.
The polynomial representation of a quantum state is defined.Based on the Calderbank-Shor-Steane(CSS)-type construction of quantum codes,a new method for encoding and decoding of CSS-type quantum convolution codes is presented.Its corresponding networks are also described.The basis state of the code is transformed into the multiplication of an information polynomial by the generator polynomial.Then networks can be realized with operations of polynomial multiplication. The simple method possesses a highly regular structure,and the networks are easy to realize.