High threshold error correction for the surface code

TL;DR

This paper introduces a new error correction algorithm for surface code quantum memory that achieves a high threshold error rate of 18.5%, improving upon previous methods and enabling efficient correction for realistic code sizes.

Contribution

The paper presents a novel error correction algorithm for the surface code that surpasses previous threshold rates and maintains polynomial time complexity.

Findings

Threshold error rate of 18.5% for depolarizing noise

Algorithm's polynomial time complexity

Close to the theoretical upper bound of 18.9%

Abstract

An algorithm is presented for error correction in the surface code quantum memory. This is shown to correct depolarizing noise up to a threshold error rate of 18.5%, exceeding previous results and coming close to the upper bound of 18.9%. The time complexity of the algorithm is found to be polynomial with error suppression, allowing efficient error correction for codes of realistic sizes.