A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes
From MaRDI portal
Publication:2989178
DOI10.1109/TIT.2013.2247461zbMATH Open1364.81090arXiv1108.0679MaRDI QIDQ2989178FDOQ2989178
Authors: Yuichiro Fujiwara, Vladimir D. Tonchev 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1108.0679
Cited In (8)
- On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound
- Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes
- A construction of quantum turbo product codes based on CSS-type quantum convolutional codes
- Dualities and identities for entanglement-assisted quantum codes
- A class of quantum low-density parity check codes by combining seed graphs
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities
- Review of image fusion based on pulse-coupled neural network
This page was built for publication: A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989178)
