Analytic asymptotic performance of topological codes

TL;DR

This paper introduces an analytical method to estimate the low-error-rate performance of topological quantum error correction codes, significantly reducing computational effort compared to traditional simulations.

Contribution

The authors develop a general analytical approach for evaluating the low error-rate performance of topological codes, applicable to various circuits and error models.

Findings

Analytical expressions can be computed in seconds.

Method handles arbitrary periodic quantum circuits.

Significantly faster than traditional simulation methods.

Abstract

Topological quantum error correction codes are extremely practical, typically requiring only a 2-D lattice of qubits with tunable nearest neighbor interactions yet tolerating high physical error rates p. It is computationally expensive to simulate the performance of such codes at low p, yet this is a regime we wish to study as low physical error rates lead to low qubit overhead. We present a very general method of analytically estimating the low p performance of the most promising class of topological codes. Our method can handle arbitrary periodic quantum circuits implementing the error detection associated with this class of codes, and arbitrary Pauli error models for each type of quantum gate. Our analytic expressions take only seconds to obtain, versus hundreds of hours to perform equivalent low p simulations.