English

Optimal Bacon-Shor codes

Quantum Physics 2013-02-12 v1

Abstract

We study the performance of Bacon-Shor codes, quantum subsystem codes which are well suited for applications to fault-tolerant quantum memory because the error syndrome can be extracted by performing two-qubit measurements. Assuming independent noise, we find the optimal block size in terms of the bit-flip error probability p_X and the phase error probability p_Z, and determine how the probability of a logical error depends on p_X and p_Z. We show that a single Bacon-Shor code block, used by itself without concatenation, can provide very effective protection against logical errors if the noise is highly biased (p_Z / p_X >> 1) and the physical error rate p_Z is a few percent or below. We also derive an upper bound on the logical error rate for the case where the syndrome data is noisy.

Keywords

Cite

@article{arxiv.1209.0794,
  title  = {Optimal Bacon-Shor codes},
  author = {John Napp and John Preskill},
  journal= {arXiv preprint arXiv:1209.0794},
  year   = {2013}
}

Comments

21 pages, 6 figures

R2 v1 2026-06-21T21:59:50.610Z