0402060v2

related topics
{let, theorem, proof}
{group, space, representation}
{error, code, errors}
{key, protocol, security}

Non stabilizer Clifford codes with qupits

Hagiwara Manabu, Hideki Imai

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.

oai_identifier:
oai:arXiv.org:quant-ph/0402060
categories:
quant-ph
comments:
6 pages, accepted to MS+S2004
arxiv_id:
quant-ph/0402060
created:
2004-02-09
updated:
2004-02-26

Full article ▸

related documents
0701054v1
0605132v1
0403160v1
9812015v1
0202140v2
9911056v1
9907101v1
0005087v2
0507024v1
0105014v2
0612033v1
0606242v3
0502144v1
0209139v1
0104007v2
0002009v1
9908090v3
0406146v1
0001034v1
9811027v1
0507194v1
9912076v4
0703193v2
0007101v4
0209059v1