Quick Navigation

Topics

Quantum Error Correction Fault Tolerance

QDistRnd: A GAP package for computing the distance of quantum error-correcting codes

arXiv
Authors: Leonid P. Pryadko, Vadim A. Shabashov, Valerii K. Kozin

Year

2023

Paper ID

55378

Status

Preprint

Abstract Read

~2 min

Abstract Words

150

Citations

N/A

Abstract

The GAP package QDistRnd implements a probabilistic algorithm for finding the minimum distance of a quantum low-density parity-check code linear over a finite field GF(q). At each step several codewords are randomly drawn from a distribution biased toward smaller weights. The corresponding weights are used to update the upper bound on the distance, which eventually converges to the minimum distance of the code. While there is no performance guarantee, an empirical convergence criterion is given to estimate the probability that a minimum weight codeword has been found. In addition, a format for storing matrices associated with q-ary quantum codes is introduced and implemented via the provided import/export functions. The format, MTXE, is based on the well established MaTrix market eXchange (MTX) Coordinate format developed at NIST, and is designed for full backward compatibility with this format. Thus, MTXE files are readable by any software package which supports MTX.

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #55378

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.