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
CCZ gate via transversal
T/T† together with logical
CZ,
CNOT, and
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.
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.
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realization of large-scale quantum algorithms that could lead to extremely impactful scientific or commercial results. Achieving a universal set of quantum gate operations in a fault-tolerant, error-corrected framework suffers from a conservation of unpleasantness. In general, no matter what error-correction technique is employed, there is always one element of a universal gate set that carries a significant resource overhead---either in physical qubits, computational time, or both. Specifically, this is due to the application of non-Clifford gates. A common method for realizing these gates for stabilizer codes such as the surface code is a combination of three protocols: state injection, distillation, and gate teleportation. These protocols contribute to the resource overhead compared with logical operations such as a CNOT gate and contribute to the qubit resources for any error-corrected quantum algorithm. In this paper, we introduce a very simple protocol to potentially reduce this overhead for non-Clifford gates: transversal injection. Transversal injection modifies the initial physical states of all data qubits in a stabilizer code before standard encoding and results in the direct preparation of a large class of single qubit states, including resource states for non-Clifford logic gates. Preliminary results hint at high-quality fidelities at larger distances and motivate further research on this technique.
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.
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≥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.
Quantum computing relies on quantum error correction for high-fidelity logical operations, but scaling to achieve near-term quantum utility is highly resource-intensive. High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge. Apart of the lattice surgery approach, standard schemes for realizing logical gates have so far been restricted to performing global operations on all logical qubits at the same time. Another approach relies on low-rate code switching methods. In this work, we introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual logical qubits encoded within one or more quantum LDPC codes. Our scheme leverages logical transversal operations via an auxiliary Bacon-Shor code to perform logical operations with constant time overhead enabled by teleportation. We demonstrate the implementation of an overcomplete logical Clifford gate set and perform numerical simulations to evaluate the error-correction performance of our protocol. Finally, we observe that our scheme can be integrated with magic state cultivation protocols to achieve universal, gate-based, and fully addressable quantum computation.