Performance Analysis of Quantum Error-Correcting Surface Codes over Asymmetric Channels

TL;DR

This paper evaluates the performance of surface codes in quantum error correction over symmetric and asymmetric channels, providing analytical formulas and simulation results to assess their effectiveness in quantum computing.

Contribution

It introduces approximate analytical expressions for surface code performance on asymmetric channels, validated by simulations, enhancing understanding of their practical robustness.

Findings

Surface codes' performance can be characterized analytically.

Asymmetric channels impact error correction efficiency.

Surface codes outperform uncoded systems under certain conditions.

Abstract

One of the main challenge for an efficient implementation of quantum information technologies is how to counteract quantum noise. Quantum error correcting codes are therefore of primary interest for the evolution towards quantum computing and quantum Internet. We here analyze the performance of surface codes, one of the most important class for practical implementations, on both symmetric and asymmetric quantum channels. We derive approximate expressions, confirmed by simulations, to evaluate the performance of surface codes and of XZZX codes, and provide a metric to assess the advantage of codes with respect to uncoded systems. Our findings allow to characterize the performance by means of analytical formulas of surface codes, like, for example, the [[13, 1, 3]], the [[23, 1, 3/5]], the [[33, 1, 3/7]], and the [[41, 1, 5]] surface codes.