2000 character limit reached
Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
Published 4 Mar 2017 in quant-ph, cs.IT, and math.IT | (1703.01517v1)
Abstract: Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to have at our disposal a fast decoding algorithm to quickly identify and correct errors as soon as they occur. We propose a linear-time maximum likelihood decoder for surface codes over the quantum erasure channel. This decoding algorithm for dealing with qubit loss is optimal both in terms of performance and speed.
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.