A characterization of entanglement-assisted quantum low-density parity-check codes
arXiv:1108.0679 · doi:10.1109/TIT.2013.2247461
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.
arXiv comment7 pages, no figures, final accepted version for publication in the IEEE Transactions on Information Theory
References in corpus (13)
- Good Quantum Error-Correcting Codes Exist
- Correcting Quantum Errors with Entanglement
- Sparse Graph Codes for Quantum Error-Correction
- Optimal Entanglement Formulas for Entanglement-Assisted Quantum Coding
- Asymmetric quantum error correcting codes
- General entanglement-assisted quantum error-correcting codes
- Entanglement-Assisted Quantum Quasi-Cyclic Low-Density Parity-Check Codes
- High performance entanglement-assisted quantum LDPC codes need little entanglement
- Entanglement-assisted quantum low-density parity-check codes
- A Class of Quantum LDPC Codes Constructed From Finite Geometries
- Quantum Error Correction beyond the Bounded Distance Decoding Limit
- On the logical operators of quantum codes
- A combinatorial approach to X-tolerant compaction circuits
Cited by in corpus (7)
- Catalytic quantum error correction
- Entanglement-assisted concatenated quantum codes
- Quantum error correction via less noisy qubits
- High-rate quantum low-density parity-check codes assisted by reliable qubits
- Error Correction for Reliable Quantum Computing
- Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q + 1
- Even-freeness of cyclic 2-designs