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

A loophole in quantum error correction

Xavier Waintal

Published Feb 24, 2017• 0 citations
OpenAlex

Abstract

A quantum error correction (QEC) code uses $N_{\rm c}$ quantum bits to construct one quantum bits of better quality than the original ones. QEC theory predicts that the failure probability $p_L$ of logical qubits decreases exponentially with $N_{\rm c}$ provided the failure probability $p$ of the physical qubit is below a certain threshold $p<p_{\rm th}$. In particular QEC theorems imply that the logical qubits can be made arbitrarily precise by simply increasing $N_{\rm c}$. In this letter, we search for physical mechanisms that lie outside of the hypothesis of QEC theorems and set a limit $\eta_{\rm L}$ to the precision of the logical qubits (irrespectively of $N_{\rm c}$). $\eta_{\rm L}$ directly controls the maximum number of operations $\propto 1/\eta_{\rm L}^2$ that can be performed before the logical quantum state gets randomized, hence the depth of the quantum circuits that can be considered. We identify a type of error - silent stabilizer failure - as a mechanism responsible for finite $\eta_{\rm L}$ and discuss its possible causes. Using the example of the topological surface code, we show that a single local event can provoke the failure of the logical qubit, irrespectively of $N_c$.

Related papers

What determines the ultimate precision of a quantum computer

Xavier Waintal

A quantum error correction (QEC) code uses ${N}_{\mathrm{c}}$ quantum bits to construct one ``logical'' quantum bit of better quality than the original ``physical'' ones. QEC theory predicts that the failure probability ${p}_{L}$ of logical qubits decreases exponentially with ${N}_{\mathrm{c}}$ provided the failure probability $p$ of the physical qubit is below a certain threshold $p<{p}_{\mathrm{th}}$. In particular, QEC theorems imply that the logical qubits can be made arbitrarily precise by simply increasing ${N}_{c}$. In this article, we search for physical mechanisms that lie outside of the hypothesis of QEC theorems and set a limit ${\ensuremath{\eta}}_{\mathrm{L}}$ to the precision of the logical qubits (irrespectively of ${N}_{c}$). ${\ensuremath{\eta}}_{\mathrm{L}}$ directly controls the maximum number of operations $\ensuremath{\propto}1/{\ensuremath{\eta}}_{\mathrm{L}}^{2}$ that can be performed before the logical quantum state gets randomized, hence the depth of the quantum circuits that can be considered. We identify a type of error---silent stabilizer failure---as a mechanism responsible for finite ${\ensuremath{\eta}}_{\mathrm{L}}$ and discuss its possible causes. Using the example of the topological surface code, we show that a single local event can provoke the failure of the logical qubit, irrespectively of ${N}_{c}$.

arXiv:1702.07688•Physical Review A•Apr 10, 2019•12 citations

Qubit Error Correction in Quantum Computing Simulations: Do Larger Repetition Codes Reduce Logical Errors?

Sanjeev Tamilselvan, Tanuj Ranjith

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.

•Jun 12, 2026•0 citations

Qubit Error Correction in Quantum Computing Simulations: Do Larger Repetition Codes Reduce Logical Errors?

Sanjeev Tamilselvan, Tanuj Ranjith

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.

•Mar 31, 2026•0 citations

Ising on the donut: Regimes of topological quantum error correction from statistical mechanics

Lucas H. English, Sam Roberts, Stephen D. Bartlett +2 more

Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analysing QEC performance. However, predicting the behaviour of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly-solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansatze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.

quant-pharXiv:2512.10399•PRX Quantum•Dec 12, 2025•8 citations

Quantum Error Correction: Exponential Suppression of Logical Errors via Code Distance Scaling and Physical Qubit Encoding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum error correction (QEC) achieves fault‑tolerant logical qubits by encoding a single logical qubit into multiple physical qubits, enabling error rates to be suppressed exponentially with code distance. | MATH: Logical error rate \(p_L \approx \alpha (p/p_{\text{th}})^{d/2}\) where \(p\) is physical error probability, \(p_{\text{th}}\) the threshold, \(d\) the code distance, and \(\alpha\) a constant; Shor code uses 9 qubits, Steane code uses 7, surface code uses a 2‑D lattice with distance \(d\). | CONNECTION: The surface code lattice exhibits a 4‑fold rotational symmetry and a checkerboard pattern akin to crystallographic \(p4mm\) symmetry; the logical operators correspond to non‑contractible loops on a torus, reflecting topological order. No direct appearance of golden ratio or base‑60 numbers. | DEPTH: 8 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations

Quantum Error Correction Phase Transition (QECP)

Jincheng Zhang

The ability of quantum error correction (QEC) to protect logical qubits against physical noise is traditionally quantified by a noise threshold: a critical noise level below which the logical error rate decreases exponentially with code distance. This paper proposes that QEC itself can undergo a phase transition analogous to a physical phase change. We develop a theoretical framework that treats the logical error rate as an order parameter and maps the behavior of large stabilizer codes onto a statistical mechanics model. By analyzing the scaling of logical error probabilities with code distance and noise strength, we identify a continuous phase transition at the threshold, characterized by critical exponents that depend on the code family and noise model. The transition separates a "fault‑tolerant" phase where logical errors are exponentially suppressed from a "fault‑unreliable" phase where logical errors proliferate. We discuss implications for the design of large‑scale quantum computers, potential experimental signatures in current quantum hardware, and the prospect of discovering new quantum information physics through this phase‑transition perspective.

