In this paper, we investigate the transversality of pairs of CSS codes and their use in the second generation of quantum repeaters (QR)s. We show that different stations of quantum link can experience different errors. Considering this fact, we suggest to use different CSS codes in different stations. We also suggest to use
[[n,k]] codes with
k>1 as they are more efficient then codes with
k=1. We establish sufficient and necessary conditions for a pair of CSS codes to be non-local CNOT-transversal. We show that in contrast to the well known CNOT transversality which states that two CSS codes should be the same, less restrictive constraints are needed. Next, we establish sufficient and necessary conditions for a code pair to be CZ-transversal.
We consider 2nd generation (2G) Quantum Repeaters (QR) for creating long-distance entanglement in quantum networks. Combining a distance-dependent depolarizing error model with the non-local Bell-state purification procedure required by 2G QRs leads to an error model consisting of correlated and biased errors. To correct correlated errors, non-symmetric CSS codes with joint decoding between stations can be used. The dominating errors are biased, such that different repeater stations suffer from different types of errors. To mitigate this, different quantum codes can be used at the stations, optimized for the specific error model of the station. To comply with the 2G QR procedure, the codes used in neighboring stations must allow for the transversal implementation of non-local logical CNOT gates across the two stations, or alternatively, non-local CZ gates combined with logical Hadamards. We provide a complete characterization of pairs of Calderbank-Steane-Shor (CSS) codes that allow CNOT- or CZ-transversality, and examine an explicit family of mirrored CSS codes allowing CZ-transversality. We verify the Hadamard gate transversality using our framework and show the importance of the mapping matrix. Also, we conclude that using different QECCs can not achieve transversal universal computation with Clifford +
T-gate set. Finally, we study the entanglement generation rate (EGR) in 2G QRs with limited quantum memory, minimizing the number of intermediate stations for a given fidelity and EGR. By simulation we observe that non-symmetric and mirrored structure QECCs outperform the conventional approach of using symmetric CSS codes at the repeater stations.
For achieving long-distance quantum communication, Quantum Repeaters (QRs) have to be used, with commu-nication range and reliability increased by using intermediate stations. The physical requirements of second generation QRs may be achievable in the near future. They use Quantum Error Correction Codes (QECC) to protect logical qubits against environmental interaction using physical redundancy. In this work, we study the types of errors that can corrupt quantum codewords in intermediate stations. Our studies show that the errors are distance-dependent, and also consist of correlated errors and biased errors. To mitigate this error model, we use non-symmetric CSS codes as well as mirrored structure coding. We show that using non-symmetric CSS codes results in better performance. Also, we prove the logical CZ gate transversality of the mirrored structure coding. The effectiveness of the proposed methods is verified by numerical simulations.
Calderbank-Shor-Steane (CSS) codes, constructed from nested classical codes
C2⊆C1, are typically optimized for good code parameters. However, practical quantum computing equally demands fault-tolerant logical gates. In this work, we characterize nested pairs
(C1,C2) whose resulting CSS codes realize a target logical diagonal gate via transversal physical
Z-rotations. In doing so, we recover a result of Camps-Moreno et al. that CSS codes can realize only logical single-qubit
Z-rotations and multi-qubit controlled
Z-rotations via transversal physical
Z-rotations. Building on our characterization, we develop the ''appending construction'', that takes as input an
[[n′,k′]] CSS code
Q′ and a target logical
Z-rotation (single-qubit or multi-controlled)
UL, and extends
Q′ by systematically appending
n′′ physical qubits to obtain an
[[n,k]] CSS code
Q with
n=n′+n′′ and
k=k′. The target logical gate
UL is realized in
Q by applying a well-chosen physical transversal
Z-rotation to the
n′′ appended physical qubits. Moreover, any logical gate realized via transversal physical
Z-rotations in the input code
Q′ remains transversally realizable in the extended code
Q. The CSS code
Q may incur a loss in minimum distance, but the loss can be controlled through the parameter choices made in the construction. By repeatedly applying the appending construction, we can extend any CSS code
Q′ to obtain a CSS code
Q that supports fault-tolerant implementations of multiple desired logical
Z-rotations. The cost to be paid for this is the increased physical qubit overhead as the number of target logical gates grows. To illustrate our methodology, we construct CSS code families that transversally realize addressable logical single-qubit and multi-controlled
Z-rotations.
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.
In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of these gates and characterize the subgroups that induce tensor products of single-qubit logical gates and logical identities. We describe these groups through explicit linear equations given by componentwise products of basis vectors of the underlying classical codes, which is the key difference from previous approaches. We compute the complete set of diagonal transversal gates fixing the code, and of transversal logical gates, for any CSS code arising from monomial codes, a family that includes decreasing monomial codes and polar codes. As a consequence, we recover and extend some results in the literature on CSS-T codes, triorthogonal codes, and divisible codes. We also extend these results to diagonal gates acting transversally on several code blocks and use them to characterize addressable gates.