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

International Symposium on Mesoscopic Superconductivity and Spintronics (MS+S)

A CONSTRUCTION FOR NON-STABILIZER CLIFFORD CODES

Manabu Hagiwara, Hideki Imai

Published Aug 1, 2005• 0 citations
Publisher

Abstract

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.
DOI
10.1142/9789812701619_0047

Related papers

Non stabilizer Clifford codes with qupits

Manabu Hagiwara, Hideki Imai

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.

arXiv:quant-ph/0402060•Feb 9, 2004•3 citations

On a construction of a nonstabilizer clifford quantum code for 2h(2j+1)‐level states

Manabu Hagiwara, Hideki Imai

Abstract The construction of an infinite number of nonstabilizer codes of Clifford type was given for the first time by the authors. However, the method of construction was restricted to encoding from odd prime p‐level quantum states to 2p‐level states. In this paper, the result is extended to the construction of nonstabilizer‐type quantum codes which encode quantum states of arbitrary odd 2j+1‐level to quantum states of 2h(2j+1)‐level, where h are mutually prime 2j+1. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(4): 63 – 68, 2007; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecjc.20222

Electronics and Communications in Japan (Part III Fundamental Electronic Science)•Dec 13, 2006•0 citations

The Fourier Transform Approach to Quantum Coding

Hari Dilip Kumar, Balaji Sundar Rajan

Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from stabilizer codes, and Clifford codes. We analyze these in the framework of the Fourier inversion formula on a group algebra, the group in question being a subgroup of the error group considered. We study other possible code spaces that may be obtained via such an approach, obtaining codes that are the direct sums of translates of Clifford codes, and more general codes obtained from idempotents in the transform domain. We derive necessary and sufficient conditions for error detection by direct sums of translates of Clifford codes, and provide an example using an error group with non-Abelian index group.

arXiv:1208.4911•Aug 24, 2012•0 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

Structure of the Majorana Clifford group

Valérie Bettaque, Brian G. Swingle

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field $\F$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

arXiv:2407.11319•Physical Review A•Jul 14, 2025•12 citations

Clifford Code Constructions of Operator Quantum Error-Correcting Codes

Andreas Klappenecker, Pradeep Kiran Sarvepalli

Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This correspondence introduces a natural construction of such codes in terms of Clifford codes, an elegant generalization of stabilizer codes due to Knill. Character-theoretic methods are used to derive a simple method to construct operator quantum error-correcting codes from any classical additive code over a finite field, which obviates the need for self-orthogonal codes.

arXiv:quant-ph/0604161•IEEE Transactions on Information Theory•Dec 1, 2008•41 citations
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.
Abstract The construction of an infinite number of nonstabilizer codes of Clifford type was given for the first time by the authors. However, the method of construction was restricted to encoding from odd prime p‐level quantum states to 2p‐level states. In this paper, the result is extended to the construction of nonstabilizer‐type quantum codes which encode quantum states of arbitrary odd 2j+1‐level to quantum states of 2h(2j+1)‐level, where h are mutually prime 2j+1. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(4): 63 – 68, 2007; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecjc.20222
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from stabilizer codes, and Clifford codes. We analyze these in the framework of the Fourier inversion formula on a group algebra, the group in question being a subgroup of the error group considered. We study other possible code spaces that may be obtained via such an approach, obtaining codes that are the direct sums of translates of Clifford codes, and more general codes obtained from idempotents in the transform domain. We derive necessary and sufficient conditions for error detection by direct sums of translates of Clifford codes, and provide an example using an error group with non-Abelian index group.
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.
In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field $\F$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.
Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This correspondence introduces a natural construction of such codes in terms of Clifford codes, an elegant generalization of stabilizer codes due to Knill. Character-theoretic methods are used to derive a simple method to construct operator quantum error-correcting codes from any classical additive code over a finite field, which obviates the need for self-orthogonal codes.