On the iterative decoding of sparse quantum codes

Simple item page
dc.creatorPoulin, David
dc.creatorChung, Yeojin
dc.date2008-01-08
dc.date2008-07-01
dc.date.accessioned2026-07-07T10:02:38Z
dc.date.available2026-07-07T10:02:38Z
dc.descriptionWe address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however. Firstly, their Tanner graph unavoidably contain small loops which typically undermines the performance of belief propagation. Secondly, sparse quantum codes are by definition highly degenerate. The standard belief propagation algorithm does not exploit this feature, but rather it is impaired by it. We propose heuristic methods to improve belief propagation decoding, specifically targeted at these two problems. While our results exhibit a clear improvement due to the proposed heuristic methods, they also indicate that the main source of errors in the quantum coding scheme remains in the decoding.
dc.descriptionTo appear in QIC
dc.identifierhttps://arxiv.org/abs/0801.1241
dc.identifierhttp://arxiv.org/abs/0801.1241
dc.identifierQIC Vol.8 No.10 p.987 (2008)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169044
dc.subjectQuantum Physics
dc.titleOn the iterative decoding of sparse quantum codes
dc.typetext

Files

Collections

arXiv