Quantum LDPC codes with positive rate and minimum distance proportional to n^{1-2} - Computer Science > Information TheoryReportar como inadecuado




Quantum LDPC codes with positive rate and minimum distance proportional to n^{1-2} - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The current best asymptotic lower bound on the minimum distance of quantumLDPC codes with fixed non-zero rate is logarithmic in the blocklength. Wepropose a construction of quantum LDPC codes with fixed non-zero rate and provethat the minimum distance grows proportionally to the square root of theblocklength.



Autor: Jean-Pierre Tillich, Gilles Zemor

Fuente: https://arxiv.org/







Documentos relacionados