How do topological quantum error-correcting codes fare under non-Markovian noise

We simulate the performance of toplogical error-correcting codes when all the encoding qubits share same non-Markovian bath. We find that scalable and reliable quantum computing may still be possible if error-rates decline as $\sqrt{n}$ where $n$ is the codeword size.