Performance of quantum error correction with coherent errors
Eric Huang, Andrew C. Doherty, and Steven Flammia

TL;DR
This paper analyzes how quantum error correction performs under coherent unitary errors compared to dephasing noise, showing that correction is more effective for unitary errors and establishing a general bound on code performance.
Contribution
It provides an analytical comparison of error correction effectiveness for unitary versus dephasing errors and proves a general performance bound for stabilizer codes under unitary noise.
Findings
Error correction is more effective for unitary errors than dephasing when measured by diamond norm.
A general bound shows logical error scales as a power of physical error, favoring unitary errors.
The results hold across multiple codes, including repetition, Steane, Shor, and surface codes.
Abstract
We compare the performance of quantum error correcting codes when memory errors are unitary with the more familiar case of dephasing noise. For a wide range of codes we analytically compute the effective logical channel that results when the error correction steps are performed noiselessly. Our examples include the entire family of repetition codes, the 5-qubit, Steane, Shor, and surface codes. When errors are measured in terms of the diamond norm, we find that the error correction is typically much more effective for unitary errors than for dephasing. We observe this behavior for a wide range of codes after a single level of encoding, and in the thresholds of concatenated codes using hard decoders. We show that this holds with great generality by proving a bound on the performance of any stabilizer code when the noise at the physical level is unitary. By comparing the diamond norm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
