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

Pairs of CSS error correction codes with transversal gate implementation

Dawei Jiao

Published Jan 1, 2026• 0 citations
OpenAlex

Abstract

The realization of universal fault-tolerant (FT) quantum computation remains one of the most challenging problems in the field. The Eastin-Knill theorem establishes that no single quantum error correction code (QECC) can support a logical gate set that is simultaneously transversal and universal. While existing bypass strategies such as magic state distillation and code switching provide a theoretical pathway to universality, they often introduce prohibitive resource overheads in terms of physical qubit counts and circuit depth. This thesis proposes a generalized framework for cross-code transversality as a high-efficiency alternative for achieving universal FT computation. Moving beyond the traditional definition of transversality, we derive the mathematical conditions required for multi-qubit gates, specifically CNOT and CZ gates, to act transversally between distinct QECCs. This theoretical framework allows for the interaction of logical information stored in different codes. Furthermore, we introduce a novel hybrid system that supports a transversal Toffoli gate, which has already been proved no single-QECC system could have such transversality. The practical utility of this cross-code framework is demonstrated through three main applications. First, we optimize second-generation (2G) quantum repeater systems by introducing a code design called mirrored code structure. By using structurally correlated but distinct codes, we improve communication fidelity and reduce the minimum number of intermediate stations required for reliable long-distance entanglement distribution. Second, we propose a transversal code switching protocol that minimizes the qubit and gate overhead by transferring logical states between triorthogonal and paired symmetric codes via one-way transversal interactions. Finally, we present a high-fidelity Toffoli state distillation scheme based on a hybrid-code architecture without the need of T-magic states. Numerical simulations under realistic noise models indicate that these cross-code methods significantly reduce the qubit and gate overhead required for FT operations compared to traditional single-code protocols. By finding the conditions for interactions between diverse code families, this work provides a scalable roadmap for universal FT quantum computing that leverages the different features of multiple QECCs within a single, integrated quantum system.

Related papers

Low Overhead Universal Quantum Computation with Triorthogonal Codes

Dawei Jiao, Mahdi Bayanifar, Alexei Ashikhmin +1 more

We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both universality and a transversal gate set. We show that our methods reduce the resource overhead compared with existing fault-tolerant protocols. We develop a simple fault-tolerant implementation of the logical Hadamard gate for triorthogonal codes by exploiting the fact that they have transversal controlled-Z (CZ) gates, resulting in a circuit with reduced overhead. We also introduce a procedure for generating a symmetric Calderbank-Shor-Steane code paired with a triorthogonal code, which allows CNOT and CZ gate transversality across the pair of codes. In addition, we present logical state teleportation circuits that transfer encoded states between the two codes, allowing all logical operations to be performed transversally. Our methods can be integrated into the Steane error correction framework without incurring additional resource cost. Finally, using the 15-qubit code as an example, we demonstrate that our protocols significantly reduce the gate overhead compared with other existing methods. These results highlight the potential of combining distinct code structures to achieve low-overhead, universal fault-tolerant quantum computation.

quant-pharXiv:2510.05708•Oct 8, 2025•2 citations

Complementary 3D color codes for transversal quantum logic

Friederike Butt, Luis Colmenarez, Erik Weilandt +3 more

Transversal logical gates provide a direct route to fault-tolerant quantum computation, but the Eastin-Knill theorem forbids a universal transversal gate set within a single quantum error-correcting code. We propose a hybrid architecture based on the tetrahedral three-dimensional color code and its Hadamard-transformed counterpart, which we call the H-tetrahedral code. The two encodings support complementary transversal non-Clifford operations. Combined with bitwise Hadamard transformations that switch between the two encodings and a one-way transversal logical CNOT from the tetrahedral code to the H-tetrahedral code, these operations realize an almost-universal transversal logical gate set that enables both the creation of entanglement and logical states with magic. We complete a universal gate set through a pieceably fault-tolerant round-robin construction of a logical controlled-$Z$ gate between two H-tetrahedral codes. This logical entangling gate is interleaved with reduced-overhead Steane-type syndrome extraction using logical two-dimensional color-code auxiliary qubits. Our construction provides a new route toward implementing classically hard-to-simulate quantum algorithms where magic and most entangling operations are transversal while the resource overhead is concentrated in a small number of non-transversal Clifford entangling operations.

quant-pharXiv:2607.05107•Jul 7, 2026•2 citations

Quantum Codes with Arbitrary Z-Rotation logical Gates and Applications to Fault-Tolerant Code Switching

Reza Dastbasteh, Ruben M. Otxoa, Pedro M. Crespo +1 more

