Polynomial invariants of quantum codes

Details Polynomial invariants of quantum codes Polynomial invariants of quantum codes

1997-04-24

arxiv.org/abs/quant-ph/9704042v1

Physics

Quantum Physics

10 pages, AMSTeX

Scientific paper

The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial invariants. We show that the space of degree k invariants of a code of length n is spanned by a set of basic invariants in one-to-one correspondence with S_k^n. We then present a number of equations and inequalities in these invariants; in particular, we give a higher-order generalization of the shadow enumerator of a code, and prove that its coefficients are nonnegative. We also prove that the quartic invariants of a ((4,4,2)) are uniquely determined, an important step in a proof that any ((4,4,2)) is additive ([2]).

Affiliated with

Also associated with

No associations

Rating

Polynomial invariants of quantum codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial invariants of quantum codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial invariants of quantum codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-679310