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

arXiv:2609.20708

Proof of a positive coherent-error threshold for topological quantum codes

Shiro Tamiya, Masato Koashi

quant-phSubmitted Sep 17, 2026• Announced Sep 18, 2026• 1 citation
arXivHTMLPDF

Abstract

Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted $Z$ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent $Z$-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof combines Fourier analysis to retain the interference among the amplitudes of coherent errors with the cluster expansion of abstract polymer models. Our results expand the theoretical foundation of quantum error correction and offer a statistical-mechanical description of quantum error correction beyond stochastic errors.

AI Summary

Does syndrome measurement followed by Pauli recovery give a nonzero threshold for coherent errors without twirling? This paper addresses that question in the code-capacity setting for product errors $U=\bigotimes_j e^{i\theta_j Z_j}$ on CSS QLDPC codes, with noiseless syndrome extraction and maximum-likelihood Pauli recovery determined using the rotation angles. For an $(r,c)$-QLDPC family encoding $1\leq k\leq k_0$ logical qubits, define $\Delta_0=c(r-1)$ and $\delta_*=\sup_{i,j}|\tan(2\theta_{i,j})|$. If $0<\delta_*<\delta_{\mathrm{th}}=1/\{e[(e+1)\Delta_0+1]\}$, the recovered entanglement infidelity satisfies $1-F_e\leq(2^{k_0}-1)^2n e^{-bd_Z}$, where $b=\tfrac12\log(\delta_{\mathrm{th}}/\delta_*)$ and $d_Z\geq d$. Thus infidelity, and also logical diamond distance, vanish when $d/\log n\to\infty$. For rotated planar surface codes, the sufficient angle bound is $\max_j|\theta_j|<\tfrac12\arctan[1/(e(6e+7))]\approx0.0025\pi$. The proof bounds decoding failure by pairwise amplitude overlaps between distinct logical classes. Fourier analysis converts these overlaps into Fourier $1$-norm estimates while retaining interference. A polymer representation and convergent cluster expansion then cancel logically trivial contributions; surviving clusters have total size at least $d_Z$, producing exponential suppression. The result does not cover noisy syndrome extraction, circuit-level coherent faults, or practical decoders such as minimum-weight decoding. The threshold bound is substantially below numerical estimates. Before imposing bounded $k$, the prefactor is $(2^k-1)^2$, limiting applicability to high-rate families with sublinear distance.

No sign of AI-generated textStrong assumptions

Error found: The abstract omits the CSS restriction required by the theorem and proof when describing the covered QLDPC codes. The abstract omits the assumption of ideal syndrome measurement, so the stated threshold should explicitly be identified as a code-capacity threshold. The abstract's general threshold-existence statement omits a distance-growth qualification needed to obtain vanishing infidelity from the proved bound C n exp(-b d).

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
21 pages, 1 figure

Related papers

Proof of a positive coherent-error threshold for topological quantum codes — E8 Intelligence Research

Andrew Stewart Caldin

Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted $Z$ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent $Z$-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof com Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations

Coherent error threshold for quantum LDPC codes

Zhengyi Han, Yuanchen Zhao, Yijia Xu +2 more

A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance $d=Ω(\log n)$, we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.

quant-pharXiv:2609.20537•Sep 18, 2026•1 citation

Statistical Mechanical Mapping and Maximum-Likelihood Thresholds for the Surface Code under Generic Single-Qubit Coherent Errors

Jan Behrends, Benjámin Béri

The surface code, one of the leading candidates for quantum error correction, is known to protect encoded quantum information against stochastic, i.e., incoherent errors. The protection against coherent errors, such as from unwanted gate rotations, is however understood only for special cases, such as rotations about the X or Z axes. Here we consider generic single-qubit coherent errors in the surface code, i.e., rotations by angle α about an axis that can be chosen arbitrarily. We develop a statistical mechanical mapping for such errors and perform entanglement analysis in transfer matrix space to numerically establish the existence of an error-correcting phase, which we chart in a subspace of rotation axes to estimate the corresponding maximum-likelihood thresholds α th . The classical statistical mechanics model we derive is a random-bond Ising model with complex couplings and four-spin interactions (i.e., a complex-coupled Ashkin-Teller model). The error-correcting phase, α < α th , where the logical error rate decreases exponentially with code distance, is shown to correspond in transfer matrix space to a gapped one-dimensional quantum Hamiltonian exhibiting spontaneous breaking of a Z 2 symmetry. Our numerical results rest on two key ingredients: (i) we show that the state evolution under the transfer matrix, a nonunitary ( 1 + 1 ) -dimensional quantum circuit, can be efficiently numerically simulated using matrix product states; and (ii) based on this approach, we also develop an algorithm to (approximately) sample syndromes based on their Born probability. The α th values we find show that the maximum-likelihood thresholds for coherent errors are larger than those for the corresponding incoherent errors (from the Pauli twirl), and significantly exceed the values found using minimum weight perfect matching.