A technique for realizing a universal set of fault-tolerant quantum operations is the code switching method, which leverages two quantum codes with complementary sets of transversal gates. To date, the application of this technique has been largely limited to families of color codes supporting a logical $T$ gate. No analogous code switching protocols exist for many other prominent families, such as rotated surface codes, or for finer $Z$-rotation gates. In this work, we first utilize the doubling technique as a unified framework to construct a class of quantum color codes encoding a single logical qubit with an arbitrarily large minimum distance, enabling the transversal realization of arbitrary small logical $Z$-rotation gates. We investigate the structural properties of this code family, demonstrating that they improve upon the parameters of state-of-the-art triorthogonal codes, achieve lower qubit overhead compared to certain known color codes, and admit single-shot decoding of $Z$-syndromes via meta-checks. Furthermore, we show that this framework extends beyond color codes; specifically, it enables the generation of $r$-orthogonal quantum codes, $r \ge 2$, that inherit the local geometry of rotated surface codes. We then provide an overhead optimization protocol alongside several candidate codes tailored for realizing logical $Z$-rotation gates within rotated surface codes. Finally, we extend the fault-tolerant code switching protocol based on transversal CNOT gates to incorporate fault-tolerant realization of $Z$-rotation gates at any level of the Clifford hierarchy for geometries compatible with rotated surface codes. We present the first demonstration of fault-tolerant magic state preparation by means of code switching within a distance-three rotated surface code using a total footprint of only 45 physical qubits, and evaluate its performance through a simulation.

quant-pharXiv:2608.11160•Aug 12, 2026•2 citations

Efficient fault-tolerant code switching via one-way transversal CNOT gates

Sascha Heußen, Janine Hilder

Code switching is an established technique that facilitates a universal set of FT quantum gate operations by combining two QEC codes with complementary sets of gates, which each by themselves are easy to implement fault-tolerantly. In this work, we present a code switching scheme that respects the constraints of FT circuit design by only making use of transversal gates. These gates are intrinsically FT without additional qubit overhead. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors, for instance based on trapped ions or neutral atoms. We briefly discuss connectivity constraints that arise for architectures based on superconducting qubits. Numerical simulations of circuit-level noise indicate that a logical T -gate, facilitated by our scheme, could outperform both flag-FT magic state injection protocols and a physical T -gate at low physical error rates. Transversal code switching naturally scales to code pairs of arbitrary code distance. We observe improved performance of a distance-5 protocol compared to both the distance-3 implementation and the physical gate for realistically attainable physical entangling gate error rates. We discuss how the scheme can be implemented with a large degree of parallelization, provided that logical auxiliary qubits can be prepared reliably enough. Our logical T -gate circumvents potentially costly magic state factories. The requirements to perform QEC and to achieve an FT universal gate set are then essentially the same: Prepare logical auxiliary qubits offline, execute transversal gates and perform fast-enough measurements. Transversal code switching thus serves to enable more practical hardware realizations of FT universal quantum computation. The scheme alleviates resource requirements for experimental demonstrations of quantum algorithms run on logical qubits.

arXiv:2409.13465•Quantum•Sep 3, 2025•29 citations

Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code

Shixin Wu, Dawei Zhong, Todd A. Brun +1 more

Code-switching offers a route to universal, fault-tolerant quantum computation by circumventing the limitation implied by the Eastin-Knill theorem against a universal transversal gate set within a single quantum code. Here, we present a fault-tolerant code-switching protocol between two versions of the $[[8, 3, 2]]$ code. One version supports weakly fault-tolerant single-qubit Clifford gates, while the other supports a logical $\overline{\mathrm{CCZ}}$ gate via transversal $T/T^\dagger$ together with logical $\overline{\mathrm{CZ}}$, $\overline{\mathrm{CNOT}}$, and $\overline{\mathrm{SWAP}}$ gates. Because both codes have distance 2, the protocol operates in a postselected, error-detecting regime: single faults lead to detectable outcomes, and accepted runs exhibit quadratic suppression of logical error rates. This yields a universal scheme for postselected fault-tolerant computation. We validate the protocol numerically through simulations of state preparation, code switching, and a three-logical-qubit implementation of Grover's search.

quant-pharXiv:2603.15610•Physical Review Research•Mar 17, 2026•1 citation

Qubit CSS codes with Universal Transversal Gates

Arpit Dua, Adam Holmes, Michael J. Gullans +1 more

