2009/07/22 by Zhuo Li, Li, Zhuo, Lijuan Xing +1
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum and electron transport phenomena #quant-ph
paper · pdf · doi:10.48550/arxiv.0907.3802
3 pages, no figure
arxiv created 2009/07/22 · openalex publication_date 2009/07/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 threshold such that an arbitrary quantum code must obey the quantum Hamming bound whenever . We list some values of for small d and binary quantum codes.