Linear programming bounds for entanglement-assisted quantum codes


In this paper, we define two split weight enumerators for general quantum codes with entanglement assistance, including nonadditive codes. We show that they obey a MacWilliams identity, which allows us to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. On the other hand, we… (More)
DOI: 10.1109/ISIT.2017.8007120


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics