Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2510.08402

Universal Fault Tolerance with Non-Transversal Clifford Gates

Benjamin Anker, Milad Marvian

Published Oct 9, 2025• 2 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.2510.08402

Related papers

Fault-tolerant magic state preparation with flag qubits

Christopher Chamberland, Andrew W. Cross

Magic state distillation is one of the leading candidates for implementing universal fault-tolerant logical gates. However, the distillation circuits themselves are not fault-tolerant, so there is additional cost to first implement encoded Clifford gates with negligible error. In this paper we present a scheme to fault-tolerantly and directly prepare magic states using flag qubits. One of these schemes requires only three ancilla qubits, even with noisy Clifford gates. We compare the physical qubit and gate cost of our scheme to the magic state distillation protocol of Meier, Eastin, and Knill (MEK), which is efficient and uses a small stabilizer circuit. For low enough noise rates, we show that in some regimes the overhead can be improved by several orders of magnitude compared to the MEK scheme which uses Clifford operations encoded in the codes considered in this work.

arXiv:1811.00566•Quantum•May 20, 2019•96 citations

Flagging the Clifford hierarchy:~Fault-tolerant logical $\fracπ{2^l}$ rotations via measuring circuit gauge operators of non-Cliffords

Shival Dasu, Ben Criger

We provide a recursively defined sequence of flag circuits which will detect logical errors induced by non-fault-tolerant $R_{\overline{Z}}(\fracπ{2^l})$ gates on CSS codes with a fault distance of two. As applications, we give a family of circuits with $O(l)$ gates and ancillae which implement fault-tolerant logical $R_{Z}(\fracπ{2^l})$ or $R_{ZZ}(\fracπ{2^l})$ gates on any $[[k + 2, k, 2]]$ iceberg code and fault-tolerant circuits of size $O(l)$ for preparing $|\fracπ{2^l}\rangle$ resource states in the $[[7,1,3]]$ code, which can be used to perform fault-tolerant $R_{\overline{Z}}(\fracπ{2^l})$ rotations via gate teleportation, allowing for implementations of these gates that bypass the high overheads of gate synthesis when $l$ is small relative to the precision required. We show how the circuits above can be generalized to $π( x_0.x_{1}x_{2}\ldots x_{l}) = \sum_{j}^{l} π\frac{x_j}{2^j}$ rotations with identical overheads in $l$, which could be useful in quantum simulations where time is digitized in binary. Finally, we illustrate two approaches to increase the fault-distance of our construction. We show how to increase the fault distance of a Cliffordized version of the T gate circuit to $3$ in the Steane code and how to increase the fault-distance of the $\fracπ{2}$ iceberg circuit to $4$ through concatenation in two-level iceberg codes. This yields a targeted logical $R_{\overline{Z}}(\fracπ{2})$ gate with fault distance $4$ on any row of logical qubits in an $[[(k_2+2)(k_1+2), k_1k_2, 4]]$ code.

quant-pharXiv:2603.24573•Mar 26, 2026•3 citations

Fault-tolerantly implementing dense rotation operations based on non-stabilizer states

Wu Xiang-Yan, Xu Yan-Ling, Yu Ya-Fei +1 more

Based on the quantum error-correction codes and concatenation, quantum logical gates can be implemented transversally, which is called the fault-tolerant quantum computation. Clifford gates can be directly and fault-tolerantly performed, but they cannot reach universal quantum computation. How to implement the non-Clifford gate fault-tolerantly is a vital technique in fault-tolerant universal quantum computation. Here the magic state is selected to help the implementing of the non-Clifford gate transversally. Based on the non-stabilizer state cos θi|0>+sinθi|1>, circuits which can execute 2θi rotation around X-axis and Z-axis fault-tolerantly are proposed. Then new non-stabilizer states in this form are developed and produced from the distilled magic state. By using these states, a number of non-Clifford gates can be performed transversally, which makes profound implication in fault-tolerant quantum computation. We calculate the number of the non-stabilizer states needed for simulating the desired rotation operations, which is less than that in previous protocols.

Acta Physica Sinica•Jan 1, 2014•0 citations

No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits

Aranya Chakraborty, Daniel Gottesman

Identifying stabilizer codes that admit fault-tolerant implementations of the full logical Clifford group would significantly advance fault-tolerant quantum computation. Motivated by this goal, we study several classes of fault-tolerant gadget constructions consisting of Clifford gates acting on the physical qubits, including transversal gadgets, code automorphisms, and fold-transversal gadgets. While stabilizer codes encoding a single logical qubit, most notably the [[7,1,3]] Steane code, are known to admit transversal implementations of the full logical Clifford group, no analogous examples are known for codes encoding multiple logical qubits. In this work, we prove a no-go theorem establishing that no stabilizer code admits a fully transversal implementation of the Clifford group on more than one logical qubit. We further strengthen this result by showing that fold-transversal implementations of the full logical Clifford group are impossible for stabilizer codes encoding more than two logical qubits. More generally, we introduce the notion of k-fold transversal gadgets and prove that implementing the full Clifford group on k logical qubits requires at least k-fold transversal gadgets at the physical level. In addition, we analyze code-automorphism based constructions and demonstrate that they also fail to realize the full Clifford group on multiple logical qubits for any stabilizer code. Together, these results place fundamental constraints on fault-tolerant Clifford gadget design and show that stabilizer codes supporting the full logical Clifford group on multiple logical qubits via these architectures do not exist. Since the Clifford group is a core component of universal gate sets, our findings imply that quantum computing with codes encoding multiple logical qubits within a single code block necessarily entails more complex constructions for fault tolerance.

quant-pharXiv:2602.13395•PRX Quantum•Feb 17, 2026•16 citations

Magic Quantum Code Surgery

Kathleen Chang, Anasuya Lyons, Yuanjie Ren +5 more

Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.

quant-pharXiv:2610.03920•Oct 6, 2026•4 citations

Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation

Nicholas J. C. Papadopoulos, Ramin Ayanzadeh

Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of transversal universal quantum computation. This universality is highly desired and often achieved using techniques such as code concatenation, code switching, magic state distillation, or pieceable fault tolerance. Existing constructions can incur substantial overhead or rely on properties specific to particular codes. This work proposes implementing logical Clifford and T gates through novel, ancilla-mediated, pieceable interactions to construct a universal fault-tolerant quantum gate set. Our construction is deterministic, does not modify the underlying data codes or registers, and is generic over all data stabilizer codes. Thus, any single code becomes capable of universal quantum computation by leveraging helper codes in ancilla registers and mid-circuit measurements. Furthermore, since these logical gates are stabilizer code-generic, these implementations enable communication between heterogeneous stabilizer codes.

