Numerical Techniques for Finding the Distances of Quantum Codes
From MaRDI portal
Publication:6251207
arXiv1405.0348MaRDI QIDQ6251207
Author name not available (Why is that?)
Publication date: 2 May 2014
Abstract: We survey the existing techniques for calculating code distances of classical codes and apply these techniques to generic quantum codes. For classical and quantum LDPC codes, we also present a new linked-cluster technique. It reduces complexity exponent of all existing deterministic techniques designed for codes with small relative distances (which include all known families of quantum LDPC codes), and also surpasses the probabilistic technique for sufficiently high code rates.
Has companion code repository: https://github.com/WeileiZeng/Random-Window-Decoder
This page was built for publication: Numerical Techniques for Finding the Distances of Quantum Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6251207)