1202.5602 (Austin G. Fowler et al.)

Towards practical classical processing for the surface code: timing
analysis    [PDF]

Austin G. Fowler, Adam C. Whiteside, Lloyd C. L. Hollenberg

We perform a timing analysis of our current implementation of the algorithm described in arXiv:1110.5133. Our implementation performs the classical processing associated with an nxn lattice of qubits realizing a square surface code storing a single logical qubit of information in a fault-tolerant manner. We empirically demonstrate that our implementation requires only O(n^2) average time per round of error correction for code distances ranging from 4 to 512 and a range of depolarizing error rates. We also describe tests we have performed to verify that it always obtains a true minimum weight perfect matching.

View original: http://arxiv.org/abs/1202.5602