Achieving fault tolerance on capped color codes with few ancillas

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 fault-tolerant protocols for error correction, measurement, state preparation, and logical T gate implementation via code switching, which are sufficient for performing fault-tolerant Clifford computation on a capped color code, and performing fault-tolerant universal quantum computation on a recursive capped color code. Our protocols for a capped or a recursive capped color code of any distance require only 2 ancillas, assuming that the ancillas can be reused. The concept of distinguishable fault set also leads to a generalization of the definitions of fault-tolerant gadgets proposed by Aliferis, Gottesman, and Preskill.

47 pages, 16 figures, comments welcome. V2 & V3: Minor revision. V4: Adding recursive capped color codes, circuits for a capped or a recursive capped color code of any distance, fault-tolerant protocol for T gate implementation, and code comparison

References in corpus (16)

• Surface codes: Towards practical large-scale quantum computation
• Topological Quantum Distillation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Effective fault-tolerant quantum computation with slow measurements
• Universal transversal gates with color codes - a simplified approach
• Fault-tolerant logical gates in quantum error-correcting codes
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Simple proof of fault tolerance in the graph-state model
• Optimization of the surface code design for Majorana-based qubits
• Extended flag gadgets for low-overhead circuit verification
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits
• Error rates and resource overheads of encoded three-qubit gates
• Fault-tolerant quantum error correction using error weight parities

Cited by in corpus (3)

• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Adaptive syndrome measurements for Shor-style error correction
• Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories