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:2407.07753 · Lecture notes in computer science

Quantum CSS Duadic and Triadic Codes: New Insights and Properties

Reza Dastbasteh, Olatz Sanz Larrarte, Josu Etxezarreta Martínez, Antonio deMarti iOlius, Javier Oliva del Moral, Pedro M. Crespo

Published Jan 1, 2025• 3 citations
arXivHTMLPDF
DOI
10.1007/978-3-031-81824-0_5

Related papers

QUANTUM DUADIC AND AFFINE-INVARIANT CODES

Kenza Guenda

We construct new families of duadic codes and derive from them degenerate quantum codes. This provides a solution to a question raised by Aly, Klappenecker and Sarvepalli on the existence of quantum codes from duadic codes when the multiplicative order of q modulo n is even. We also characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we give a family of quantum code.

International Journal of Quantum Information•Feb 1, 2009•11 citations

Structure of CSS and CSS-T quantum codes

Elena Berardini, A. Caminata, Alberto Ravagnani

arXiv:2310.16504•Designs Codes and Cryptography•May 24, 2024•12 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

Two Families of Quantum Codes Derived from Cyclic Codes

Kenza Guenda

We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived from the classical duadic codes. This answer an open problem asked by Aly et al.

arXiv:0711.2050•Nov 13, 2007•0 citations

Remarkable Degenerate Quantum Stabilizer Codes Derived from Duadic Codes

Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli

Good quantum codes, such as quantum MDS codes, are typically nondegenerate, meaning that errors of small weight require active error-correction, which is -unfortunately- itself prone to errors. In this paper, examples of degenerate quantum codes are constructed that alleviate this problem in that they allow some errors of small weight that do not require active error correction. In particular, two new families of [[n, 1, ges radicn]]qdegenerate quantum codes are derived from classical duadic codes

arXiv:quant-ph/0601117•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•21 citations

Quantum Code Constructions

Giuliano G. La Guardia

Quantum science and technology•Jan 1, 2020•0 citations
Good quantum codes, such as quantum MDS codes, are typically nondegenerate, meaning that errors of small weight require active error-correction, which is -unfortunately- itself prone to errors. In this paper, examples of degenerate quantum codes are constructed that alleviate this problem in that they allow some errors of small weight that do not require active error correction. In particular, two new families of [[n, 1, ges radicn]]qdegenerate quantum codes are derived from classical duadic codes