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:quant-ph/9703002 · Physical Review Letters

A Nonadditive Quantum Code

Eric M. Rains, Ronald H. Hardin, Peter W. Shor, Neil J.A. Sloane

Published Aug 4, 1997• 113 citations
arXivHTMLPDF

Abstract

Every good quantum error-correcting code discovered thus far, such as those known as ``stabilizer'' or ``additive'' codes, has had the structure of an eigenspace of an Abelian group generated by tensor products of Pauli matrices. In this Letter we present the first example of a code that is better than any code of this type. It encodes six states in five qubits and can correct the erasure of any single qubit.

DOI
10.1103/physrevlett.79.953

Related papers

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

Codeword Stabilized Quantum Codes

Andrew W. Cross, Graeme Smith, John A. Smolin +1 more

We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with superior parameters to any previously known. In particular, we find ((10,18,3)) and ((10,20,3)) codes. We also show how to construct encoding circuits for all codes within our framework.

arXiv:0708.1021•IEEE Transactions on Information Theory•Jan 1, 2009•123 citations

Nonadditive Quantum Error-Correcting Code

Sixia Yu, Qing Chen, Ching–Yi Lai +1 more

We report the first nonadditive quantum error-correcting code, namely, a ((9, 12, 3)) code which is a 12-dimensional subspace within a 9-qubit Hilbert space, that outperforms the optimal stabilizer code of the same length by encoding more levels while correcting arbitrary single-qubit errors. Taking advantage of the graph states, we construct explicitly a complete encoding-decoding circuit for the proposed nonadditive error-correcting code.

arXiv:0704.2122•Physical Review Letters•Aug 29, 2008•58 citations

Non-stabilizer quantum codes from Abelian subgroups of the error group

V. Arvind, Piyush P. Kurur, Kalyanapuram Rangachari Parthasarathy

This paper is motivated by the computer-generated nonadditive code described in Rains et al\cite{rains97nonadditive}. We describe a theory of non-stabilizer codes of which the nonadditive code of Rains et al is an example. Furthermore, we give a general strategy of constructing good nonstabilizer codes from good stabilizer codes and give some explicit constructions and asymptotically good nonstabilizer codes. Like in the case of stabilizer codes, we can design fairly efficient encoding and decoding procedures.

arXiv:quant-ph/0210097•Quantum Information and Computation•Dec 1, 2004•30 citations

Codeword stabilized quantum codes

Andrew W. Cross, Graeme Smith, John A. Smolin +1 more

We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with superior parameters to any previously known. In particular, we find ((10, 18, 3)) and ((10, 20, 3)) codes. We also show how to construct encoding circuits for all codes within our framework.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•26 citations

Graphical Quantum Error-Correcting Codes

Sixia Yu, Qing Chen, Choo Hiap Oh

We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes, which are potentially more efficient, is not as well understood as that of stabilizer codes. Our graphical approach provides a unified and classical way to construct both stabilizer and nonadditive codes. In particular we have explicitly constructed the optimal ((10,24,3)) code and a family of 1-error detecting nonadditive codes with the highest encoding rate so far. In the case of stabilizer codes a thorough search becomes tangible and we have classified all the extremal stabilizer codes up to 8 qubits.

arXiv:0709.1780•Sep 12, 2007•64 citations
Every good quantum error-correcting code discovered thus far, such as those known as stabilizer'' or additive'' codes, has had the structure of an eigenspace of an Abelian group generated by tensor products of Pauli matrices. In this Letter we present the first example of a code that is better than any code of this type. It encodes six states in five qubits and can correct the erasure of any single qubit.
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.
This paper is motivated by the computer-generated nonadditive code described in Rains et al\cite{rains97nonadditive}. We describe a theory of non-stabilizer codes of which the nonadditive code of Rains et al is an example. Furthermore, we give a general strategy of constructing good nonstabilizer codes from good stabilizer codes and give some explicit constructions and asymptotically good nonstabilizer codes. Like in the case of stabilizer codes, we can design fairly efficient encoding and decoding procedures.
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes, which are potentially more efficient, is not as well understood as that of stabilizer codes. Our graphical approach provides a unified and classical way to construct both stabilizer and nonadditive codes. In particular we have explicitly constructed the optimal ((10,24,3)) code and a family of 1-error detecting nonadditive codes with the highest encoding rate so far. In the case of stabilizer codes a thorough search becomes tangible and we have classified all the extremal stabilizer codes up to 8 qubits.