Linear Programming Bounds on $k$ -Uniform States
IEEE Transactions on Information Theory · 2026-09 · 72 (9) · 6702-6714
DOI: 10.1109/tit.2026.3706667 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-09. Verfasst von Yu Ning und 3 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Gefördert von: Innovation Program for Quantum Science and Technology, National Natural Science Foundation of China, National Key Research and Development Programs of China.
Abstract (Originalsprache)
The existence of $k$ -uniform states has been a widely studied problem due to their applications in several quantum information tasks and their close relation to combinatorial objects like Latin squares and orthogonal arrays. With the machinery of quantum enumerators and linear programming, we establish several improved non-existence results and bounds on $k$ -uniform states. • First, for any fixed $l\geq 1$ and $q\geq 2$ , we show that there exists a constant $c$ such that $(\left \lfloor { n/2}\right \rfloor -l)$ -uniform states in $(\mathbb {C}^{q})^{\otimes n}$ do not exist when $n\geq cq^{2}+o(q^{2})$ . The constant $c$ equals 4 when $l=1$ and 6 when $l=2$ , which generalizes Scott’s bound (2004) for $l=0$ . • Second, when $n$ is sufficiently large, we show that there exists a constant $\theta \lt 1/2$ for each $q \le 9$ , such that $k$ -uniform states in $(\mathbb {C}^{q})^{\otimes n}$ exist only when $k\leq \theta n$ . In particular, this provides the first bound (to the best of our knowledge) of $k$ for $4\leq q\leq 9$ and confirms a conjecture posed by Shi et al. (2023) when $q=5$ in a stronger form. • Finally, with numerical methods, we improve the shadow bounds given by Shi et al. (2023) by a constant for $q = 3,4,5$ and small $n$ . When $q=4$ , our results can update some bounds listed in the code tables maintained by Grassl (2007–2024).
Förderung
- Innovation Program for Quantum Science and Technology
- National Natural Science Foundation of China
- National Key Research and Development Programs of China
- Quantum Science and Technology-National Science and Technology Major Project
- Basic and Applied Basic Research Foundation of Guangdong Province
- Hong Kong Research Grant Council
- Guangdong Provincial Quantum Science Strategic Initiative
Zitieren
APA
Ning, Y., Shi, F., Luo, T., & Zhang, X. (2026). Linear Programming Bounds on $k$ -Uniform States. IEEE Transactions on Information Theory, 72(9), 6702-6714. https://doi.org/10.1109/tit.2026.3706667
Vancouver
Ning Y, Shi F, Luo T, Zhang X. Linear Programming Bounds on $k$ -Uniform States. IEEE Transactions on Information Theory. 2026;72(9):6702-6714. doi:10.1109/tit.2026.3706667
BibTeX
@article{Ning2026,
author = {Ning, Yu and Shi, Fei and Luo, Tao and Zhang, Xiande},
title = {Linear Programming Bounds on $k$ -Uniform States},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {9},
pages = {6702--6714},
doi = {10.1109/tit.2026.3706667}
}
EUVIMED