CoChat

Polynomial invariants of quantum codes

Open access
Rains, E.M. · 2000 · IEEE Transactions on Information Theory
Cited by 100

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

The weight enumerators (Shor and Laflamme 1997) 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/sub k//sup 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))/sub 2/ code are uniquely determined, an important step in a proof that any ((4, 4, 2))/sub 2/ code is additive (Rains 1999).

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/18.817508

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

Metadata

Authors
Rains, E. M.
Venue
IEEE Transactions on Information Theory
Published
2000
Volume
46
Issue
1
Pages
54-59
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2016744140
Cited by
100
References
1
FWCI
4.58
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.