Fast verification of fault tolerant magic state preparation circuits with the CNOT + T gate set
Abstract
Magic state preparation is often among the most expensive operations in a fault tolerant quantum computation. One obstacle to coming up with better magic state preparation circuits lies in verifying their fault tolerance properties, as it is difficult to verify either by hand or in software that a very large number of combinations of faults do not give rise to high-weight or logical errors, especially in a non-Clifford circuit. In this work, we propose the use of the CNOT + T gate set to fault-tolerantly prepare a large class of magic states. We consider the propagation of Pauli faults within CNOT + T circuits and derive properties similar to those of Pauli faults within Clifford circuits, with a view to verifying fault tolerance as efficiently as possible. We present Comb, a library that can verify the fault tolerance of CNOT + T magic state preparation circuits, and demonstrate its use in verifying the fault tolerance of distance three and distance five magic state preparation circuits in minutes on a laptop. We present a distance five magic state preparation circuit that was discovered using Comb. As an independent confirmation of Comb's correctness we compare its findings to circuit-level noisy simulations for several magic state preparation circuits.
Related
- Two-Layer Verification for Fault-Tolerant Magic-State Preparation in High-Rate Quantum Codes
- Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits
- Extremely Low-Cost Magic State Preparation toward Fault-Tolerant Quantum Computing
- Early Fault-Tolerant Magic State Synthesis and Spacetime Efficient Analog Rotations with Color Code on a Superconducting Quantum Processor
- Fault-tolerant resource estimation for ground-state preparation via Lindblad simulation
BibTeX
@misc{simsek2026fast,
title = {{Fast verification of fault tolerant magic state preparation circuits with the CNOT + T gate set}},
author = {Selwyn Simsek and Callum Macpherson and Chris N. Self and David Amaro},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.04909},
eprint = {2611.04909},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.04909},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Fast verification of fault tolerant magic state preparation circuits with the CNOT + T gate set
AU - Selwyn Simsek
AU - Callum Macpherson
AU - Chris N. Self
AU - David Amaro
PY - 2026
DA - 2026/11/03
PB - arXiv
DO - 10.48550/arxiv.2611.04909
UR - https://arxiv.org/abs/2611.04909
AB - Magic state preparation is often among the most expensive operations in a fault tolerant quantum computation. One obstacle to coming up with better magic state preparation circuits lies in verifying their fault tolerance properties, as it is difficult to verify either by hand or in software that a very large number of combinations of faults do not give rise to high-weight or logical errors, especially in a non-Clifford circuit. In this work, we propose the use of the CNOT + T gate set to fault-tolerantly prepare a large class of magic states. We consider the propagation of Pauli faults within CNOT + T circuits and derive properties similar to those of Pauli faults within Clifford circuits, with a view to verifying fault tolerance as efficiently as possible. We present Comb, a library that can verify the fault tolerance of CNOT + T magic state preparation circuits, and demonstrate its use in verifying the fault tolerance of distance three and distance five magic state preparation circuits in minutes on a laptop. We present a distance five magic state preparation circuit that was discovered using Comb. As an independent confirmation of Comb's correctness we compare its findings to circuit-level noisy simulations for several magic state preparation circuits.
ER -