Achieving fault tolerance on capped color codes with few ancillas
Theerapat Tansuwannont, Debbie Leung

TL;DR
This paper introduces a new fault-tolerance approach for capped color codes using minimal ancillas, leveraging weight parities and distinguishable fault sets to enable universal quantum computation with low overhead.
Contribution
It extends weight parity techniques to capped color codes, develops fault-tolerant protocols with only two ancillas, and generalizes fault-tolerant gadget definitions.
Findings
Protocols require only 2 ancillas for any code distance.
Fault-tolerant Clifford and universal quantum computation are achieved.
Enhanced error detection and correction using distinguishable fault sets.
Abstract
Attaining fault tolerance while maintaining low overhead is one of the main challenges in a practical implementation of quantum circuits. One major technique that can overcome this problem is the flag technique, in which high-weight errors arising from a few faults can be detected by a few ancillas and distinguished using subsequent syndrome measurements. The technique can be further improved using the fact that for some families of codes, errors of any weight are logically equivalent if they have the same syndrome and weight parity, as previously shown in [Phys. Rev. A 104, 042410 (2021)]. In this work, we develop a notion of distinguishable fault set which captures both concepts of flags and weight parities, and extend the use of weight parities in error correction from [Phys. Rev. A 104, 042410 (2021)] to families of capped and recursive capped color codes. We also develop…
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.
