2000 character limit reached
A simple decoder for topological codes
Published 9 Oct 2013 in quant-ph | (1310.2393v4)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
