Quantum Computing is a computing framework that takes advantage of unique quantum mechanical properties (such as superposition and entanglement) to perform calculations and implement algorithms that could offer exponential speed-ups over classical computing. However, in physical implementations of such quantum computers, qubits – the fundamental components of these systems – can accumulate errors that must be accounted for. In order to mitigate these errors, various quantum error correction (QEC) codes have been developed, including the repetition code and surface codes. In this experiment I implement and evaluate three types of QEC codes on the Qiskit simulator to compare their efficacy and applicability in correcting for different kinds of errors. I hypothesize that surface codes, with their more effective design and range of correction methods, should perform the best with much lower error thresholds and resultant logical error rates. The results support the hypothesis and suggest that surface codes are a viable method of implementing scalable error correction in quantum computers.
Quantum Computing is a computing framework that takes advantage of unique quantum mechanical properties (such as superposition and entanglement) to perform calculations and implement algorithms that could offer exponential speed-ups over classical computing. However, in physical implementations of such quantum computers, qubits – the fundamental components of these systems – can accumulate errors that must be accounted for. In order to mitigate these errors, various quantum error correction (QEC) codes have been developed, including the repetition code and surface codes. In this experiment I implement and evaluate three types of QEC codes on the Qiskit simulator to compare their efficacy and applicability in correcting for different kinds of errors. I hypothesize that surface codes, with their more effective design and range of correction methods, should perform the best with much lower error thresholds and resultant logical error rates. The results support the hypothesis and suggest that surface codes are a viable method of implementing scalable error correction in quantum computers.
This paper presents our comprehensive understanding of quantum error correction (QEC) through a systematic exploration from fundamental quantum phenomena to advanced error correction schemes. Beginning with quantum entanglement and Bell states, we demonstrate how these foundational concepts enable quantum telepor-tation and ultimately lead to sophisticated error correction protocols. Our analy- sis covers the three fundamental types of quantum errors—bit-flip, phase-flip, and combined errors—and examines three major error correction approaches: the 3- qubit repetition code, Shor’sinnovative 9- qubit code, and topological surface codes. Through detailed mathematical derivations and comparative analysis, we reveal how quantum mechanics’ unique properties, initially seen as obstacles, become powerful resources for protecting quantum information. Our investigation shows that surface codes, with their high error threshold and hardware compatibility, represent the most promising path toward practical fault-tolerant quantum computing.
Quantum Error Correction (QEC) is essential for achieving fault-tolerant quantum computation, enabling the protection of fragile quantum information from decoherence and noise. While classical Forward Error Correction (FEC) codes have been highly effective in digital communication systems, their direct application to quantum systems is inadequate mainly due to the no cloning theorem and the continuous nature of quantum errors. Unlike classical FECs, QEC is designed to detect and correct both bit-flip and phase-flip errors without disturbing the encoded quantum state. This paper presents the code structure design and simulation of two quantum error correction codes—the Planar surface code and the 5-qubit Perfect code—using Qiskit and Stim on Google Colab. It is worth mentioning here that the performance of the Steane [ [7], [1], [3]] code is included in the current work as a benchmark. The codes are evaluated under statistical noise models, including amplitude damping and dephasing, which closely mirror the physical behavior of quantum hardware. The primary performance metric, for performance assessment, is the logical error rate, evaluated across a range of physical error rates and code distances under each noise model. The simulation results show that increasing the distance of the Planar code significantly reduces the logical error rates, demonstrating superior performance compared to other similar codes under this study.
Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.
Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.
The issue of error-prone quantum information obstructs the progress of quantum computing, notwithstanding its capacity to transform complex problem-solving. This study examines the impact of depolarizing noise on a 5-qubit, distance-2 surface code, representing a fundamental quantum error correcting (QEC) frame- work. The primary objective is to identify a breakeven error rate beneath which error correction remains effective. We assess logical error rates through simu- lation across different noise levels, identifying a crucial breakeven threshold at around a 10% error rate. Below this level, the surface code exhibits proficient mistake detection; but, beyond this point, the effectiveness of repair diminishes significantly. We examine quantum error mitigation (QEM) techniques such as syndrome amplification and post-selection to evaluate their efficacy in minimiz- ing errors within the threshold range. We also noted spatial connections in error patterns, suggesting possible pathways for focused mistake correction. These find- ings elucidate the functioning of quantum error correction (QEC) in small-scale codes and underscore the necessity for noise-aware QEC techniques in scalable quantum systems.
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.