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:2208.11800 · IEEE BITS the Information Theory Magazine

No $((n,K,d< 127))$ Code Can Violate the Quantum Hamming Bound

Emanuel Dallas, Faidon Andreadakis, Daniel A. Lidar

Published Dec 1, 2022• 5 citations
arXivHTMLPDF

Abstract

It is well-known that non-degenerate quantum error correcting codes (QECCs) are constrained by a quantum version of the Hamming bound. Whether degenerate codes also obey such a bound, however, remains a long-standing question with practical implications for the efficacy of QECCs. We employ a combination of previously derived bounds on QECCs to demonstrate that a subset of all codes must obey the quantum Hamming bound. Specifically, we combine an analytical bound due to Rains with a numerical bound due to Li and Xing to show that no$((n,K,d))$code with$d< 127$can violate the quantum Hamming bound.

DOI
10.1109/mbits.2023.3262219

Related papers

Degenerate quantum codes and the quantum Hamming bound

Pradeep Kiran Sarvepalli, Andreas Klappenecker

The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum codes. In this article we show that Calderbank-Shor-Steane (CSS) codes, over a prime power alphabet $q\ensuremath{\geqslant}5$, cannot beat the quantum Hamming bound. We prove a quantum version of the Griesmer bound for the CSS codes, which allows us to strengthen the Rains' bound that an $[[n,k,d]{]}_{2}$ code cannot correct more than $\ensuremath{\lfloor}(n+1)/6\ensuremath{\rfloor}$ errors to $\ensuremath{\lfloor}(n\ensuremath{-}k+1)/6\ensuremath{\rfloor}$. Additionally, we also show that any $[[n,k,d]{]}_{q}$ quantum code with $k+d\ensuremath{\leqslant}(1\ensuremath{-}2{\mathit{eq}}^{\ensuremath{-}2})n$ cannot beat the quantum Hamming bound.

arXiv:0812.2674•Physical Review A•Mar 19, 2010•24 citations

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•3 citations

Entanglement-assisted quantum codes achieving the quantum singleton bound but violating the quantum hamming bound

Ruihu Li, Luobin Guo, Zongben Xu

We give an infinite family of degenerate entanglement-assisted quantum error-correcting codes (EAQECCs) which violate the EA-quantum Hamming bound for non-degenerate EAQECCs and achieve the EA-quantum Singleton bound, thereby proving that the EA-quantum Hamming bound does not asymptotically hold for degenerate EAQECCs. Unlike the previously known quantum error-correcting codes that violate the quantum Hamming bound by exploiting maximally entangled pairs of qubits, our codes do not require local unitary operations on the entangled auxiliary qubits during encoding. The degenerate EAQECCs we present are constructed from classical error-correcting codes with poor minimum distances, which implies that, unlike the majority of known EAQECCs with large minimum distances, our EAQECCs take more advantage of degeneracy and rely less on the error correction capabilities of classical codes.

Quantum Information and Computation•Oct 1, 2014•13 citations

On a Problem Concerning the Quantum Hamming Bound for Impure Quantum Codes

Zhuo Li, Lijuan Xing

A famous open problem in the theory of quantum error-correcting codes is whether or not the parameters of an impure quantum code can violate the quantum Hamming bound for pure quantum codes. We partially solve this problem. We demonstrate that there exists a thresholdN(d,m) such that an arbitrary((n,K,d))mquantum code must obey the quantum Hamming bound whenevern≥N(d,m). We list some values ofN(d,m) for smalldand binary quantum codes.

arXiv:0907.3802•IEEE Transactions on Information Theory•Aug 19, 2010•13 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•5 citations

The Quantum Hamming Bound in Arbitrary Local Dimension

Yu-Xuan Zhang, Jing-Ling Chen

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.

quant-pharXiv:2606.22538•Jun 23, 2026•2 citations
No ((n,K,d<127))((n,K,d< 127))((n,K,d<127)) Code Can Violate the Quantum Hamming Bound
It is well-known that non-degenerate quantum error correcting codes (QECCs) are constrained by a quantum version of the Hamming bound. Whether degenerate codes also obey such a bound, however, remains a long-standing question with practical implications for the efficacy of QECCs. We employ a combination of previously derived bounds on QECCs to demonstrate that a subset of all codes must obey the quantum Hamming bound. Specifically, we combine an analytical bound due to Rains with a numerical bound due to Li and Xing to show that no((n,K,d))((n,K,d))((n,K,d))code withd<127d< 127d<127can violate the quantum Hamming bound.
The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum codes. In this article we show that Calderbank-Shor-Steane (CSS) codes, over a prime power alphabet $q\ensuremath{\geqslant}5$, cannot beat the quantum Hamming bound. We prove a quantum version of the Griesmer bound for the CSS codes, which allows us to strengthen the Rains' bound that an [[n,k,d]]2[[n,k,d]{]}_{2}[[n,k,d]]2​ code cannot correct more than $\ensuremath{\lfloor}(n+1)/6\ensuremath{\rfloor}$ errors to $\ensuremath{\lfloor}(n\ensuremath{-}k+1)/6\ensuremath{\rfloor}$. Additionally, we also show that any [[n,k,d]]q[[n,k,d]{]}_{q}[[n,k,d]]q​ quantum code with $k+d\ensuremath{\leqslant}(1\ensuremath{-}2{\mathit{eq}}^{\ensuremath{-}2})n$ cannot beat the quantum Hamming bound.
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 give an infinite family of degenerate entanglement-assisted quantum error-correcting codes (EAQECCs) which violate the EA-quantum Hamming bound for non-degenerate EAQECCs and achieve the EA-quantum Singleton bound, thereby proving that the EA-quantum Hamming bound does not asymptotically hold for degenerate EAQECCs. Unlike the previously known quantum error-correcting codes that violate the quantum Hamming bound by exploiting maximally entangled pairs of qubits, our codes do not require local unitary operations on the entangled auxiliary qubits during encoding. The degenerate EAQECCs we present are constructed from classical error-correcting codes with poor minimum distances, which implies that, unlike the majority of known EAQECCs with large minimum distances, our EAQECCs take more advantage of degeneracy and rely less on the error correction capabilities of classical codes.
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.
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.