Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics

Abstract

We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for instance it does not require active error correction and results in a reduced error-correction overhead when error diagnostics is much slower than the gate time. In addition, we adapt our protocol to cases where the underlying error correction strategy chooses the optimal correction amongst all Clifford gates instead of the usual Pauli gates. The resulting Clifford frame protocol is of independent interest as it can increase error thresholds and could find applications in other areas of quantum computation.

11 pages, 6 figures. Comments welcome! v2: Included version accepted to the Quantum journal

References in corpus (8)

• Surface codes: Towards practical large-scale quantum computation
• Quantum computing with trapped ions
• An addressable quantum dot qubit with fault-tolerant control fidelity
• Robust randomized benchmarking of quantum processes
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Effective fault-tolerant quantum computation with slow measurements
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Precision measurement of the lifetime of the 6p 2P_1/2 level of Yb+

Cited by in corpus (36)

• Quantum Error Correction: An Introductory Guide
• Building a fault-tolerant quantum computer using concatenated cat codes
• Topological and subsystem codes on low-degree graphs with flag qubits
• Fault-tolerant bosonic quantum error correction with the surface-GKP code
• Repetition Cat Qubits for Fault-Tolerant Quantum Computation
• Quantum computing with rotation-symmetric bosonic codes
• A quantum network stack and protocols for reliable entanglement-based networks
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Flag fault-tolerant error correction with arbitrary distance codes
• Decoding Small Surface Codes with Feedforward Neural Networks
• A fault-tolerant continuous-variable measurement-based quantum computation architecture
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
• Triangular color codes on trivalent graphs with flag qubits
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Deep neural decoders for near term fault-tolerant experiments
• Experimental demonstration of continuous quantum error correction
• Neural-Network Decoders for Quantum Error Correction using Surface Codes:A Space Exploration of the Hardware Cost-Performance Trade-Offs
• Parallel window decoding enables scalable fault tolerant quantum computation
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Coherence in logical quantum channels
• Genuine quantum networks: superposed tasks and addressing
• Encoding qubits in multimode grid states
• Network architecture for a topological quantum computer in silicon
• Linear-time general decoding algorithm for the surface code
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• Logical Clifford Synthesis for Stabilizer Codes
• Concatenation of the Gottesman-Kitaev-Preskill code with the XZZX surface code
• Kerdock Codes Determine Unitary 2-Designs
• Efficient diagnostics for quantum error correction
• Robustness-optimized quantum error correction
• Classically Replaceable Operations
• Non-Pauli Errors in the Three-Dimensional Surface Code
• Effectiveness of the syndrome extraction circuit with flag qubits on IBM quantum hardware
• Real-time decoding of stabilizer measurements in a bit-flip code
• Quantum Computation and Communication in Bosonic Systems
• Feedforward suppression of readout-induced faults in quantum error correction