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

Quantum Information and Computation

On the structure of nonstabilizer clifford codes

KlappeneckerAndreas, RöttelerMartin

Published Mar 1, 2004• 0 citations
Publisher

Abstract

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 k...
DOI
10.5555/2011577.2011584

Related papers

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

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

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•0 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•Jun 2, 2026•0 citations

Clifford codes

Andreas Klappenecker, Martin Rötteler

Quantum error control codes allow to detect and correct errors that are due to decoherence effects. We review some basic properties of these codes and give some constructions. Our main focus will be on a construction of quantum error control codes that have been introduced by Knill in 1996 with the intention to generalize stabilizer codes. These so-called Clifford codes can be constructed and analyzed with tools from representation theory of finite groups. We show that a large class of Clifford codes are actually stabilizer codes. And we construct the smallest example of a Clifford code that is not a stabilizer code.

Computational matematics series/Computational mathematics series•Feb 14, 2002•13 citations

Beyond Stabilizer Codes II: Clifford Codes

Andreas Klappenecker, Martin Roetteler

Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract error group has an abelian index group. In particular, if the errors are modelled by tensor products of Pauli matrices, then the associated Clifford codes are necessarily stabilizer codes.

arXiv:quant-ph/0010076•Oct 23, 2000•3 citations
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.
Quantum error control codes allow to detect and correct errors that are due to decoherence effects. We review some basic properties of these codes and give some constructions. Our main focus will be on a construction of quantum error control codes that have been introduced by Knill in 1996 with the intention to generalize stabilizer codes. These so-called Clifford codes can be constructed and analyzed with tools from representation theory of finite groups. We show that a large class of Clifford codes are actually stabilizer codes. And we construct the smallest example of a Clifford code that is not a stabilizer code.