Polynomial invariants of quantum codes

From MaRDI portal

DOI10.1109/18.817508zbMATH Open1002.94047arXivquant-ph/9704042OpenAlexW2016744140MaRDI QIDQ4503501FDOQ4503501


Authors: Eric Rains Edit this on Wikidata


Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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]).


Full work available at URL: https://arxiv.org/abs/quant-ph/9704042




Recommendations





Cited In (25)





This page was built for publication: Polynomial invariants of quantum codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503501)