Quantum LDPC codes with positive rate and minimum distance proportional to n

The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed non-zero rate is logarithmic in the block length. We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the block length.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Tillich, J.-P., Zemor, G.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computer displays Computer errors Computer Science Decoding Delay effects Error correction codes Fault diagnosis Information Theory Mathematics Parity check codes Physics Protection Quantum computing Quantum mechanics Quantum Physics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed non-zero rate is logarithmic in the block length. We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the block length.
ISSN:	2157-8095 2157-8117
DOI:	10.1109/ISIT.2009.5205648