pith. sign in

arxiv: quant-ph/0402060 · v2 · submitted 2004-02-09 · 🪐 quant-ph

Non stabilizer Clifford codes with qupits

classification 🪐 quant-ph
keywords codescliffordstabilizerexamplescodeproblembetterdifficulties
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.