Pith. sign in

REVIEW 1 cited by

Investigations on Automorphism Groups of Quantum Stabilizer Codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.12735 v1 pith:326C4443 submitted 2021-09-27 cs.IT math.IT

Investigations on Automorphism Groups of Quantum Stabilizer Codes

classification cs.IT math.IT
keywords automorphismgroupscodesstabilizerquantumerror-correctingstrongclifford-twisted
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of stabilizer codes, beginning with the analogous notion from the theory of classical codes. Two weakenings of this concept, the weak automorphism group and Clifford-twisted automorphism group, are also discussed, along with many examples highlighting the possible relationships between the types of "automorphism groups". In particular, we construct an example of a $[[10,0,4]]$ stabilizer code showing how the Clifford-twisted automorphism groups might be connected to the Mathieu groups. Finally, nonexistence results are proved regarding stabilizer codes with highly transitive strong and weak automorphism groups, suggesting a potential inverse relationship between the error-correcting properties of a quantum code and the transitivity of those automorphism groups.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks

    quant-ph 2026-07 accept novelty 7.0

    High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and no...