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/0402060

Non stabilizer Clifford codes with qupits

Manabu Hagiwara, Hideki Imai

Published Feb 9, 2004• 3 citations
arXivHTMLPDF

Abstract

Clifford codes can be understood as a generalization of stabilizer codes. To show the existence of a true Clifford code which is better than any stabilizer code is a well known open problem in the theory of Clifford codes. One of the main difficulties in solving this problem is that we know only about 110 examples of codes which are Clifford but not stabilizer codes. In this paper, we obtain infinite examples of Clifford codes which are not stabilizer codes. We expect our examples to be useful in the study of Clifford codes.

DOI
10.48550/arxiv.quant-ph/0402060

Related papers

A CONSTRUCTION FOR NON-STABILIZER CLIFFORD CODES

Manabu Hagiwara, Hideki Imai

We present a method to construct a non stabilizer Clifford code which encodes a single qupit, i.e. a state described as a vector in p-dimensional Hilbert space, to a pair of a single qupit and a single qubit, for any odd prime p. Thus obtaining infinite non stabilizer Clifford codes.

International Symposium on Mesoscopic Superconductivity and Spintronics (MS+S)•Aug 1, 2005•0 citations

Remarks on clifford codes

Andreas Klappenecker, Martin Rötteler

Clifford codes are quantum error control codes that generalize stabilizer codes. These codes were introduced in 1996 by Knill, but only a single nonstabilizer Clifford code was known to date. We derive a necessary and sufficient condition that allows one to decide when a Clifford code is a stabilizer code. We compile a table of all true Clifford codes for error groups of small order

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•2 citations

Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory

Jonas Eidesen, David W. Kribs, Andrew Nemec

Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.

quant-pharXiv:2606.02531•Journal of Physics A Mathematical and Theoretical•Jun 2, 2026•0 citations

Remarks on Clifford codes

Andreas Klappenecker, Martin Roetteler

Clifford codes are a class of quantum error control codes that form a natural generalization of stabilizer codes. These codes were introduced in 1996 by Knill, but only a single Clifford code was known, which is not already a stabilizer code. We derive a necessary and sufficient condition that allows to decide when a Clifford code is a stabilizer code, and compile a table of all true Clifford codes for error groups of small order.

arXiv:quant-ph/0312228•Dec 31, 2003•2 citations

On the structure of nonstabilizer Cliford codes

Andreas Klappenecker, Martin Rötteler

Clifford codes are a class of quantum error control codes that form a natural generalization of stabilizer codes. These codes were introduced in 1996 by Knill, but only a single Clifford code was known, which was not already a stabilizer code. We derive a necessary and sufficient condition that allows one to decide when a Clifford code is a stabilizer code, and compile a table of all true Clifford codes for error groups of small order.

Quantum Information and Computation•Mar 1, 2004•2 citations

Projective error models: Stabilizer codes, Clifford codes, and weak stabilizer codes

Jonas Eidesen

By defining projective error models we study the mathematical structure of Clifford codes and stabilizer codes using tools from projective representation theory. Furthermore, we introduce a new class of codes which we have called weak stabilizer codes and we determine some relationships between these three classes of codes. We show that the obstruction for a stabilizer code to be non-trivial is given by a class in group cohomology, and we are able to determine similar obstructions for weak stabilizer codes to be non-trivial. In the case where the projective error model corresponds to a nice error basis we give a complete characterization of when a Clifford code is a weak stabilizer code in terms of the size of the group of logical operators and the size of the group of stabilizers of the code. Lastly, we produce two infinite families of Clifford codes that are not stabilizer codes, as well as a method of combining these examples into more examples of non-stabilizer Clifford codes.

arXiv:2506.01843•Jun 2, 2025•1 citation
Clifford codes can be understood as a generalization of stabilizer codes. To show the existence of a true Clifford code which is better than any stabilizer code is a well known open problem in the theory of Clifford codes. One of the main difficulties in solving this problem is that we know only about 110 examples of codes which are Clifford but not stabilizer codes. In this paper, we obtain infinite examples of Clifford codes which are not stabilizer codes. We expect our examples to be useful in the study of Clifford codes.
Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.
By defining projective error models we study the mathematical structure of Clifford codes and stabilizer codes using tools from projective representation theory. Furthermore, we introduce a new class of codes which we have called weak stabilizer codes and we determine some relationships between these three classes of codes. We show that the obstruction for a stabilizer code to be non-trivial is given by a class in group cohomology, and we are able to determine similar obstructions for weak stabilizer codes to be non-trivial. In the case where the projective error model corresponds to a nice error basis we give a complete characterization of when a Clifford code is a weak stabilizer code in terms of the size of the group of logical operators and the size of the group of stabilizers of the code. Lastly, we produce two infinite families of Clifford codes that are not stabilizer codes, as well as a method of combining these examples into more examples of non-stabilizer Clifford codes.