pith. sign in

arxiv: 2606.22538 · v1 · pith:GCELVATEnew · submitted 2026-06-21 · 🪐 quant-ph

The Quantum Hamming Bound in Arbitrary Local Dimension

Yu-Xuan Zhang , Jing-Ling Chen This is my paper

Pith reviewed 2026-06-26 10:16 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum Hamming boundexact subspace codesquantum error correctionnonbinary codesdegeneracysphere packingfinite length boundLloyd polynomial
0
0 comments X

The pith

The quantum Hamming bound holds for every exact subspace code when the local dimension q is at least 3.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that the sphere-packing count for exact quantum error correction remains valid in all local dimensions q at least 3. The argument shows that degeneracy, which lets distinct physical errors act the same way on the code, can merge error sectors but cannot produce enough overlap to violate the inequality that the code dimension times the volume of a correctable ball must fit inside the total space. Any hypothetical violation is reduced to a normalized two-center ball intersection that is then ruled out by linear programming or positivity arguments. This settles the finite-length case for the nonbinary regime and completes the bound once the separate binary case is included.

Core claim

For every nontrivial exact subspace code with local dimension q at least 3, the product of the code dimension K and the number of correctable local error patterns of weight at most t is at most the total dimension q to the 2n. Degeneracy may identify distinct errors on the code subspace, but the resulting overcount is insufficient to break the inequality. The proof proceeds by showing that any candidate violation reduces to a two-center Hamming-ball intersection inequality normalized by the Lloyd response; this reduced inequality is contradicted for q at least 4 by a uniform half-gap in the Lloyd-square linear program after passage to alphabet size at least 16 and length n equal to 4t plus 1

What carries the argument

Reduction of any potential violation to a normalized two-center Hamming-ball intersection inequality, which is then contradicted by the Lloyd-square linear program (for q at least 4) or by quadratic filtering plus Stein-tangent positivity (for q equal to 3).

If this is right

  • The sphere-packing bound applies to all exact subspace codes once the local dimension reaches three or higher.
  • Degeneracy merges error sectors without allowing the total count to exceed the ambient dimension.
  • Together with the binary endpoint result, the finite-length quantum Hamming bound is established in every local dimension.
  • For q at least 4 the proof supplies a uniform half-gap after reduction to alphabet size at least 16 and length n equal to 4t plus 1.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same reduction technique could be tested on approximate or subsystem codes to see whether a similar counting obstruction appears.
  • Explicit constructions achieving near-equality in the bound for q equal to 3 would now be worth searching for, since the upper limit is confirmed.
  • The linear-programming and positivity methods used here may adapt to other finite-length bounds such as the quantum Singleton or Plotkin bounds in nonbinary alphabets.

Load-bearing premise

Any possible violation of the Hamming inequality for q at least 3 reduces to a two-center Hamming-ball intersection inequality normalized by the Lloyd response.

What would settle it

An explicit exact subspace code with q equal to 3, finite n and t, and code dimension K such that K times the Hamming-ball volume strictly exceeds q to the 2n would falsify the claim.

read the original abstract

The quantum Hamming bound is the finite-length sphere-packing count for exact quantum error correction: the code dimension times the number of correctable local error patterns must fit inside the ambient Hilbert space. For nondegenerate codes this follows from disjoint error spheres. Degeneracy is the only obstruction, because distinct physical errors can coincide on the code subspace and turn sphere packing into an overcount. The central finite-length question has been whether this overcount can ever invalidate the Hamming inequality. Earlier linear-programming, asymptotic, and structural results left a pointwise finite-length problem for arbitrary exact subspace codes. Writing $Q=q^2$ for the Hamming-scheme alphabet, the nonbinary range begins at $Q=9$; here we prove the bound for every $q\ge3$, while the binary endpoint is governed by a distinct $Q=4$ charging geometry. For every nontrivial exact subspace code in this range, any possible violation reduces to a two-center Hamming-ball intersection inequality normalized by the Lloyd response. For $q\ge4$, the Lloyd-square linear program has a uniform half-gap after reduction to alphabet $Q\ge16$ and critical length $n=4t+1$. Qutrits form the boundary: the half-gap disappears, but the bridge is handled by a quadratic-filtered Lloyd square, an exact coefficient-certificate reduction, and a Stein-tangent positivity argument. Thus degeneracy may merge error sectors, but not enough to beat the Hamming count. This proves the nonbinary part of the finite-length quantum Hamming bound; together with the independent binary endpoint theorem, it gives the result in arbitrary local dimension.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript proves the finite-length quantum Hamming bound for all exact subspace codes with local dimension q ≥ 3. Any potential violation due to degeneracy is reduced to a normalized two-center Hamming-ball intersection inequality; this is resolved for q ≥ 4 by a uniform half-gap in the Lloyd-square LP after reduction to alphabet size Q ≥ 16 and length n = 4t + 1, and for q = 3 by a quadratic-filtered Lloyd square together with an exact coefficient-certificate reduction and Stein-tangent positivity argument. The binary (q = 2) case is excluded as having distinct geometry.

