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

Contemporary mathematics - American Mathematical Society

Construction of new toric quantum codes

Clarice Dias de Albuquerque, Reginaldo Palazzo, Eduardo Brandani da Silva

Published Jan 1, 2010• 11 citations
Publisher
DOI
10.1090/conm/518/10191

Related papers

On the construction of new toric quantum codes and quantum burst-error-correcting codes

Cibele Cristina Trinca, J. Carmelo Interlando, Reginaldo Palazzo +2 more

arXiv:2205.13582•Quantum Information Processing•May 12, 2023•5 citations

New three- and four-dimensional toric and burst error-correcting quantum codes

Cibele Cristina Trinca, Reginaldo Palazzo, Ricardo Augusto Watanabe +3 more

arXiv:2307.06241•Quantum Information Processing•Jan 25, 2024•4 citations

New constructions of CSS codes obtained by moving to higher alphabets

Iryna Andriyanova, Denise Maurice, Jean–Pierre Tillich

We generalize a construction of non-binary quantum LDPC codes over $\F_{2^m}$ due to \cite{KHIS11a} and apply it in particular to toric codes. We obtain in this way not only codes with better rates than toric codes but also improve dramatically the performance of standard iterative decoding. Moreover, the new codes obtained in this fashion inherit the distance properties of the underlying toric codes and have therefore a minimum distance which grows as the square root of the length of the code for fixed $m$.

arXiv:1202.3338•Feb 15, 2012•14 citations

Geometric constructions of quantum codes

Jürgen Bierbrauer, D. Bartoli, Stefano Marcugini +1 more

Contemporary mathematics - American Mathematical Society•Jan 1, 2010•5 citations

Quantum LDPC codes obtained by non-binary constructions

Iryna Andriyanova, Denise Maurice, Jean–Pierre Tillich

We generalize a construction of non-binary quantum LDPC codes over F2mdue to [KHIK11] and apply it in particular to toric codes. We obtain in this way not only codes with better rates than toric codes but also improve dramatically the performance of standard iterative decoding. Moreover, the new codes obtained in this fashion inherit the distance properties of the underlying toric codes and have therefore a minimum distance which grows as the square root of the length of the code for fixed m.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•7 citations

Constructing quantum codes

Hao Chen

Frontiers of Computer Science in China•Jun 1, 2008•0 citations
We generalize a construction of non-binary quantum LDPC codes over $\F_{2^m}$ due to \cite{KHIS11a} and apply it in particular to toric codes. We obtain in this way not only codes with better rates than toric codes but also improve dramatically the performance of standard iterative decoding. Moreover, the new codes obtained in this fashion inherit the distance properties of the underlying toric codes and have therefore a minimum distance which grows as the square root of the length of the code for fixed mmm.