Answers are grounded in this paper and cite their sources.
We develop a scheme for fault-tolerant quantum computation based on asymmetric Bacon-Shor codes, which works effectively against highly biased noise dominated by dephasing. We find the optimal Bacon-Shor block size as a function of the noise strength and the noise bias, and estimate the logical error rate and overhead cost achieved by this optimal code. Our fault-tolerant gadgets, based on gate teleportation, are well suited for hardware platforms with geometrically local gates in two dimensions.
No takes yet. Share an insight, caveat, or question.
Brooks et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: