Quantum Information and Computation · 2008 · 143 citations · 40 references
EngineeringComputer SciencePhysicsInformation TheoryQuantum ComputingQuantum MechanicsChannel CodingCoding TheoryError-correcting CodesQuantum CommunicationQuantum ComputationQuantum Information TheoryBelief PropagationBelief Propagation DecodingChannelsError Correction CodesIterative DecodingQuantum Channel CodingQuantum Error CorrectionQuantum Error-correcting Codes
We 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.
40
Fault-tolerant quantum computation by anyons
Alexei Kitaev · Annals of Physics · 2003 · 7.3K citations · Full text
Computing, Computer Science, Physics +12
Information theory, inference, and learning algorithms
Choice Reviews Online · 2004 · 6.6K citations
Mixed-state entanglement and quantum error correction
Charles H. Bennett, David P. DiVincenzo, John A. Smolin et al. · Physical Review A · 1996 · 5.4K citations · Full text
Scheme for reducing decoherence in quantum computer memory
Peter W. Shor · Physical Review A · 1995 · 4.5K citations
Computing, Computer Science, Physics +13