Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code

Sergey Bravyi, Martin Suchara, Alexander Vargo · 2014 · Phys. Rev. A 90, 032326

| 编号 QE247 | 主题 译码算法 | 链接 arXiv:1405.4883 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the 2D surface code with a noiseless syndrome extraction. First, MLD can be implemented exactly in time O(n^2) using a reduction to simulation of matchgate quantum circuits for independent bit-flip and phase-flip errors. Secondly, MLD can be implemented approximately for more general noise models using matrix product states, with running time O(n chi^3). For depolarizing noise the MPS-based decoder is far superior to the minimum weight matching decoder offering more than two orders of magnitude reduction of the logical error probability.

本站词条在引用该文献时，会以 wikilink（sources/QE247）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。