Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes

Abstract

Fault-tolerant quantum computation (FTQC) schemes using large block codes that encode $k>1$ qubits in $n$ physical qubits can potentially reduce the resource overhead to a great extent because of their high encoding rate. However, the fault-tolerant (FT) logical operations for the encoded qubits are difficult to find and implement, which usually takes not only a very large resource overhead but also long $\text{in-situ}$ computation time. In this paper, we focus on Calderbank-Shor-Steane $[[n,k,d]]$ (CSS) codes and their logical FT Clifford circuits. We show that the depth of an arbitrary logical Clifford circuit can be implemented fault-tolerantly in $O(1)$ steps \emph{in-situ} via either Knill or Steane syndrome measurement circuit, with the qualified ancilla states efficiently prepared. Particularly, for those codes satisfying $k/n\sim \Theta (1)$, the resource scaling for Clifford circuits implementation on the logical level can be the same as on the physical level up to a constant, which is independent of code distance $d$. With a suitable pipeline to produce ancilla states, our scheme requires only a modest resource cost in physical qubits, physical gates, and computation time for very large scale FTQC.

arXiv comment13 pages, 6 figures. This paper supersedes the previous arXiv:1805.12082 by authors; v2:published version

References in corpus (26)

• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Good Quantum Error-Correcting Codes Exist
• Quantum Teleportation is a Universal Computational Primitive
• Measurement-based quantum computation with cluster states
• Improved Simulation of Stabilizer Circuits
• Simulated Quantum Computation of Molecular Energies
• Quantum Computing with Very Noisy Devices
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• A fault-tolerant one-way quantum computer
• Overhead and noise threshold of fault-tolerant quantum error correction
• Methodology for quantum logic gate constructions
• Fault-Tolerant Error Correction with Efficient Quantum Codes
• Active stabilisation, quantum computation and quantum state synthesis
• Gate count estimates for performing quantum chemistry on small quantum computers
• Fault-tolerant quantum computation with long-range correlated noise
• Long-range quantum entanglement in noisy cluster states
• Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
• Efficient fault-tolerant quantum computing
• Deep neural decoders for near term fault-tolerant experiments
• Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
• Fault-Tolerant Logical Gate Networks for CSS Codes
• Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
• Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation

Cited by in corpus (8)

• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Learning quantum circuits of some $T$ gates
• Parallel syndrome extraction with shared flag qubits for Calderbank-Shor-Steane codes of distance three
• Reducing Quantum Error Correction Overhead with Versatile Flag-Sharing Syndrome Extraction Circuits
• Syndrome decoding by quantum approximate optimization
• Harnessing Coding Theory for Reliable Network Quantum Communication
• Between Shor and Steane: A unifying construction for measuring error syndromes