On the Cleaning Lemma of Quantum Coding Theory

DOI10.1016/J.LAA.2022.05.002MaRDI QIDQ6396136arXivWikidataFDO

Authors G. V. Kalachev, Sergey Yu. Sadov

Publication date 10 April 2022

Mathematics Subject Classification ID

Modular lattices, complemented lattices (06C99) Vector spaces, linear dependence, rank, lineability (15A03) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Abstract: The term "Cleaning Lemma" refers to a family of similar propositions that have been used in Quantum Coding Theory to estimate the minimum distance of a code in terms of its length and dimension. We show that the mathematical core is a simple fact of linear algebra of inner product spaces; moreover, it admits a further reduction to a combinatorial, lattice-theoretical level. Several concrete variants of the Cleaning Lemma and some additional propositions are derived as corollaries of the proposed approach.

This page was built for publication: On the Cleaning Lemma of Quantum Coding Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6396136)