Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators

Abstract:Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive codes, by considering a type of split weight enumerators. After deriving the MacWilliams identities for these split weight enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. In particular, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of small quantum codes. In particular, we show that there is no [[27,15,5]] or [[28,14,6]] quantum stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.

18 pages, 5 figures, 2 tables. The ([[14,3,10;11]]) code was mistakenly ruled out in the previous version. An explicit construction of such a code was later given in arXiv:2301.00945

Information Theory (cs.IT); Quantum Physics (quant-ph)

arXiv:1602.00413 [cs.IT]

(or arXiv:1602.00413v4 [cs.IT] for this version)

IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 622-639, Jan. 2018

https://doi.org/10.1109/TIT.2017.2711601 DOI(s) linking to related resources