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:0801.2144 · IEEE Information Theory Workshop (ITW)

Non-additive quantum codes from Goethals and Preparata codes

Markus Grassl, Martin Rötteler

Published May 1, 2008• 22 citations
arXivHTMLPDF

Abstract

We extend the stabilizer formalism to a class of nonadditive quantum codes which are constructed from non-linear classical codes. As an example, we present infinite families of nonadditive codes which are derived from Goethals and Preparata codes.
DOI
10.1109/itw.2008.4578694

Related papers

Quantum Goethals-Preparata codes

Markus Grassl, Martin Rötteler

We present a family of non-additive quantum codes based on Goethals and Preparata codes with parameters ((2m, 22m-5m+1, 8)). The dimension of these codes is eight times higher than the dimension of the best known additive quantum codes of equal length and minimum distance.

arXiv:0801.2150•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•29 citations

On the Structure of Additive Quantum Codes and the Existence of Nonadditive Codes

Vwani Roychowdhury, Farrokh Vatan

We first present a useful characterization of additive (stabilizer) quantum error-correcting codes. Then we present several examples of We first present a useful characterization of additive (stabilizer) quantum error--correcting codes. Then we present several examples of nonadditive codes. We show that there exist infinitely many non-trivial nonadditive codes with different minimum distances, and high rates. In fact, we show that nonadditive codes that correct t errors can reach the asymptotic rate R=1-2H(2t/n), where H(x) is the binary entropy function. Finally, we introduce the notion of strongly nonadditive codes (i.e., quantum codes with the following property: the trivial code consisting of the entire Hilbert space is the only additive code that is equivalent to any code containing the given code), and provide a construction for an ((11,2,3)) strongly nonadditive code.

arXiv:quant-ph/9710031•Oct 9, 1997•13 citations

Nonadditive Quantum Codes from $\Z_4$-Codes

San Ling, Patrick Solé

Non additive binary quantum codes are constructed by using classical $\Z_4$-linear binary codes.

•Jan 1, 2008•1 citation

Nonadditive quantum codes

Markus Grassl, Martin Rötteler

Most quantum error-correcting codes (QECCs) that are designed to correct local errors are stabilizer codes that correspond to additive classical codes. Because of this correspondence, stabilizer codes are also referred to as additive codes, while nonstabilizer codes are called nonadditive codes. Shortly after the invention of stabilizer codes by Gottesman [G96a] and independently Calderbank et al. [CRS+98], the nonadditive ((5, 6, 2)) code was found [RHS+97], which constitutes the first example of a nonadditive quantum code with a higher dimension than any stabilizer code of equal length and minimum distance. About ten years later, the first one-error-correcting ((9, 12, 3)) code and the optimal ((10, 24, 3)) code were found [YCL+09, YCO07], both better than any stabilizer code of the same length.

Cambridge University Press eBooks•Sep 5, 2013•6 citations

Two Infinite Families of Nonadditive Quantum Error-Correcting Codes

Sixia Yu, Qing Chen, C. H. Oh

We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear programming bound. All these nonadditive codes can be characterized by a stabilizer-like structure, and thus, their encoding circuits can be designed in a straightforward manner.

arXiv:0901.1935•IEEE Transactions on Information Theory•Oct 13, 2015•8 citations

Generalized concatenated quantum codes

Markus Grassl, Peter W. Shor, Graeme Smith +2 more

We discuss the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we construct families of single-error-correcting nonadditive quantum codes, in both binary and nonbinary cases, which not only outperform any stabilizer codes for finite block length but also asymptotically meet the quantum Hamming bound for large block length.

arXiv:0901.1319•Physical Review A•May 22, 2009•48 citations
We first present a useful characterization of additive (stabilizer) quantum error-correcting codes. Then we present several examples of We first present a useful characterization of additive (stabilizer) quantum error--correcting codes. Then we present several examples of nonadditive codes. We show that there exist infinitely many non-trivial nonadditive codes with different minimum distances, and high rates. In fact, we show that nonadditive codes that correct t errors can reach the asymptotic rate R=1-2H(2t/n), where H(x) is the binary entropy function. Finally, we introduce the notion of strongly nonadditive codes (i.e., quantum codes with the following property: the trivial code consisting of the entire Hilbert space is the only additive code that is equivalent to any code containing the given code), and provide a construction for an ((11,2,3)) strongly nonadditive code.
Nonadditive Quantum Codes from Z4\Z_4Z4​-Codes
Non additive binary quantum codes are constructed by using classical Z4\Z_4Z4​-linear binary codes.
Most quantum error-correcting codes (QECCs) that are designed to correct local errors are stabilizer codes that correspond to additive classical codes. Because of this correspondence, stabilizer codes are also referred to as additive codes, while nonstabilizer codes are called nonadditive codes. Shortly after the invention of stabilizer codes by Gottesman [G96a] and independently Calderbank et al. [CRS+98], the nonadditive ((5, 6, 2)) code was found [RHS+97], which constitutes the first example of a nonadditive quantum code with a higher dimension than any stabilizer code of equal length and minimum distance. About ten years later, the first one-error-correcting ((9, 12, 3)) code and the optimal ((10, 24, 3)) code were found [YCL+09, YCO07], both better than any stabilizer code of the same length.