On the Cleaning Lemma of Quantum Coding Theory
arXiv:2204.04699 · doi:10.1016/j.laa.2022.05.002
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.
arXiv comment25pp
References in corpus (7)
- Exotic topological order in fractal spin liquids
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- Tradeoffs for reliable quantum information storage in 2D systems
- Balanced Product Quantum Codes
- Algebraic Methods for Quantum Codes on Lattices
- Logical operator tradeoff for local quantum codes
- Connectivity constrains quantum codes