pith. sign in

arxiv: 1801.01879 · v2 · pith:XQHTL5YDnew · submitted 2018-01-05 · 🪐 quant-ph

Linear-time general decoding algorithm for the surface code

classification 🪐 quant-ph
keywords noisealgorithmaccountcodedecoderfeaturesgeneralincluding
0
0 comments X
read the original abstract

A quantum error correcting protocol can be substantially improved by taking into account features of the physical noise process. We present an efficient decoder for the surface code which can account for general noise features, including coherences and correlations. We demonstrate that the decoder significantly outperforms the conventional matching algorithm on a variety of noise models, including non-Pauli noise and spatially correlated noise. The algorithm is based on an approximate calculation of the logical channel using a tensor-network description of the noisy state.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Mixed-state topological order and the errorfield double formulation of decoherence-induced transitions

    quant-ph 2023-01 unverdicted novelty 6.0

    Decoherence on abelian topological order is modeled as a temporal defect in double TQFT driving boundary anyon condensation transitions classified by Lagrangian subgroups of the doubled order.