Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code

Alexey A. Kovalev; Ilya Dumer; Leonid P. Pryadko

arxiv: 1302.1845 · v1 · pith:UPOYNDNZnew · submitted 2013-02-07 · 🪐 quant-ph · cs.IT· math.IT

Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code

Alexey A. Kovalev , Ilya Dumer , Leonid P. Pryadko This is my paper

classification 🪐 quant-ph cs.ITmath.IT

keywords codesldpcquantumtechniquecodedistancelinked-clusteradvantage

0 comments

read the original abstract

We present a linked-cluster technique for calculating the distance of a quantum LDPC code. It offers an advantage over existing deterministic techniques for codes with small relative distances (which includes all known families of quantum LDPC codes), and over the probabilistic technique for codes with sufficiently high rates.

This paper has not been read by Pith yet.

Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code

discussion (0)