Linear Programming Bounds for Approximate Quantum Error Correction over Arbitrary Quantum Channels

Yingkai Ouyang*, Ching Yi Lai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


While quantum weight enumerators establish some of the best upper bounds on the minimum distance of quantum error-correcting codes, these bounds are not optimized to quantify the performance of quantum codes under the effect of arbitrary quantum channels that describe bespoke noise models. Herein, for any Kraus decomposition of any given quantum channel, we introduce corresponding quantum weight enumerators that naturally generalize the Shor-Laflamme quantum weight enumerators. We establish an indirect linear relationship between these generalized quantum weight enumerators by introducing an auxiliary exact weight enumerator that completely quantifies the quantum code's projector, and is independent of the underlying noise process. By additionally working within the framework of approximate quantum error correction, we establish a general framework for constructing a linear program that is infeasible whenever approximate quantum error correcting codes with corresponding parameters do not exist. Our linear programming framework allows us to establish the non-existence of certain quantum codes that approximately correct amplitude damping errors, and obtain non-Trivial upper bounds on the maximum dimension of a broad family of permutation-invariant quantum codes.

Original languageEnglish
Pages (from-to)5234-5247
Number of pages14
JournalIEEE Transactions on Information Theory
Issue number8
StatePublished - 1 Aug 2022


  • error correction codes
  • linear programming
  • Quantum information science


Dive into the research topics of 'Linear Programming Bounds for Approximate Quantum Error Correction over Arbitrary Quantum Channels'. Together they form a unique fingerprint.

Cite this