Flag fault-tolerant error correction, measurement, and quantum computation for cyclic CSS codes
arXiv:1803.09758 · doi:10.1103/PhysRevA.101.012342
Abstract
Flag qubits have recently been proposed in syndrome extraction circuits to detect high-weight errors arising from fewer faults. The use of flag qubits allows the construction of fault-tolerant protocols with the fewest number of ancillas known to-date. In this work, we prove some critical properties of CSS codes constructed from classical cyclic codes that enable the construction of a flag fault-tolerant error correction scheme. We then develop fault-tolerant protocols as well as a family of circuits for flag fault-tolerant error correction and operator measurement, requiring only four ancilla qubits and applicable to cyclic CSS codes of distance 3. The measurement protocol can be further used for logical Clifford gate implementation via quantum gate teleportation. We also provide examples of cyclic CSS codes with large encoding rates.
arXiv comment17 pages, 7 figures, Comments welcome. V2: added operator measurement protocol and applications. V3: simpler proofs, minor correction
References in corpus (22)
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Quantum Teleportation is a Universal Computational Primitive
- Topological quantum memory
- Multiple Particle Interference and Quantum Error Correction
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Reliable Quantum Computers
- A Theory of Fault-Tolerant Quantum Computation
- Fault-tolerant quantum computation with high threshold in two dimensions
- Quantum Error Correction and Orthogonal Geometry
- Restrictions on Transversal Encoded Quantum Gate Sets
- Low-distance Surface Codes under Realistic Quantum Noise
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Quantum error correction with only two extra qubits
- Flag fault-tolerant error correction with arbitrary distance codes
- Fault-tolerant quantum computation with few qubits
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Fault-tolerant magic state preparation with flag qubits
- Fault-tolerant preparation of approximate GKP states
- Overhead analysis of universal concatenated quantum codes
- Topological code Autotune
- Error rates and resource overheads of encoded three-qubit gates
Cited by in corpus (20)
- Flag fault-tolerant error correction for any stabilizer code
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Low overhead fault-tolerant quantum error correction with the surface-GKP code
- Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
- Neural network decoder for topological color codes with circuit level noise
- A circuit-level protocol and analysis for twist-based lattice surgery
- Adaptive syndrome measurements for Shor-style error correction
- Achieving fault tolerance on capped color codes with few ancillas
- Un-Weyl-ing the Clifford Hierarchy
- Fault-tolerant quantum error correction using error weight parities
- Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
- Parallel syndrome extraction with shared flag qubits for Calderbank-Shor-Steane codes of distance three
- Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization
- Low-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes
- Optimization tools for distance-preserving flag fault-tolerant error correction
- Concatenated Steane code with single-flag syndrome checks
- Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
- Classical Coding Approaches to Quantum Applications
- Quantum Bicyclic Hyperbolic Codes
- Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code