The Eastin-Knill theorem rules out a universal set of transversal logical gates on any code that detects single-qubit errors. The theorem constrains one partition of the qubits at a time. We show that depth-one layers of few-qubit gates, each respecting its own partition, can together generate a universal logical gate set on an error-correcting code. Each logical gate generator is then a single depth-one layer followed by error correction of the same stabilizer code, with no magic-state distillation, code switching, gauge fixing, lattice surgery, or other gadgets. We show that such codes can be found by applying an entangling circuit to a lower-distance "seed" code admitting a depth-one non-Clifford gate and an appropriate "kernel" code. We construct 47 codes with depth-one generating sets that tolerate at least one faulty gate per layer, including a [[37,1,7]] and a [[59,1,9]] code, both of check weight at most eight.

quant-pharXiv:2610.06730•Oct 6, 2026•1 citation
The realization of universal fault-tolerant (FT) quantum computation remains one of the most challenging problems in the field. The Eastin-Knill theorem establishes that no single quantum error correction code (QECC) can support a logical gate set that is simultaneously transversal and universal. While existing bypass strategies such as magic state distillation and code switching provide a theoretical pathway to universality, they often introduce prohibitive resource overheads in terms of physical qubit counts and circuit depth. This thesis proposes a generalized framework for cross-code transversality as a high-efficiency alternative for achieving universal FT computation. Moving beyond the traditional definition of transversality, we derive the mathematical conditions required for multi-qubit gates, specifically CNOT and CZ gates, to act transversally between distinct QECCs. This theoretical framework allows for the interaction of logical information stored in different codes. Furthermore, we introduce a novel hybrid system that supports a transversal Toffoli gate, which has already been proved no single-QECC system could have such transversality. The practical utility of this cross-code framework is demonstrated through three main applications. First, we optimize second-generation (2G) quantum repeater systems by introducing a code design called mirrored code structure. By using structurally correlated but distinct codes, we improve communication fidelity and reduce the minimum number of intermediate stations required for reliable long-distance entanglement distribution. Second, we propose a transversal code switching protocol that minimizes the qubit and gate overhead by transferring logical states between triorthogonal and paired symmetric codes via one-way transversal interactions. Finally, we present a high-fidelity Toffoli state distillation scheme based on a hybrid-code architecture without the need of T-magic states. Numerical simulations under realistic noise models indicate that these cross-code methods significantly reduce the qubit and gate overhead required for FT operations compared to traditional single-code protocols. By finding the conditions for interactions between diverse code families, this work provides a scalable roadmap for universal FT quantum computing that leverages the different features of multiple QECCs within a single, integrated quantum system.
We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both universality and a transversal gate set. We show that our methods reduce the resource overhead compared with existing fault-tolerant protocols. We develop a simple fault-tolerant implementation of the logical Hadamard gate for triorthogonal codes by exploiting the fact that they have transversal controlled-Z (CZ) gates, resulting in a circuit with reduced overhead. We also introduce a procedure for generating a symmetric Calderbank-Shor-Steane code paired with a triorthogonal code, which allows CNOT and CZ gate transversality across the pair of codes. In addition, we present logical state teleportation circuits that transfer encoded states between the two codes, allowing all logical operations to be performed transversally. Our methods can be integrated into the Steane error correction framework without incurring additional resource cost. Finally, using the 15-qubit code as an example, we demonstrate that our protocols significantly reduce the gate overhead compared with other existing methods. These results highlight the potential of combining distinct code structures to achieve low-overhead, universal fault-tolerant quantum computation.
Transversal logical gates provide a direct route to fault-tolerant quantum computation, but the Eastin-Knill theorem forbids a universal transversal gate set within a single quantum error-correcting code. We propose a hybrid architecture based on the tetrahedral three-dimensional color code and its Hadamard-transformed counterpart, which we call the H-tetrahedral code. The two encodings support complementary transversal non-Clifford operations. Combined with bitwise Hadamard transformations that switch between the two encodings and a one-way transversal logical CNOT from the tetrahedral code to the H-tetrahedral code, these operations realize an almost-universal transversal logical gate set that enables both the creation of entanglement and logical states with magic. We complete a universal gate set through a pieceably fault-tolerant round-robin construction of a logical controlled-ZZZ gate between two H-tetrahedral codes. This logical entangling gate is interleaved with reduced-overhead Steane-type syndrome extraction using logical two-dimensional color-code auxiliary qubits. Our construction provides a new route toward implementing classically hard-to-simulate quantum algorithms where magic and most entangling operations are transversal while the resource overhead is concentrated in a small number of non-transversal Clifford entangling operations.
A technique for realizing a universal set of fault-tolerant quantum operations is the code switching method, which leverages two quantum codes with complementary sets of transversal gates. To date, the application of this technique has been largely limited to families of color codes supporting a logical TTT gate. No analogous code switching protocols exist for many other prominent families, such as rotated surface codes, or for finer ZZZ-rotation gates. In this work, we first utilize the doubling technique as a unified framework to construct a class of quantum color codes encoding a single logical qubit with an arbitrarily large minimum distance, enabling the transversal realization of arbitrary small logical ZZZ-rotation gates. We investigate the structural properties of this code family, demonstrating that they improve upon the parameters of state-of-the-art triorthogonal codes, achieve lower qubit overhead compared to certain known color codes, and admit single-shot decoding of ZZZ-syndromes via meta-checks. Furthermore, we show that this framework extends beyond color codes; specifically, it enables the generation of rrr-orthogonal quantum codes, r≥2r \ge 2r≥2, that inherit the local geometry of rotated surface codes. We then provide an overhead optimization protocol alongside several candidate codes tailored for realizing logical ZZZ-rotation gates within rotated surface codes. Finally, we extend the fault-tolerant code switching protocol based on transversal CNOT gates to incorporate fault-tolerant realization of ZZZ-rotation gates at any level of the Clifford hierarchy for geometries compatible with rotated surface codes. We present the first demonstration of fault-tolerant magic state preparation by means of code switching within a distance-three rotated surface code using a total footprint of only 45 physical qubits, and evaluate its performance through a simulation.
Code switching is an established technique that facilitates a universal set of FT quantum gate operations by combining two QEC codes with complementary sets of gates, which each by themselves are easy to implement fault-tolerantly. In this work, we present a code switching scheme that respects the constraints of FT circuit design by only making use of transversal gates. These gates are intrinsically FT without additional qubit overhead. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors, for instance based on trapped ions or neutral atoms. We briefly discuss connectivity constraints that arise for architectures based on superconducting qubits. Numerical simulations of circuit-level noise indicate that a logical T -gate, facilitated by our scheme, could outperform both flag-FT magic state injection protocols and a physical T -gate at low physical error rates. Transversal code switching naturally scales to code pairs of arbitrary code distance. We observe improved performance of a distance-5 protocol compared to both the distance-3 implementation and the physical gate for realistically attainable physical entangling gate error rates. We discuss how the scheme can be implemented with a large degree of parallelization, provided that logical auxiliary qubits can be prepared reliably enough. Our logical T -gate circumvents potentially costly magic state factories. The requirements to perform QEC and to achieve an FT universal gate set are then essentially the same: Prepare logical auxiliary qubits offline, execute transversal gates and perform fast-enough measurements. Transversal code switching thus serves to enable more practical hardware realizations of FT universal quantum computation. The scheme alleviates resource requirements for experimental demonstrations of quantum algorithms run on logical qubits.
Code-switching offers a route to universal, fault-tolerant quantum computation by circumventing the limitation implied by the Eastin-Knill theorem against a universal transversal gate set within a single quantum code. Here, we present a fault-tolerant code-switching protocol between two versions of the [[8,3,2]][[8, 3, 2]][[8,3,2]] code. One version supports weakly fault-tolerant single-qubit Clifford gates, while the other supports a logical CCZ‾\overline{\mathrm{CCZ}}CCZ gate via transversal T/T†T/T^\daggerT/T† together with logical CZ‾\overline{\mathrm{CZ}}CZ, CNOT‾\overline{\mathrm{CNOT}}CNOT, and SWAP‾\overline{\mathrm{SWAP}}SWAP gates. Because both codes have distance 2, the protocol operates in a postselected, error-detecting regime: single faults lead to detectable outcomes, and accepted runs exhibit quadratic suppression of logical error rates. This yields a universal scheme for postselected fault-tolerant computation. We validate the protocol numerically through simulations of state preparation, code switching, and a three-logical-qubit implementation of Grover's search.
The Eastin-Knill theorem rules out a universal set of transversal logical gates on any code that detects single-qubit errors. The theorem constrains one partition of the qubits at a time. We show that depth-one layers of few-qubit gates, each respecting its own partition, can together generate a universal logical gate set on an error-correcting code. Each logical gate generator is then a single depth-one layer followed by error correction of the same stabilizer code, with no magic-state distillation, code switching, gauge fixing, lattice surgery, or other gadgets. We show that such codes can be found by applying an entangling circuit to a lower-distance "seed" code admitting a depth-one non-Clifford gate and an appropriate "kernel" code. We construct 47 codes with depth-one generating sets that tolerate at least one faulty gate per layer, including a [[37,1,7]] and a [[59,1,9]] code, both of check weight at most eight.