6 papers
On the Smallest Eigenvalues and Quantum Chromatic Numbers of Hamming Graphs and Generalizations
Yu Ning, Jack H. Koolen, Xiande Zhang
The smallest eigenvalues of (distance-j) Hamming graphs with distance parameter j at least half the length were completely determined by Brouwer et al. (2018). In the present work,…
Quantum Chromatic Number of Subgraphs of Orthogonality Graphs and the Distance-2 Hamming Graph
Tao Luo, Yu Ning, Xiande Zhang
The determination of the quantum chromatic number of graphs has attracted considerable attention recently. However, there are few families of graphs whose quantum chromatic numbers…
On subcodes of the generalized Reed-Solomon codes
Yu Ning
In this paper, we study a class of subcodes of codimension in the generalized Reed-Solomon (GRS) codes, whose generator matrix is derived by removing the row of deg…
Linear Programming Bounds on -Uniform States
Yu Ning, Fei Shi, Tao Luo +1
The existence of -uniform states has been a widely studied problem due to their applications in several quantum information tasks and their close relation to combinatorial objec…
Bounds on -Uniform Quantum States
Fei Shi, Yu Ning, Qi Zhao +1
Do -partite -uniform states always exist when ? In this work, we provide new upper bounds on the parameter for the existence of -uni…
A Study on Nice Open Covers in Constructive Analysis
Tong Cheng, Zhihan Gao, Yuxin Ma +2
Mathematicians like Markov and Bishop made an effort to develop constructive mathematics and extended many theorems in classical mathematical analysis. Heine Borel theorem tells us…