arXiv:2410.22436•PRX Quantum•Jul 28, 2025•21 citations

Correcting coherent errors with surface codes

Sergey B. Bravyi, Matthias Englbrecht, Robert König +1 more

Abstract Surface codes are building blocks of quantum computing platforms based on 2D arrays of qubits responsible for detecting and correcting errors. The error suppression achieved by the surface code is usually estimated by simulating toy noise models describing random Pauli errors. However, Pauli noise models fail to capture coherent processes such as systematic unitary errors caused by imperfect control pulses. Here we report the first large-scale simulation of quantum error correction protocols based on the surface code in the presence of coherent noise. We observe that the standard Pauli approximation provides an accurate estimate of the error threshold but underestimates the logical error rate in the sub-threshold regime. We find that for large code size the logical-level noise is well approximated by random Pauli errors even though the physical-level noise is coherent. Our work demonstrates that coherent effects do not significantly change the error correcting threshold of surface codes. This gives more confidence in the viability of the fault-tolerance architecture pursued by several experimental groups.

arXiv:1710.02270•npj Quantum Information•Oct 25, 2018•192 citations

Modeling coherent errors in quantum error correction

Daniel Greenbaum, Zachary Dutton

Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical data qubits result in both physical and logical error rates that differ significantly from those predicted by a Pauli model. Here we examine the accuracy of the Pauli approximation for noise containing coherent errors (characterized by a rotation angle ) under the repetition code. We derive an analytic expression for the logical error channel as a function of arbitrary code distance d and concatenation level n , in the small error limit. We find that coherent physical errors result in logical errors that are partially coherent and therefore non-Pauli. However, the coherent part of the logical error is negligible at fewer than error correction cycles when the decoder is optimized for independent Pauli errors, thus providing a regime of validity for the Pauli approximation. Above this number of correction cycles, the persistent coherent logical error will cause logical failure more quickly than the Pauli model would predict, and this may need to be combated with coherent suppression methods at the physical level or larger codes.

arXiv:1612.03908•Quantum Science and Technology•Dec 20, 2017•90 citations

Mixed-state topological order and error-correction thresholds in non-Abelian codes: rigorous results

Sun Woo P. Kim, Max McGinley

We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for noise strengths up to some explicit constant value, any initially encoded logical information can be recovered to high precision, and that the noise-corrupted state exhibits key hallmarks of mixed-state topological order: long-range entanglement and emergent higher-form symmetries. We also describe how these methods can be adapted to higher dimensions and correlated noise models.

