量子码的多项式不变量
Polynomial invariants of quantum codes
摘要:
量子码的权重计数器(quant-ph/9610040)是探索其结构的强大工具。由于权重枚举器是代码的二次不变量,因此建议考虑高阶多项式不变量。我们证明了长度为n的码的k次不变量空间被一组与S_k^n一一对应的基本不变量所张成。然后,我们提出了一些方程和不等式在这些不变量,特别是,我们给出了一个高阶推广的影子枚举的代码,并证明其系数是非负的。我们还证明了((4,4,2))的四次不变量是唯一确定的,这是证明任何((4,4,2))是可加的([2])的重要一步。
英文摘要:
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]).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。