Skip to content
Preprint

Fault-tolerant $|\sqrt{ \mathrm{T} }\rangle$ state preparation and injection for more efficient fine-grained quantum circuit synthesis

Aug 2026 · 0 citations · 72 references
Physics

TL;DR

This work introduces flag fault-tolerant protocols for preparing logical magic states on the 3D tetrahedral color code and its smaller morphed variant and finds that access to $\sqrt{\mathrm{T}}$ reduces the average space-time cost of synthesizing Haar-random single-qubit unitaries by approximately $20$-$30$% relative to the Clifford+T gate set across practically relevant approximation regimes.

Abstract

Magic-state injection is a standard route to realize universal fault-tolerant quantum computation. Whereas the set of Clifford gates in combination with the non-Clifford T gate is a widely used universal gate set, extending the available set of non-Clifford primitives can reduce compilation overhead, provided that the additional primitives can be prepared fault-tolerantly with competitive resource costs and at sufficiently low logical noise rates. In this work, we introduce flag fault-tolerant protocols for preparing logical $|\sqrt{\mathrm{T}} \rangle $ magic states on the 3D tetrahedral color code and its smaller morphed variant. Our simulations under circuit-level noise verify fault tolerance, quantify acceptance and logical error rates, and we reconstruct the effective logical channels of the corresponding circuits for gate injection via logical process tomography. We find that access to $\sqrt{\mathrm{T}}$ reduces the average space-time cost of synthesizing Haar-random single-qubit unitaries by approximately $20$-$30$% relative to the Clifford+T gate set across practically relevant approximation regimes. These results demonstrate how expanding the set of fault-tolerant non-Clifford primitives can improve computational efficiency and broaden the design space for universal quantum computation in the early fault-tolerant era.

View source

Similar papers

Preprint Sep 2026

Approximate synthesis of general single-qubit unitaries over the Clifford+$\sqrt{T}$ gate set

A resource state cost model based on the magic-state catalysis approach of Gidney and Fowler is adopted, which shows that once a one-time catalyst state is amortized, the Clifford+$\sqrt{T}$ circuits are never costlier than their Clifford+$T$ counterparts.

Mathias Weiden, Jae Won Kim, J. Kalloor et al. · 0 citations
Preprint Sep 2026

Extremely Low-Cost Magic State Preparation toward Fault-Tolerant Quantum Computing

This work introduces a low-cost magic-state preparation protocol in which the choice of stabilizer generators is co-designed with the flag gadgets, allowing the syndrome-extraction circuit itself to filter correlated faults across a non-Clifford layer.

Jian Gao, Xiao Yuan, Yuan Yao · 0 citations
Preprint Sep 2026

Experimental validation of a compact fault-tolerant architecture for trapped ions

Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, a...

Noah F. Berthusen, Ali Lavasani, Asmae Benhemou et al. · 2 citations
Preprint Aug 2026

Magic State Distillation via Codes over Binary Extension Fields

This work uses algebraic geometric techniques to construct codes over binary extension fields $\mathbb{F}_{2^s}$, thus discovering new protocols for the distillation of qubit magic states, where the focus is on the regime of practical qubit-based quantum computing architectures.

An-Qi Gong, Christopher A. Pattison, Patrick Rall et al. · 4 citations · ⚡2
Preprint Aug 2026

Fault-Tolerant Quantum Computation with Adversarial Errors

This result demonstrates that fault-tolerant quantum computation remains possible under noise models that are global, worst-case, and non-Markovian over the full duration of the computation, directly countering concerns that correlated noise could fundamentally undermine quantum fault tolerance.

N. P. Breuckmann, Louis Golowich, U. Vazirani · 0 citations
Preprint Aug 2026

Quantum Circuit for General Unitary: Improved T-count via Block Flattening and Dilation

A Clifford+T quantum circuit construction that approximately implements any classically specified unitary to within error $\epsilon$ and achieves a worst-case $T$-count with leading exponential scaling of $2^{5n/4}$ whenever $\log(1/\epsilon)=\operatorname{poly}(n)$.

Pei Yuan, Sheng-Yu Zhang, Wei Zi · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.