Significance. If the derivation holds, the result completes the pointwise finite-length quantum Hamming bound in arbitrary local dimension, a foundational statement in quantum coding theory. The proof is parameter-free, supplies explicit positivity certificates, and separates the binary endpoint cleanly; these features make the claim falsifiable and directly usable for code-construction bounds.

minor comments (2)
  1. [Abstract] The sentence introducing Q = q² in the abstract would benefit from an immediate parenthetical gloss that Q is the alphabet size of the underlying Hamming scheme.
  2. [Abstract] The phrase “Lloyd response” appears without a forward reference to its definition; a single sentence locating the term in the Lloyd polynomial or the associated linear program would improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive evaluation of the manuscript and for recommending acceptance. The report contains no major comments requiring response.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The derivation reduces potential violations of the Hamming bound for q≥3 to an external two-center intersection inequality, then resolves it via independent tools: Lloyd-square LP (with explicit half-gap after reduction to Q≥16, n=4t+1) for q≥4, and quadratic-filtered LP plus Stein-tangent positivity certificate for q=3. The binary (Q=4) case is explicitly separated as distinct geometry. No quoted step equates a claimed prediction or first-principles result to a fitted parameter, self-defined quantity, or load-bearing self-citation chain; the argument is self-contained against external LP geometry and positivity certificates.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proof rests on standard properties of Hilbert spaces, the Hamming association scheme, and linear programming duality; no free parameters or new entities are introduced in the abstract.

axioms (2)
  • standard math The quantum Hamming scheme admits a well-defined Lloyd polynomial and response function for alphabet size Q = q² ≥ 9.
    Invoked when reducing violations to the two-center intersection inequality.
  • domain assumption Error spheres of an exact subspace code are contained in the ambient space with the usual inner-product geometry.
    Background fact from quantum coding theory used throughout the argument.

pith-pipeline@v0.9.1-grok · 5824 in / 1354 out tokens · 55616 ms · 2026-06-26T10:16:24.634165+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