quant-pharXiv:2601.10964•Jan 19, 2026•2 citations
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 TTT gates alongside fault-tolerant realization of selected non-transversal Clifford gates using flags. The construction we present allows a Clifford circuit consisting of nnn two-qubit gates and O(n)O(n)O(n) single-qubit gates acting upon physical qubits in a code of distance ddd to be made fault tolerant to distance ddd using O(d2log⁡(nd2log⁡n))O(d^2 \log(nd^2\log n))O(d2log(nd2logn)) ancilla qubits and O(nd2log⁡(nd2log⁡n))O(nd^2 \log(nd^2 \log n))O(nd2log(nd2logn)) 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.
Magic state distillation is one of the leading candidates for implementing universal fault-tolerant logical gates. However, the distillation circuits themselves are not fault-tolerant, so there is additional cost to first implement encoded Clifford gates with negligible error. In this paper we present a scheme to fault-tolerantly and directly prepare magic states using flag qubits. One of these schemes requires only three ancilla qubits, even with noisy Clifford gates. We compare the physical qubit and gate cost of our scheme to the magic state distillation protocol of Meier, Eastin, and Knill (MEK), which is efficient and uses a small stabilizer circuit. For low enough noise rates, we show that in some regimes the overhead can be improved by several orders of magnitude compared to the MEK scheme which uses Clifford operations encoded in the codes considered in this work.
Flagging the Clifford hierarchy:~Fault-tolerant logical π2l\fracπ{2^l}2lπ​ rotations via measuring circuit gauge operators of non-Cliffords
We provide a recursively defined sequence of flag circuits which will detect logical errors induced by non-fault-tolerant RZ‾(π2l)R_{\overline{Z}}(\fracπ{2^l})RZ​(2lπ​) gates on CSS codes with a fault distance of two. As applications, we give a family of circuits with O(l)O(l)O(l) gates and ancillae which implement fault-tolerant logical RZ(π2l)R_{Z}(\fracπ{2^l})RZ​(2lπ​) or RZZ(π2l)R_{ZZ}(\fracπ{2^l})RZZ​(2lπ​) gates on any [[k+2,k,2]][[k + 2, k, 2]][[k+2,k,2]] iceberg code and fault-tolerant circuits of size O(l)O(l)O(l) for preparing ∣π2l⟩|\fracπ{2^l}\rangle∣2lπ​⟩ resource states in the [[7,1,3]][[7,1,3]][[7,1,3]] code, which can be used to perform fault-tolerant RZ‾(π2l)R_{\overline{Z}}(\fracπ{2^l})RZ​(2lπ​) rotations via gate teleportation, allowing for implementations of these gates that bypass the high overheads of gate synthesis when lll is small relative to the precision required. We show how the circuits above can be generalized to π(x0.x1x2…xl)=∑jlπxj2jπ( x_0.x_{1}x_{2}\ldots x_{l}) = \sum_{j}^{l} π\frac{x_j}{2^j}π(x0​.x1​x2​…xl​)=∑jl​π2jxj​​ rotations with identical overheads in lll, which could be useful in quantum simulations where time is digitized in binary. Finally, we illustrate two approaches to increase the fault-distance of our construction. We show how to increase the fault distance of a Cliffordized version of the T gate circuit to 333 in the Steane code and how to increase the fault-distance of the π2\fracπ{2}2π​ iceberg circuit to 444 through concatenation in two-level iceberg codes. This yields a targeted logical RZ‾(π2)R_{\overline{Z}}(\fracπ{2})RZ​(2π​) gate with fault distance 444 on any row of logical qubits in an [[(k2+2)(k1+2),k1k2,4]][[(k_2+2)(k_1+2), k_1k_2, 4]][[(k2​+2)(k1​+2),k1​k2​,4]] code.
Based on the quantum error-correction codes and concatenation, quantum logical gates can be implemented transversally, which is called the fault-tolerant quantum computation. Clifford gates can be directly and fault-tolerantly performed, but they cannot reach universal quantum computation. How to implement the non-Clifford gate fault-tolerantly is a vital technique in fault-tolerant universal quantum computation. Here the magic state is selected to help the implementing of the non-Clifford gate transversally. Based on the non-stabilizer state cos θi|0>+sinθi|1>, circuits which can execute 2θi rotation around X-axis and Z-axis fault-tolerantly are proposed. Then new non-stabilizer states in this form are developed and produced from the distilled magic state. By using these states, a number of non-Clifford gates can be performed transversally, which makes profound implication in fault-tolerant quantum computation. We calculate the number of the non-stabilizer states needed for simulating the desired rotation operations, which is less than that in previous protocols.
Identifying stabilizer codes that admit fault-tolerant implementations of the full logical Clifford group would significantly advance fault-tolerant quantum computation. Motivated by this goal, we study several classes of fault-tolerant gadget constructions consisting of Clifford gates acting on the physical qubits, including transversal gadgets, code automorphisms, and fold-transversal gadgets. While stabilizer codes encoding a single logical qubit, most notably the [[7,1,3]] Steane code, are known to admit transversal implementations of the full logical Clifford group, no analogous examples are known for codes encoding multiple logical qubits. In this work, we prove a no-go theorem establishing that no stabilizer code admits a fully transversal implementation of the Clifford group on more than one logical qubit. We further strengthen this result by showing that fold-transversal implementations of the full logical Clifford group are impossible for stabilizer codes encoding more than two logical qubits. More generally, we introduce the notion of k-fold transversal gadgets and prove that implementing the full Clifford group on k logical qubits requires at least k-fold transversal gadgets at the physical level. In addition, we analyze code-automorphism based constructions and demonstrate that they also fail to realize the full Clifford group on multiple logical qubits for any stabilizer code. Together, these results place fundamental constraints on fault-tolerant Clifford gadget design and show that stabilizer codes supporting the full logical Clifford group on multiple logical qubits via these architectures do not exist. Since the Clifford group is a core component of universal gate sets, our findings imply that quantum computing with codes encoding multiple logical qubits within a single code block necessarily entails more complex constructions for fault tolerance.
Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of transversal universal quantum computation. This universality is highly desired and often achieved using techniques such as code concatenation, code switching, magic state distillation, or pieceable fault tolerance. Existing constructions can incur substantial overhead or rely on properties specific to particular codes. This work proposes implementing logical Clifford and T gates through novel, ancilla-mediated, pieceable interactions to construct a universal fault-tolerant quantum gate set. Our construction is deterministic, does not modify the underlying data codes or registers, and is generic over all data stabilizer codes. Thus, any single code becomes capable of universal quantum computation by leveraging helper codes in ancilla registers and mid-circuit measurements. Furthermore, since these logical gates are stabilizer code-generic, these implementations enable communication between heterogeneous stabilizer codes.