A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory

DOI10.1016/j.laa.2022.05.002OpenAlexW4229043471WikidataQ114151559 ScholiaQ114151559MaRDI QIDQ2151565

G. V. Kalachev, Sergey Yu. Sadov

Publication date: 5 July 2022

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2022.05.002

zbMATH Keywords

modular latticeorthogonal spacequantum error correctionlattice of subspacesorder-reversing involutionstabilizer codes

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum error correction. Symmetric, asymmetric, synchronizable, and convolutional codes
• Galois theory.
• A quantum computing primer for operator theorists
• Building manifolds from quantum codes
• Algebraic Methods for Quantum Codes on Lattices
• Quantum LDPC Codes With Almost Linear Minimum Distance
• Balanced Product Quantum Codes
• Homological product codes
• Fiber bundle codes: breaking the n ^1/2 polylog( n ) barrier for Quantum LDPC codes

This page was built for publication: A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory