Entanglement-assisted quantum low-density parity-check codes

DOI10.1103/PHYSREVA.82.042338MaRDI QIDQ6220412zbMATH OpenFDO

Authors Yuichiro Fujiwara, David Clark, P. Vandendriessche, Maarten De Boeck, Vladimir D. Tonchev

Publication date 27 August 2010

Full work available at URL https://doi.org/10.1103/PHYSREVA.82.042338

Mathematics Subject Classification ID

Finite geometry and special incidence structures (51Exx) Theory of error-correcting codes and error-detecting codes (94Bxx)

Abstract: This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes (EAQECCs) with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error correction performance, high rates, and low decoding complexity. The proposed method produces infinitely many new codes with a wide variety of parameters and entanglement requirements. Our framework encompasses various codes including the previously known entanglement-assisted quantum LDPC codes having the best error correction performance and many new codes with better block error rates in simulations over the depolarizing channel. We also determine important parameters of several well-known classes of quantum and classical LDPC codes for previously unsettled cases.

This page was built for publication: 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 Q6220412)