| Performance of Entanglement-assisted Quantum LDPC Codes Constructed From Finite Geometries (2009) | |||||||||
Abstract | |||||||||
| We investigate the performance of entanglement-assisted quantum low-density parity-check (LDPC) codes constructed from finite geometries. Though the entanglement-assisted formalism provides a universal connection between a classical linear quaternary code and an entanglement-assisted quantum error-correcting code (EAQECC), the issue of maintaining large amount of pure maximally entangled states in constructing EAQECCs is a practical obstacle to its use. We provide families of EAQECCs with an entanglement consumption rate that decreases exponentially. Surprisingly, these EAQECCs outperform those codes constructed in [1].. Comment: 7 pages, 2 figures | |||||||||
Publication details | |||||||||
| |||||||||