Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation

Abstract

Fault-tolerant quantum computation (FTQC) schemes that use multi-qubit large block codes can potentially reduce the resource overhead to a great extent. A major obstacle is the requirement of a large number of clean ancilla states of different types without correlated errors inside each block. These ancilla states are usually logical stabilizer states of the data code blocks, which are generally difficult to prepare if the code size is large. Previously we have proposed an ancilla distillation protocol for Calderbank-Shor-Steane (CSS) codes by classical error-correcting codes. It was assumed that the quantum gates in the distillation circuit were perfect; however, in reality, noisy quantum gates may introduce correlated errors that are not treatable by the protocol. In this paper, we show that additional postselection by another classical error-detecting code can be applied to remove almost all correlated errors. Consequently, the revised protocol is fully fault-tolerant and capable of preparing a large set of stabilizer states sufficient for FTQC using large block codes. At the same time, the yield rate can be boosted from $O(t^{-2})$ to $O(1)$ in practice for an $[[n,k,d=2t+1]]$ CSS code. Ancilla preparation for the $[[23,1,7]]$ quantum Golay code is numerically studied in detail through Monte Carlo simulation. The results support the validity of the protocol when the gate failure rate is reasonably low. To the best of our knowledge, this approach is the first attempt to prepare general large block stabilizer states free of correlated errors for FTQC in a fault-tolerant and efficient manner.

25 pages, 28 figures, 1 table, comments are most welcome. v2: published version

References in corpus (14)

• Surface codes: Towards practical large-scale quantum computation
• Towards fault-tolerant quantum computing with trapped ions
• Restrictions on Transversal Encoded Quantum Gate Sets
• New class of quantum error-correcting codes for a bosonic mode
• Magic state distillation with low overhead
• Subsystem fault tolerance with the Bacon-Shor 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 fault-tolerant gates on concatenated stabilizer codes
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• Ability of stabilizer quantum error correction to protect itself from its own imperfection
• Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
• Teleportation-based Fault-tolerant Quantum Computation in Multi-qubit Large Block Codes

Cited by in corpus (7)

• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes
• Code conversion with the quantum Golay code for a universal transversal gate set
• Distance-four quantum codes with combined postselection and error correction
• Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
• The resource cost of large scale quantum computing
• Between Shor and Steane: A unifying construction for measuring error syndromes