The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks. However, incorporating quantum gates for performing error correction potentially introduces more sources of quantum decoherence into the quantum computers. In this scenario, the primary challenge is to find the sufficient condition required by each of the quantum gates for beneficially employing QECCs in order to yield reliability improvements given that the quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by firstly presenting the general framework of protecting quantum gates by the amalgamation of the transversal configuration of quantum gates and quantum stabilizer codes (QSCs), which can be viewed as syndrome-based QECCs. Secondly, we provide examples of the advocated framework by invoking quantum topological error correction codes (QTECCs) for protecting both transversal Hadamard gates and CNOT gates. The simulation and analytical results explicitly show that by utilizing QTECCs, the fidelity of the quantum gates can be beneficially improved, provided that quantum gates satisfying a certain minimum depolarization fidelity threshold (Fth) are available. For instance, for protecting transversal Hadamard gates, the minimum fidelity values required for each of the gates in order to attain fidelity improvements are 99.74%, 99.73%, 99.87%, and 99.86%, when they are protected by colour, rotated-surface, surface, and toric codes, respectively. These specific Fthvalues are obtained for a very large number of physical qubits (n → ∞), when the quantum coding rate of the QTECCs approaches zero (rQ→ 0). Ultimately, the framework advocated can be beneficially exploited for employing QSCs to protect large-scale quantum computers.
The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks. However, incorporating quantum gates for performing error correction potentially introduces more sources of quantum decoherence into the quantum computers. In this scenario, the primary challenge is to find the sufficient condition required by each of the quantum gates for beneficially employing QECCs in order to yield reliability improvements given that the quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by firstly presenting the general framework of protecting quantum gates by the amalgamation of the transversal configuration of quantum gates and quantum stabilizer codes (QSCs), which can be viewed as syndrome-based QECCs. Secondly, we provide examples of the advocated framework by invoking quantum topological error correction codes (QTECCs) for protecting both transversal Hadamard gates and CNOT gates. The simulation and analytical results explicitly show that by utilizing QTECCs, the fidelity of the quantum gates can be beneficially improved, provided that quantum gates satisfying a certain minimum depolarization fidelity threshold (Fth) are available. For instance, for protecting transversal Hadamard gates, the minimum fidelity values required for each of the gates in order to attain fidelity improvements are 99.74%, 99.73%, 99.87%, and 99.86%, when they are protected by colour, rotated-surface, surface, and toric codes, respectively. These specific Fthvalues are obtained for a very large number of physical qubits (n → ∞), when the quantum coding rate of the QTECCs approaches zero (rQ→ 0). Ultimately, the framework advocated can be beneficially exploited for employing QSCs to protect large-scale quantum computers.
The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks. However, the laws of quantum mechanics prevent us from directly invoking the mature family of classical error correction codes in the quantum domain. In order to circumvent the associated problems, the notion of quantum stabilizer codes (QSCs) was proposed in conjunction with syndrome-based decoding in the quantum regime. However, most of the powerful QSC schemes require long codewords for achieving a high performance, which potentially imposes additional challenges for implementation concerning their implementation, since their decoding may require longer than the quantum circuit's coherence time. Hence at the time of writing, QSCs exhibiting short to moderate codeword lengths are preferable. We commence by describing the pivotal problem encountered by classical error-correction codes, which also emerges when designing the QSCs, namely the intrinsic trade-off between the minimum distance versus coding rate. The complete formulation of this particular trade-off does not exist, but several lower and upper bounds can be found in the literature. It has been shown that a substantial gap can be observed between the upper and lower bound of the minimum distance, given the codeword length and the quantum coding rate. Hence, we propose an appealingly simple and invertible analytical approximation, for characterizing the trade-off between the quantum coding rate and the minimum distance of QSCs as well as their corresponding quantum bit error rate (QBER) performance upper-bound. For example, for a half-rate QSC having a codeword length of n = 128, the minimum distance is bounded by 11 < d < 22, while our approximation yields a minimum distance of d = 17 for the above-mentioned code. Next, we link this parametric study of the minimum distance versus quantum coding rate to the popular QSCs, namely to the family of quantum topological error correction codes (QTECCs). In order to construct the classical-to-quantum isomorphism, we conceive and investigate the family of classical topological error correction codes (TECCs), assuming that the bits of a codeword can be arranged in a lattice structure. We then present the classical-to-quantum isomorphism to pave the way for constructing their dual pairs in the quantum domain, which are the QTECCs. Finally, we characterize the performance of QTECCs in the face of the quantum depolarizing channel in terms of both their QBER and fidelity. Specifically, we demonstrate that for quantum coding rate rQ ~ 0, the threshold probability of the QBER below which the colour, rotated-surface, surface, and toric codes become capable of improving the uncoded QBER are given by 1.8 ×10-2, 1.3 ×10-2, 6.3 ×10-2 and 6.8 ×10-2, respectively. Furthermore, we also demonstrate that we can achieve beneficial fidelity improvements above the minimum fidelity of 0.94, 0.97 and 0.99 by employing the rQ = 1/7 colour code, the rQ = 1/9 rotated-surface code, and the rQ = 1/13 surface code, respectively. However, QSCs require additional quantum gates for their employment. Incorporating more quantum gates for performing error correction potentially introduces further sources of quantum decoherence into quantum computers. In this scenario, the primary challenge is to find the sufficient condition required by each of the quantum gates for beneficially employing QECCs in order to yield reliability improvements, given that the quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by firstly presenting the general framework of protecting quantum gates by the amalgamation of the transversal configuration of quantum gates and QSCs, which can be viewed as syndrome-based QECCs. Secondly, we provide examples of the advocated framework by invoking QTECCs for protecting both transversal Hadamard gates and controlled (CNOT) gates. Both our simulation and analytical results explicitly show that by utilizing QTECCs, the fidelity of the quantum gates can be beneficially improved, provided that quantum gates satisfying a certain minimum depolarization fidelity threshold (Fth) are available. For instance, for protecting transversal Hadamard gates, the minimum fidelity values required for each of the gates in order to attain fidelity improvements are 99.74%, 99.73%, 99.87%, and 99.86%, when they are protected by colour, rotated-surface, surface, and toric codes, respectively. Unfortunately, these specific Fth values can only be obtained for a very large number of physical qubits (n → ∞), when the quantum coding rate of the QTECCs approaches zero (rQ → 0). Finally, in order to conceive QSCs exhibiting a high quantum coding rate, we modify the construction of QTECCs for conceiving a low-complexity concatenated quantum turbocode (QTC). The above-mentioned high quantum coding rate is obtained by combining the quantum-domain version of short-block codes (SBCs) also known as single parity-check (SPC) codes as the outer codes and quantum unity-rate codes (QURCs) as the inner codes. Despite its design simplicity, the proposed QTC yields a near-hashing-bound error correction performance. For instance, compared to the best half-rate QTC known in the literature, namely the quantum irregular convolutional codes (QIrCCs) combined with the QURC scheme, which operates at the distance of D = 0.037 from the quantum hashing bound, our novel QSBC-QURC scheme can operate at the lower distance of D = 0:029. It is also worth mentioning that this is the first instantiation of QTCs capable of adjusting the quantum encoders according to the quantum coding rate required for mitigating the Pauli errors imposed by the time-variant depolarizing probabilities of the quantum channel.
Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.
In this thesis we present three main contributions to the field of topological quantum error correcting codes. We focus on some of the properties of such codes required for fault-tolerant quantum computation. Prior work has concentrated on determining error rate thresholds of particular models, but increasingly other parameters are gaining prominence. One of these is the overhead -- the quantity of a named resource required to achieve a desired level of performance from the code. We characterise the qubit overhead of the toric code in a fault-tolerant setting. These results provide a general framework for determining the overhead for other code constructions with more complicated noise models. Next we introduce a decoding algorithm, applicable to topological codes in a qudit architecture, specifically those where fault-tolerance is achieved through repeated syndrome measurements. It is computationally light and capable of decoding qudits of arbitrarily high dimension with negligible increase in its run time. The threshold of the decoder is limited by the percolation of the syndromes. Using local matching techniques we are able to overcome this limitation, increasing the threshold by almost a factor of two for high qudit dimensions. Finally, we turn our attention to a second family of topological quantum codes: the colour codes. In three and higher spatial dimensions such codes can support transversal non-Clifford gates. We show, using a technique that we call a star-bipartition of the vertices of the lattice, that any existing qubit colour code lattice can be used to define a qudit colour code. By generalising the notion of triorthogonal matrices we derive analogous transversality properties in the qudit codes.
This paper proposes a novel quantum error correction code leveraging the inherent entanglement preservation properties of topological quantum states. Traditional quantum error correction schemes rely on creating and maintaining fragile quantum entanglement, which is highly susceptible to environmental noise. Our approach utilizes the topologically protected nature of certain quantum states to provide a robust mechanism for error detection and correction. We formulate a code based on the controlled-Z operation within a topological qubit architecture, demonstrating a significant improvement in error correction capabilities compared to conventional approaches. Specifically, we define the code parameters, including the code rate, minimum distance, and the required number of physical qubits. We analyze the code's performance under various noise models, highlighting the enhanced resilience due to topological protection. The key innovation lies in harnessing the natural, robust entanglement provided by topological states, offering a pathway to more practical and reliable quantum computation. The theoretical framework presented here provides a foundation for future research and development in topological quantum error correction.
Quantum computers are far more error-prone than their classical counterparts. Therefore, to build a quantum computer capable of running large-scale quantum algorithms, we must use the techniques of quantum error correction to ensure that the computer produces the correct output even when its components are unreliable. However, the resource requirements of building such a fault-tolerant quantum computer are currently prohibitive. Here, we examine the utility of using three-dimensional (3D) surface codes in a fault-tolerant quantum computer. This family of topological error-correcting codes is a generalization of the well-known 2D surface code to three spatial dimensions. We show that certain 3D surface codes have a transversal logical non-Clifford gate. In a quantum computing architecture, a non-Clifford gate is required to achieve computational universality. Transversal gates do not entangle qubits in different codes, so they are naturally fault tolerant because they do not spread errors. Next, we consider the problem of decoding 3D surface codes. In a quantum error-correcting code, we cannot observe the qubits directly, so we measure parity-check operators to gain information about the state of the code. Decoding is the problem of estimating what error has occurred given a list of unsatisfied parity checks. We observe that 3D surface codes offer asymmetric protection against bit-flip and phase-flip errors, but in both cases, we find that a threshold error rate exists below which we can suppress logical errors by increasing the size of the code. We use our results about logical gates and decoding to propose two fault-tolerant quantum computing architectures that utilize 3D surface codes. Finally, we compare the resource requirements of our architectures with the requirements of leading quantum computing architectures based on topological codes. We find that one of our architectures may be competitive with the leading architectures, depending on the properties of the physical systems used to build the qubits.
Quantum computing can transform a great deal and this may be in the realms of cryptography, optimisation, as well as material science. However, it requires decoherence and gate imperfection which introduces large error rates thus are difficult to implement. The solution to these problems is a fundamental skill of making computing fault-tolerant by means of Quantum Error Correction Codes (QECCs). This paper gives a comparison of three common QECCs namely Shor, Steane and Surface Codes as well as creating a new Hybrid Code by combining the most desirable characteristics of the concatenated and topological codes. The Hybrid Code was executed and tried out with the Qiskit software where real depolarising noise models were utilised. It showed better performance in terms of logical fidelity, error rate suppression, resource overhead, and execution time. The results of the simulation show that the Hybrid Code always does better than traditional codes. This means that it might be used in scalable quantum structures. The work shows how important it is to balance performance and complexity, and it gives a useful model for the next generation of quantum error correction systems.