21 extracted references · 16 canonical work pages

  1. [3]

    P. W. Shor, ``Scheme for reducing decoherence in quantum computer memory,'' 10.1103/PhysRevA.52.R2493 Phys. Rev. A 52, R2493 (1995)

    work page doi:10.1103/physreva.52.r2493 1995

  2. [4]

    A. R. Calderbank and P. W. Shor, ``Good quantum error-correcting codes exist,'' 10.1103/PhysRevA.54.1098 Phys. Rev. A 54, 1098 (1996)

    work page doi:10.1103/physreva.54.1098 1996

  3. [5]

    A. M. Steane, ``Error correcting codes in quantum theory,'' 10.1103/PhysRevLett.77.793 Phys. Rev. Lett. 77, 793 (1996)

    work page doi:10.1103/physrevlett.77.793 1996

  4. [6]

    Ekert and C

    A. Ekert and C. Macchiavello, ``Quantum error correction for communication,'' 10.1103/PhysRevLett.77.2585 Phys. Rev. Lett. 77, 2585 (1996)

    work page doi:10.1103/physrevlett.77.2585 1996

  5. [7]

    Laflamme, C

    R. Laflamme, C. Miquel, J. P. Paz, and W. H. Zurek, ``Perfect quantum error correcting code,'' 10.1103/PhysRevLett.77.198 Phys. Rev. Lett. 77, 198 (1996)

    work page doi:10.1103/physrevlett.77.198 1996

  6. [8]

    Theory of quantum error-correcting codes.Phys

    E. Knill and R. Laflamme, ``Theory of quantum error-correcting codes,'' 10.1103/PhysRevA.55.900 Phys. Rev. A 55, 900 (1997)

    work page doi:10.1103/physreva.55.900 1997

  7. [9]

    Class of quantum error-correcting codes saturating the quantum Hamming bound

    D. Gottesman, ``Class of quantum error-correcting codes saturating the quantum Hamming bound,'' 10.1103/PhysRevA.54.1862 Phys. Rev. A 54, 1862 (1996)

    work page doi:10.1103/physreva.54.1862 1996

  8. [10]

    A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, ``Quantum error correction via codes over GF(4),'' 10.1109/18.681315 IEEE Trans. Inf. Theory 44, 1369 (1998)

    work page doi:10.1109/18.681315 1998

  9. [11]

    E. M. Rains, R. H. Hardin, P. W. Shor, and N. J. A. Sloane, ``A nonadditive quantum code,'' 10.1103/PhysRevLett.79.953 Phys. Rev. Lett. 79, 953 (1997)

    work page doi:10.1103/physrevlett.79.953 1997

  10. [12]

    J. A. Smolin, G. Smith, and S. Wehner, ``Simple family of nonadditive quantum codes,'' 10.1103/PhysRevLett.99.130505 Phys. Rev. Lett. 99, 130505 (2007)

    work page doi:10.1103/physrevlett.99.130505 2007

  11. [13]

    P. W. Shor and R. Laflamme, ``Quantum analog of the MacWilliams identities for classical coding theory,'' 10.1103/PhysRevLett.78.1600 Phys. Rev. Lett. 78, 1600 (1997)

    work page doi:10.1103/physrevlett.78.1600 1997

  12. [14]

    E. M. Rains, ``Quantum weight enumerators,'' 10.1109/18.681316 IEEE Trans. Inf. Theory 44, 1388 (1998)

    work page doi:10.1109/18.681316 1998

  13. [15]

    E. M. Rains, ``Quantum shadow enumerators,'' 10.1109/18.796376 IEEE Trans. Inf. Theory 45, 2361 (1999)

    work page doi:10.1109/18.796376 1999

  14. [16]

    Ashikhmin and S

    A. Ashikhmin and S. Litsyn, ``Upper bounds on the size of quantum codes,'' 10.1109/18.761270 IEEE Trans. Inf. Theory 45, 1206 (1999)

    work page doi:10.1109/18.761270 1999

  15. [17]

    Li and L

    Z. Li and L. Xing, ``Progress on problem about quantum Hamming bound for impure quantum codes,'' arXiv:0907.3802 [quant-ph] (2009) https://arxiv.org/abs/0907.3802

    Pith/arXiv arXiv 2009

  16. [18]

    P. K. Sarvepalli and A. Klappenecker, ``Degenerate quantum codes and the quantum Hamming bound,'' 10.1103/PhysRevA.81.032318 Phys. Rev. A 81, 032318 (2010)

    work page doi:10.1103/physreva.81.032318 2010

  17. [19]

    Dallas, F

    E. Dallas, F. Andreadakis, and D. A. Lidar, ``No ((n,K,d<127)) code can violate the quantum Hamming bound,'' 10.1109/MBITS.2023.3262219 IEEE BITS Inf. Theory Mag. 2, 33 (2022)

    work page doi:10.1109/mbits.2023.3262219 2023

  18. [20]

    Nemec and T

    A. Nemec and T. Tansuwannont, ``A Hamming-like bound for degenerate stabilizer codes,'' arXiv:2306.00048 [quant-ph] (2023) https://arxiv.org/abs/2306.00048

    arXiv 2023

  19. [21]

    Delsarte, ``An algebraic approach to the association schemes of coding theory,'' Philips Res

    P. Delsarte, ``An algebraic approach to the association schemes of coding theory,'' Philips Res. Rep. Suppl. 10 (1973)

    1973

  20. [22]

    F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1977)

    1977

  21. [23]

    Zhang and J.-L

    Y.-X. Zhang and J.-L. Chen, ``Degeneracy Cannot Violate the Quantum Hamming Bound,'' arXiv:2606.15558 [quant-ph] (2026) https://arxiv.org/abs/2606.15558

    arXiv 2026