Pith. sign in

REVIEW 1 cited by

A Hamming-Like Bound for Degenerate 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 2306.00048 v1 pith:KHEFBRGI submitted 2023-05-31 quant-ph cs.ITmath.IT

classification quant-phcs.ITmath.IT
keywords boundcodesdegeneratequantumstabilizerhamminghamming-likenondegenerate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The quantum Hamming bound was originally put forward as an upper bound on the parameters of nondegenerate quantum codes, but over the past few decades much work has been done to show that many degenerate quantum codes must also obey this bound. In this paper, we show that there is a Hamming-like bound stricter than the quantum Hamming bound that applies to degenerate $t$-error-correcting stabilizer codes of length greater than some positive integer $N(t)$. We show that this bound holds for all single-error-correcting degenerate stabilizer codes, forcing all but a handful of optimal distance-3 stabilizer codes to be nondegenerate.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Compressing Syndrome Measurement Sequences

    quant-ph 2025-09 conditional novelty 7.0 of 10

    Fault-tolerant syndrome extraction can be compressed from r stabilizer measurements to O(d log r) by combining stabilizer generators through the parity check matrix of a classical code.

Pith tools