The strengthened quantum Hamming bound of Yu, Lai, and Oh
Abstract
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≥2, not necessarily a prime power, every integer t≥1, both distances 2t+1 and 2t+2, and every interpolation parameter e∈{0,…,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≥2 and every quantum code of length n, dimension K>1 and distance d≥3, we prove Kf(0)≤ pn𝔼 f(X), where X∼Bin(n,1−p−2), for every real polynomial f of degree less than d that is nonnegative on {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.
Related
- The Quantum Hamming Bound in Arbitrary Local Dimension
- Exact quantum Hamming-weight computation at optimal depth and minimum width
- Extremely slow scaling of minimal Hamming distance in quantum sampling data
- Strong quantum interaction between excitons bound by cavity photon exchange
- No cosmic horizons from a strengthened higher-dimensional strong energy condition
BibTeX
@misc{valery2026strengthened,
title = {{The strengthened quantum Hamming bound of Yu, Lai, and Oh}},
author = {Valery and Grishin and Aryeh Lev Zabokritskiy},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.30088},
eprint = {2610.30088},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.30088},
}
RIS
TY - UNPB
TI - The strengthened quantum Hamming bound of Yu, Lai, and Oh
AU - Valery
AU - Grishin
AU - Aryeh Lev Zabokritskiy
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2610.30088
UR - https://arxiv.org/abs/2610.30088
AB - 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≥2, not necessarily a prime power, every integer t≥1, both distances 2t+1 and 2t+2, and every interpolation parameter e∈{0,…,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≥2 and every quantum code of length n, dimension K>1 and distance d≥3, we prove Kf(0)≤ p^n𝔼 f(X), where X∼Bin(n,1−p^−2), for every real polynomial f of degree less than d that is nonnegative on {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.
ER -