Answers are grounded in this paper and cite their sources.
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to scalable quantum computation applicable to degenerate quantum codes with sublinear distance scaling. We give explicit analytic expressions combining probabilities of erasures, depolarizing errors, and phenomenological syndrome measurement errors for quantum low-density parity-check codes with logarithmic or larger distances. These threshold estimates are parametrically better than the existing analytical bound based on percolation.
No takes yet. Share an insight, caveat, or question.
Dumer et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: