Universal Fault Tolerance with Non-Transversal Clifford Gates

• URL: http://arxiv.org/abs/2510.08402v1
• Date: Thu, 09 Oct 2025 16:21:40 GMT
• Title: Universal Fault Tolerance with Non-Transversal Clifford Gates
• Authors: Benjamin Anker, Milad Marvian,
• Abstract summary: We extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit.<n>This framework allows implementation of $T$ gates alongside fault-tolerant realization of selected non-transversal Clifford gates using flags.<n>We also apply our construction to magic-state preparation, general state preparation using Clifford circuits, and data-syndrome codes.
• Score: 0.4870012761464388
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a scheme for the fault-tolerant implementation of arbitrary Clifford circuits. To achieve this, we extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit. This framework opens new pathways toward universal fault tolerance by allowing transversal implementation of $T$ gates alongside fault-tolerant realization of selected non-transversal Clifford gates using flags. The construction we present allows a Clifford circuit consisting of $n$ two-qubit gates and $O(n)$ single-qubit gates acting upon physical qubits in a code of distance $d$ to be made fault tolerant to distance $d$ using $O(d^2 \log(nd^2\log n))$ ancilla qubits and $O(nd^2 \log(nd^2 \log n))$ extra CNOTs. Beyond asymptotic analysis, we demonstrate our construction by implementing the non-transversal logical Hadamard gate for the [[15,1,3]] code, which has transversal T, and compare to alternative approaches for universality using this code. We also apply our construction to magic-state preparation, general state preparation using Clifford circuits, and data-syndrome codes.

Related papers

• Quantum Lego Power-up: Designing Transversal Gates with Tensor Networks [6.445605125467573]
  Transversal gates are the simplest form of fault-tolerant gates and are relatively easy to implement in practice.<n>We show that designing codes that support useful operations -- especially non-Clifford or addressable gates -- remains difficult within the stabilizer formalism or CSS constructions alone.<n>Within the quantum lego formalism, small codes carrying desirable symmetries can be "glued" into larger ones, with operator-flow rules guiding how logical symmetries are preserved.
  arXiv  Detail & Related papers  (2026-03-03T21:56:34Z)
• Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates [0.0]
  We present a full logical group using only and foldbits for a family of Clifford gates in which $k$ grows near $linearly in $n$ up to a $1/sqrtt$ factor.<n>This is the first group using only and foldbits for a family of Clifford gates in which $k$ grows near $linearly in $n$ up to a $1/sqrtt$ factor.
  arXiv  Detail & Related papers  (2026-02-10T13:49:00Z)
• Transversal Clifford-Hierarchy Gates via Non-Abelian Surface Codes [0.0]
  We present a purely 2D realization of phase gates at any level of the Clifford hierarchy.<n>Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian group $G$ on a triangular spatial patch.
  arXiv  Detail & Related papers  (2025-12-15T19:00:00Z)
• Designs from magic-augmented Clifford circuits [3.8943557849328023]
  We prove that shallow Clifford circuits can generate approximate unitary and state $k$-designs with $epsilon$ relative error.<n>The required number of magic gates is parametrically reduced when considering $k$-designs with bounded additive error.
  arXiv  Detail & Related papers  (2025-07-03T17:41:03Z)
• Quantum Codes with Addressable and Transversal Non-Clifford Gates [8.194994143531677]
  We study codes that support gates which induce $textitaddressable$ logical gates.<n>We develop a formalism for constructing quantum codes with $textitaddressable and $ell neq 2$ gates.
  arXiv  Detail & Related papers  (2025-02-03T22:24:34Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes [51.205673783866146]
  We propose and simulate a set of fault-tolerant and constant-depth logical gates on 2D toric codes.<n>This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full Clifford group.
  arXiv  Detail & Related papers  (2024-11-27T12:17:56Z)
• Targeted Clifford logical gates for hypergraph product codes [54.57204856880369]
  We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group.<n>This enables us to design explicit transformations that result in targeted logical gates for arbitrary codes in this family.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.