Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation
Yi-Cong Zheng, Ching-Yi Lai, Todd A. Brun

TL;DR
This paper presents a fault-tolerant, efficient protocol for preparing large block stabilizer ancilla states crucial for fault-tolerant quantum computation, overcoming correlated error issues with a novel postselection method.
Contribution
It introduces a fault-tolerant ancilla preparation protocol using classical error detection to remove correlated errors, significantly improving yield for large block codes.
Findings
Protocol achieves near-perfect ancilla fidelity with low gate failure rates.
Yield rate improves from O(t^{-2}) to O(1) for large CSS codes.
Numerical simulations validate the protocol's effectiveness for the Golay code.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
