Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2606.22538

The Quantum Hamming Bound in Arbitrary Local Dimension

Yu-Xuan Zhang, Jing-Ling Chen

quant-phSubmitted Jun 21, 2026• Announced Jun 23, 2026• 0 citations• Revised Oct 5, 2026 (v2)
v1 · Jun 21, 2026v2 · Oct 5, 2026
arXivHTMLPDF

Abstract

The quantum Hamming bound arises from a direct dimension estimate for exact quantum error-correcting codes. For nondegenerate codes, distinct correctable errors map the code space into orthogonal subspaces, so dimension counting directly gives the bound; degeneracy allows these subspaces to overlap and invalidates the argument. Although linear-programming, asymptotic, and structural approaches have advanced the problem from several directions, the general local-dimension case has remained open. Here we prove the quantum Hamming bound for every local dimension $q\ge3$. Building on the exact two-center Fourier reduction, we develop new overlap estimates for nonbinary Hamming spaces. For $q\ge4$, Jacobi estimates and monotonicity give a uniform gap; qutrits form the boundary case where the gap vanishes and are handled by a filtered correction. This completes the finite-length nonbinary case; together with the existing qubit result, it establishes the quantum Hamming bound for arbitrary local dimension.

Comments
Main 6 pages+ SM 39 pages. Revised version, adding 2 figures

Related papers

Degeneracy Cannot Violate the Quantum Hamming Bound

Yu-Xuan Zhang, Jing-Ling Chen

The quantum Hamming bound is the standard finite-length sphere-packing bound for exact correction of arbitrary qubit errors. Whether degeneracy can evade this bound has remained unresolved in full generality for nearly three decades: distinct correctable errors may act identically on the code space, so the usual disjoint-sphere argument breaks down. We prove that every exact binary quantum subspace code with $K>1$ obeys the bound, without assuming either nondegeneracy or additivity. Our proof turns the Li--Xing linear-programming polynomial into an exact intersection count for quaternary Hamming balls. Monotonicity in block length and in ball-center separation then reduces the problem to a local node--edge charging inequality at the shortest admissible length. Thus degeneracy can merge correctable error sectors, but cannot enlarge the finite-length binary Hamming bound.

quant-pharXiv:2606.15558•Jun 16, 2026•0 citations

The strengthened quantum Hamming bound of Yu, Lai, and Oh

Valery, Grishin, Aryeh Lev Zabokritskiy

We prove a conjecture of Yu, Lai, and Oh: their strengthened quantum Hamming bounds, a family that interpolates between Hamming-type bounds and the Singleton bound, hold for all quantum codes of dimension $K>1$, including impure and nonadditive codes. The result covers every integer local dimension $p\ge2$, not necessarily a prime power, every integer $t\ge1$, both distances $2t+1$ and $2t+2$, and every interpolation parameter $e\in\{0,\ldots,t\}$. The case $e=0$ implies the ordinary quantum Hamming bound for general codes, recently proved by Zhang and Chen. Yu, Lai, and Oh proved their bounds for pure codes and for general codes of distance three or four. More generally, for every integer $p\ge2$ and every quantum code of length $n$, dimension $K>1$ and distance $d\ge3$, we prove $Kf(0)\le p^n\mathbb{E} f(X)$, where $X\sim\operatorname{Bin}(n,1-p^{-2})$, for every real polynomial $f$ of degree less than $d$ that is nonnegative on $\{0,\ldots,n\}$ and positive at zero. For pure codes this inequality is implicit in the argument of Yu, Lai, and Oh. The proof uses the linear-programming method with quantum weight enumerators.

quant-pharXiv:2610.30088•Oct 22, 2026•0 citations

Pauli-ball discrepancy and stability of quantum codes

Aryeh Lev Zabokritskiy "Yohananov"

