pith. sign in

arxiv: 1108.0679 · v4 · pith:MG2U5F2Snew · submitted 2011-08-02 · 💻 cs.IT · math.CO· math.IT· quant-ph

A characterization of entanglement-assisted quantum low-density parity-check codes

classification 💻 cs.IT math.COmath.ITquant-ph
keywords codesquantumldpcebitsentanglement-assistedlow-densityparity-checkanalogues
0
0 comments X
read the original abstract

As in classical coding theory, quantum analogues of low-density parity-check (LDPC) codes have offered good error correction performance and low decoding complexity by employing the Calderbank-Shor-Steane (CSS) construction. However, special requirements in the quantum setting severely limit the structures such quantum codes can have. While the entanglement-assisted stabilizer formalism overcomes this limitation by exploiting maximally entangled states (ebits), excessive reliance on ebits is a substantial obstacle to implementation. This paper gives necessary and sufficient conditions for the existence of quantum LDPC codes which are obtainable from pairs of identical LDPC codes and consume only one ebit, and studies the spectrum of attainable code parameters.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.