arXiv:1310.2393 [quant-ph]AbstractReferencesReviewsResources
A simple decoder for topological codes
Published 2013-10-09, updated 2015-04-09Version 4
Here we study an efficient algorithm for decoding the topological codes. It is based on a simple principle, which should allow straightforward generalization to complex decoding problems. It is benchmarked with the planar code for both i.i.d. and spatially correlated errors and is found to compare well with existing methods.
Comments: v3: Corrected error and added data for correlated errors. v4: Added data for improved version of decoder. This is the published version
DOI: 10.3390/e17041946
Categories: quant-ph
Keywords: topological codes, simple decoder, efficient algorithm, simple principle, complex decoding problems
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1504.01444 [quant-ph] (Published 2015-04-07)
Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
Efficient Algorithm for Perturbative Calculation of Multiloop Feynman Integrals
Strong Resilience of Topological Codes to Depolarization