The Pauli-ball discrepancy, a quadratic discrepancy summed over all error radii, measures how uniformly the Pauli error images of a $K$-dimensional quantum code cover the $d$-dimensional Hilbert space. At parameters attaining equality in the quantum Singleton bound with minimum code distance $\geq3$, or in the one-error Hamming bound with prime-power local dimension, the discrepancy of every projector of the prescribed rank equals an explicit benchmark plus an exact nonnegative remainder, which vanishes precisely for pure quantum maximum-distance-separable codes and nondegenerate perfect codes, respectively. For a Pauli ball of radius $e$ below half the target distance and size $V_e$, this remainder linearly bounds the squared Hilbert--Schmidt distance of the error-image Gram matrix from the identity. When $KV_e\leq d$, it linearly bounds the diamond error and entanglement infidelity of a noise-independent polar recovery under any noise in that ball's span. For five qubits, we obtain the sharp rank-two Gram constant and exact logical channels of rotated codes attaining this linear order in diamond error. For pure states, the discrepancy equals a pure-state benchmark plus a positive weighted sum of marginal-purity defects, so absolutely maximally entangled states, when they exist, are exactly the minimizers.

quant-pharXiv:2610.34399•Oct 27, 2026•0 citations

A Hamming-Like Bound for Degenerate Stabilizer Codes

Andrew Nemec, Theerapat Tansuwannont

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.

arXiv:2306.00048•May 31, 2023•0 citations

Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators

Ching–Yi Lai, Alexei Ashikhmin

Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight enumerator. After deriving the MacWilliams identities for these enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. Our Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes. In addition, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of quantum codes of small length. In particular, we show that there is no [[27, 15, 5]] or [[28, 14, 6]] stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.

arXiv:1602.00413•IEEE Transactions on Information Theory•Jun 2, 2017•103 citations

Bounds for General $(r,δ)$-Quantum Locally Recoverable Codes

Shuowei Ma, Fei Shi

We study general $(r,δ)$-quantum locally recoverable codes (qLRCs) without assuming purity or a stabilizer structure, and with arbitrarily overlapping recovery blocks. Using a selection lemma for multiple-erasure recovery, we establish a Singleton-like upper bound for general quantum subspaces. When $δ=2$, this bound reduces to the general single-erasure bound of Golowich and Guruswami. An integer optimization yields an explicit remainder correction that tightens the bound by up to $δ-2$. For pure codes, local decoupling and entropy arguments extend the parameter bound of Galindo et al., originally obtained for pure stabilizer codes constructed from Euclidean or Hermitian dual-containing classical codes, to arbitrary pure quantum subspaces. We also remove the partition assumption from several existing pure-code bounds for disjoint recovery blocks and obtain a further remainder correction by optimizing the budget. Finally, we analyze three families attaining these bounds: pure codes with overlapping recovery blocks and $d=δ$, which exhibit both a strict improvement of the pure-code bound and simultaneous equality in the pure-code and general bounds; impure codes with disjoint recovery blocks attaining the general bound; and an existing family of pure codes with overlapping recovery blocks and $d>δ$, which simultaneously attains all these bounds.