quant-pharXiv:2607.21706•Jul 27, 2026•3 citations
Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted ZZZ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent ZZZ-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof combines Fourier analysis to retain the interference among the amplitudes of coherent errors with the cluster expansion of abstract polymer models. Our results expand the theoretical foundation of quantum error correction and offer a statistical-mechanical description of quantum error correction beyond stochastic errors.
Does syndrome measurement followed by Pauli recovery give a nonzero threshold for coherent errors without twirling? This paper addresses that question in the code-capacity setting for product errors U=⨂jeiθjZjU=\bigotimes_j e^{i\theta_j Z_j}U=⨂j​eiθj​Zj​ on CSS QLDPC codes, with noiseless syndrome extraction and maximum-likelihood Pauli recovery determined using the rotation angles.
For an (r,c)(r,c)(r,c)-QLDPC family encoding 1≤k≤k01\leq k\leq k_01≤k≤k0​ logical qubits, define Δ0=c(r−1)\Delta_0=c(r-1)Δ0​=c(r−1) and δ∗=sup⁡i,j∣tan⁡(2θi,j)∣\delta_*=\sup_{i,j}|\tan(2\theta_{i,j})|δ∗​=supi,j​∣tan(2θi,j​)∣. If 0<δ∗<δth=1/{e[(e+1)Δ0+1]}0<\delta_*<\delta_{\mathrm{th}}=1/\{e[(e+1)\Delta_0+1]\}0<δ∗​<δth​=1/{e[(e+1)Δ0​+1]}, the recovered entanglement infidelity satisfies 1−Fe≤(2k0−1)2ne−bdZ1-F_e\leq(2^{k_0}-1)^2n e^{-bd_Z}1−Fe​≤(2k0​−1)2ne−bdZ​, where b=12log⁡(δth/δ∗)b=\tfrac12\log(\delta_{\mathrm{th}}/\delta_*)b=21​log(δth​/δ∗​) and dZ≥dd_Z\geq ddZ​≥d. Thus infidelity, and also logical diamond distance, vanish when d/log⁡n→∞d/\log n\to\inftyd/logn→∞. For rotated planar surface codes, the sufficient angle bound is max⁡j∣θj∣<12arctan⁡[1/(e(6e+7))]≈0.0025π\max_j|\theta_j|<\tfrac12\arctan[1/(e(6e+7))]\approx0.0025\pimaxj​∣θj​∣<21​arctan[1/(e(6e+7))]≈0.0025π.
The proof bounds decoding failure by pairwise amplitude overlaps between distinct logical classes. Fourier analysis converts these overlaps into Fourier 111-norm estimates while retaining interference. A polymer representation and convergent cluster expansion then cancel logically trivial contributions; surviving clusters have total size at least dZd_ZdZ​, producing exponential suppression.
The result does not cover noisy syndrome extraction, circuit-level coherent faults, or practical decoders such as minimum-weight decoding. The threshold bound is substantially below numerical estimates. Before imposing bounded kkk, the prefactor is (2k−1)2(2^k-1)^2(2k−1)2, limiting applicability to high-rate families with sublinear distance.
Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted ZZZ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent ZZZ-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof com Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance d=Ω(log⁡n)d=Ω(\log n)d=Ω(logn), we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.
The surface code, one of the leading candidates for quantum error correction, is known to protect encoded quantum information against stochastic, i.e., incoherent errors. The protection against coherent errors, such as from unwanted gate rotations, is however understood only for special cases, such as rotations about the X or Z axes. Here we consider generic single-qubit coherent errors in the surface code, i.e., rotations by angle α about an axis that can be chosen arbitrarily. We develop a statistical mechanical mapping for such errors and perform entanglement analysis in transfer matrix space to numerically establish the existence of an error-correcting phase, which we chart in a subspace of rotation axes to estimate the corresponding maximum-likelihood thresholds α th . The classical statistical mechanics model we derive is a random-bond Ising model with complex couplings and four-spin interactions (i.e., a complex-coupled Ashkin-Teller model). The error-correcting phase, α < α th , where the logical error rate decreases exponentially with code distance, is shown to correspond in transfer matrix space to a gapped one-dimensional quantum Hamiltonian exhibiting spontaneous breaking of a Z 2 symmetry. Our numerical results rest on two key ingredients: (i) we show that the state evolution under the transfer matrix, a nonunitary ( 1 + 1 ) -dimensional quantum circuit, can be efficiently numerically simulated using matrix product states; and (ii) based on this approach, we also develop an algorithm to (approximately) sample syndromes based on their Born probability. The α th values we find show that the maximum-likelihood thresholds for coherent errors are larger than those for the corresponding incoherent errors (from the Pauli twirl), and significantly exceed the values found using minimum weight perfect matching.
Abstract Surface codes are building blocks of quantum computing platforms based on 2D arrays of qubits responsible for detecting and correcting errors. The error suppression achieved by the surface code is usually estimated by simulating toy noise models describing random Pauli errors. However, Pauli noise models fail to capture coherent processes such as systematic unitary errors caused by imperfect control pulses. Here we report the first large-scale simulation of quantum error correction protocols based on the surface code in the presence of coherent noise. We observe that the standard Pauli approximation provides an accurate estimate of the error threshold but underestimates the logical error rate in the sub-threshold regime. We find that for large code size the logical-level noise is well approximated by random Pauli errors even though the physical-level noise is coherent. Our work demonstrates that coherent effects do not significantly change the error correcting threshold of surface codes. This gives more confidence in the viability of the fault-tolerance architecture pursued by several experimental groups.
Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical data qubits result in both physical and logical error rates that differ significantly from those predicted by a Pauli model. Here we examine the accuracy of the Pauli approximation for noise containing coherent errors (characterized by a rotation angle ) under the repetition code. We derive an analytic expression for the logical error channel as a function of arbitrary code distance d and concatenation level n , in the small error limit. We find that coherent physical errors result in logical errors that are partially coherent and therefore non-Pauli. However, the coherent part of the logical error is negligible at fewer than error correction cycles when the decoder is optimized for independent Pauli errors, thus providing a regime of validity for the Pauli approximation. Above this number of correction cycles, the persistent coherent logical error will cause logical failure more quickly than the Pauli model would predict, and this may need to be combated with coherent suppression methods at the physical level or larger codes.
We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for noise strengths up to some explicit constant value, any initially encoded logical information can be recovered to high precision, and that the noise-corrupted state exhibits key hallmarks of mixed-state topological order: long-range entanglement and emergent higher-form symmetries. We also describe how these methods can be adapted to higher dimensions and correlated noise models.