Fowler-Mariantoni-Martinis-Cleland 2012 / Wang-Fowler-Hollenberg 2011 analysis: a distance-d surface code corrects ⌊(d−1)/2⌋ errors and — below threshold — has logical error rate per round p_L(d, p) ≈ A·(p/p_th)^((d+1)/2) where A is a…
Fowler-Mariantoni-Martinis-Cleland 2012 / Wang-Fowler-Hollenberg 2011 analysis: a distance-d surface code corrects ⌊(d−1)/2⌋ errors and — below threshold — has logical error rate per round p_L(d, p) ≈ A·(p/p_th)^((d+1)/2) where A is a…