quant-pharXiv:2610.40273•Oct 30, 2026•0 citations
The quantum Hamming bound arises from a direct dimension estimate for exact quantum error-correcting codes. For nondegenerate codes, distinct correctable errors map the code space into orthogonal subspaces, so dimension counting directly gives the bound; degeneracy allows these subspaces to overlap and invalidates the argument. Although linear-programming, asymptotic, and structural approaches have advanced the problem from several directions, the general local-dimension case has remained open. Here we prove the quantum Hamming bound for every local dimension q≥3q\ge3q≥3. Building on the exact two-center Fourier reduction, we develop new overlap estimates for nonbinary Hamming spaces. For q≥4q\ge4q≥4, Jacobi estimates and monotonicity give a uniform gap; qutrits form the boundary case where the gap vanishes and are handled by a filtered correction. This completes the finite-length nonbinary case; together with the existing qubit result, it establishes the quantum Hamming bound for arbitrary local dimension.
The quantum Hamming bound is the standard finite-length sphere-packing bound for exact correction of arbitrary qubit errors. Whether degeneracy can evade this bound has remained unresolved in full generality for nearly three decades: distinct correctable errors may act identically on the code space, so the usual disjoint-sphere argument breaks down. We prove that every exact binary quantum subspace code with K>1K>1K>1 obeys the bound, without assuming either nondegeneracy or additivity. Our proof turns the Li--Xing linear-programming polynomial into an exact intersection count for quaternary Hamming balls. Monotonicity in block length and in ball-center separation then reduces the problem to a local node--edge charging inequality at the shortest admissible length. Thus degeneracy can merge correctable error sectors, but cannot enlarge the finite-length binary Hamming bound.
We prove a conjecture of Yu, Lai, and Oh: their strengthened quantum Hamming bounds, a family that interpolates between Hamming-type bounds and the Singleton bound, hold for all quantum codes of dimension K>1K>1K>1, including impure and nonadditive codes. The result covers every integer local dimension p≥2p\ge2p≥2, not necessarily a prime power, every integer t≥1t\ge1t≥1, both distances 2t+12t+12t+1 and 2t+22t+22t+2, and every interpolation parameter e∈{0,…,t}e\in\{0,\ldots,t\}e∈{0,…,t}. The case e=0e=0e=0 implies the ordinary quantum Hamming bound for general codes, recently proved by Zhang and Chen. Yu, Lai, and Oh proved their bounds for pure codes and for general codes of distance three or four. More generally, for every integer p≥2p\ge2p≥2 and every quantum code of length nnn, dimension K>1K>1K>1 and distance d≥3d\ge3d≥3, we prove Kf(0)≤pnEf(X)Kf(0)\le p^n\mathbb{E} f(X)Kf(0)≤pnEf(X), where X∼Bin⁡(n,1−p−2)X\sim\operatorname{Bin}(n,1-p^{-2})X∼Bin(n,1−p−2), for every real polynomial fff of degree less than ddd that is nonnegative on {0,…,n}\{0,\ldots,n\}{0,…,n} and positive at zero. For pure codes this inequality is implicit in the argument of Yu, Lai, and Oh. The proof uses the linear-programming method with quantum weight enumerators.
The Pauli-ball discrepancy, a quadratic discrepancy summed over all error radii, measures how uniformly the Pauli error images of a KKK-dimensional quantum code cover the ddd-dimensional Hilbert space. At parameters attaining equality in the quantum Singleton bound with minimum code distance ≥3\geq3≥3, or in the one-error Hamming bound with prime-power local dimension, the discrepancy of every projector of the prescribed rank equals an explicit benchmark plus an exact nonnegative remainder, which vanishes precisely for pure quantum maximum-distance-separable codes and nondegenerate perfect codes, respectively. For a Pauli ball of radius eee below half the target distance and size VeV_eVe​, this remainder linearly bounds the squared Hilbert--Schmidt distance of the error-image Gram matrix from the identity. When KVe≤dKV_e\leq dKVe​≤d, it linearly bounds the diamond error and entanglement infidelity of a noise-independent polar recovery under any noise in that ball's span. For five qubits, we obtain the sharp rank-two Gram constant and exact logical channels of rotated codes attaining this linear order in diamond error. For pure states, the discrepancy equals a pure-state benchmark plus a positive weighted sum of marginal-purity defects, so absolutely maximally entangled states, when they exist, are exactly the minimizers.
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 ttt-error-correcting stabilizer codes of length greater than some positive integer N(t)N(t)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.
Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight enumerator. After deriving the MacWilliams identities for these enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. Our Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes. In addition, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of quantum codes of small length. In particular, we show that there is no [[27, 15, 5]] or [[28, 14, 6]] stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.
Bounds for General (r,δ)(r,δ)(r,δ)-Quantum Locally Recoverable Codes
We study general (r,δ)(r,δ)(r,δ)-quantum locally recoverable codes (qLRCs) without assuming purity or a stabilizer structure, and with arbitrarily overlapping recovery blocks. Using a selection lemma for multiple-erasure recovery, we establish a Singleton-like upper bound for general quantum subspaces. When δ=2δ=2δ=2, this bound reduces to the general single-erasure bound of Golowich and Guruswami. An integer optimization yields an explicit remainder correction that tightens the bound by up to δ−2δ-2δ−2. For pure codes, local decoupling and entropy arguments extend the parameter bound of Galindo et al., originally obtained for pure stabilizer codes constructed from Euclidean or Hermitian dual-containing classical codes, to arbitrary pure quantum subspaces. We also remove the partition assumption from several existing pure-code bounds for disjoint recovery blocks and obtain a further remainder correction by optimizing the budget. Finally, we analyze three families attaining these bounds: pure codes with overlapping recovery blocks and d=δd=δd=δ, which exhibit both a strict improvement of the pure-code bound and simultaneous equality in the pure-code and general bounds; impure codes with disjoint recovery blocks attaining the general bound; and an existing family of pure codes with overlapping recovery blocks and d>δd>δd>δ, which simultaneously attains all these bounds.