•Aug 17, 2026•0 citations
A quantum error correction (QEC) code uses NcN_{\rm c}Nc​ quantum bits to construct one quantum bits of better quality than the original ones. QEC theory predicts that the failure probability pLp_LpL​ of logical qubits decreases exponentially with NcN_{\rm c}Nc​ provided the failure probability ppp of the physical qubit is below a certain threshold p<pthp<p_{\rm th}p<pth​. In particular QEC theorems imply that the logical qubits can be made arbitrarily precise by simply increasing NcN_{\rm c}Nc​. In this letter, we search for physical mechanisms that lie outside of the hypothesis of QEC theorems and set a limit ηL\eta_{\rm L}ηL​ to the precision of the logical qubits (irrespectively of NcN_{\rm c}Nc​). ηL\eta_{\rm L}ηL​ directly controls the maximum number of operations ∝1/ηL2\propto 1/\eta_{\rm L}^2∝1/ηL2​ that can be performed before the logical quantum state gets randomized, hence the depth of the quantum circuits that can be considered. We identify a type of error - silent stabilizer failure - as a mechanism responsible for finite ηL\eta_{\rm L}ηL​ and discuss its possible causes. Using the example of the topological surface code, we show that a single local event can provoke the failure of the logical qubit, irrespectively of NcN_cNc​.
A quantum error correction (QEC) code uses Nc{N}_{\mathrm{c}}Nc​ quantum bits to construct one ``logical'' quantum bit of better quality than the original ``physical'' ones. QEC theory predicts that the failure probability pL{p}_{L}pL​ of logical qubits decreases exponentially with Nc{N}_{\mathrm{c}}Nc​ provided the failure probability ppp of the physical qubit is below a certain threshold p<pthp<{p}_{\mathrm{th}}p<pth​. In particular, QEC theorems imply that the logical qubits can be made arbitrarily precise by simply increasing Nc{N}_{c}Nc​. In this article, we search for physical mechanisms that lie outside of the hypothesis of QEC theorems and set a limit ${\ensuremath{\eta}}_{\mathrm{L}}$ to the precision of the logical qubits (irrespectively of Nc{N}_{c}Nc​). ${\ensuremath{\eta}}_{\mathrm{L}}$ directly controls the maximum number of operations $\ensuremath{\propto}1/{\ensuremath{\eta}}_{\mathrm{L}}^{2}$ that can be performed before the logical quantum state gets randomized, hence the depth of the quantum circuits that can be considered. We identify a type of error---silent stabilizer failure---as a mechanism responsible for finite ${\ensuremath{\eta}}_{\mathrm{L}}$ and discuss its possible causes. Using the example of the topological surface code, we show that a single local event can provoke the failure of the logical qubit, irrespectively of Nc{N}_{c}Nc​.
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.
Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analysing QEC performance. However, predicting the behaviour of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly-solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansatze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.
FINDING: Quantum error correction (QEC) achieves fault‑tolerant logical qubits by encoding a single logical qubit into multiple physical qubits, enabling error rates to be suppressed exponentially with code distance. | MATH: Logical error rate pL≈α(p/pth)d/2p_L \approx \alpha (p/p_{\text{th}})^{d/2}pL​≈α(p/pth​)d/2 where ppp is physical error probability, pthp_{\text{th}}pth​ the threshold, ddd the code distance, and α\alphaα a constant; Shor code uses 9 qubits, Steane code uses 7, surface code uses a 2‑D lattice with distance ddd. | CONNECTION: The surface code lattice exhibits a 4‑fold rotational symmetry and a checkerboard pattern akin to crystallographic p4mmp4mmp4mm symmetry; the logical operators correspond to non‑contractible loops on a torus, reflecting topological order. No direct appearance of golden ratio or base‑60 numbers. | DEPTH: 8 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
The ability of quantum error correction (QEC) to protect logical qubits against physical noise is traditionally quantified by a noise threshold: a critical noise level below which the logical error rate decreases exponentially with code distance. This paper proposes that QEC itself can undergo a phase transition analogous to a physical phase change. We develop a theoretical framework that treats the logical error rate as an order parameter and maps the behavior of large stabilizer codes onto a statistical mechanics model. By analyzing the scaling of logical error probabilities with code distance and noise strength, we identify a continuous phase transition at the threshold, characterized by critical exponents that depend on the code family and noise model. The transition separates a "fault‑tolerant" phase where logical errors are exponentially suppressed from a "fault‑unreliable" phase where logical errors proliferate. We discuss implications for the design of large‑scale quantum computers, potential experimental signatures in current quantum hardware, and the prospect of discovering new quantum information physics through this phase‑transition perspective.