Fundamental Thresholds for Computational and Erasure Errors via the Coherent Information

Quantum error correcting (QEC) codes protect quantum information against environmental noise. Computational errors caused by the environment change the quantum state within the qubit subspace, whereas quantum erasures correspond to the loss of qubits at known positions. Correcting either type of error involves different correction mechanisms, which makes studying the interplay between erasure and computational errors particularly challenging. In this work, we propose a framework based on the coherent information (CI) of the mixed-state density operator associated to noisy QEC codes, for treating both types of errors together. We show how to rigorously derive different families of statistical mechanics mappings for generic stabilizer QEC codes in the presence of both types of errors. We observe that the erasure errors enter as a classical average over fully depolarizing channels. Further, we show that computing the CI for erasure errors only can be done efficiently upon sampling over erasure configurations. We then test our approach on the two-dimensional toric and color codes and compute optimal thresholds for erasure errors only, finding a <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mn>50</a:mn> <a:mi mathvariant="normal">%</a:mi> </a:math> threshold for both codes. This strengthens the notion that both codes share the same optimal thresholds. When considering both computational and erasure errors, the CI of small-size codes yields thresholds in very accurate agreement with established results that have been obtained in the thermodynamic limit. Next, we perform a similar analysis for a low-density parity-check (LDPC) code—the lift-connected surface code. We find a <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline"> <d:mn>50</d:mn> <d:mi mathvariant="normal">%</d:mi> </d:math> threshold under erasure errors alone and, for the first time, derive the exact statistical mechanics mappings in the presence of both computational and erasure errors. We thereby further establish the CI as a practical tool for studying optimal thresholds for code classes beyond topological codes under realistic noise, and as a means for uncovering new relations between QEC codes and statistical physics models.

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2025-11-07
DOI
https://doi.org/10.1103/d8rx-srpn
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fundamental Thresholds for Computational and Erasure Errors via the Coherent Information

Markus Michael Müller, Luis Colmenárez, S. Kim
2 citations
PRX Quantum
Quantum Computing Algorithms and Architecture
4.96
article

Fundamental Thresholds for Computational and Erasure Errors via the Coherent Information

Markus Michael Müller, Luis Colmenárez, S. Kim
article en
2 citations

Abstract

Quantum error correcting (QEC) codes protect quantum information against environmental noise. Computational errors caused by the environment change the quantum state within the qubit subspace, whereas quantum erasures correspond to the loss of qubits at known positions. Correcting either type of error involves different correction mechanisms, which makes studying the interplay between erasure and computational errors particularly challenging. In this work, we propose a framework based on the coherent information (CI) of the mixed-state density operator associated to noisy QEC codes, for treating both types of errors together. We show how to rigorously derive different families of statistical mechanics mappings for generic stabilizer QEC codes in the presence of both types of errors. We observe that the erasure errors enter as a classical average over fully depolarizing channels. Further, we show that computing the CI for erasure errors only can be done efficiently upon sampling over erasure configurations. We then test our approach on the two-dimensional toric and color codes and compute optimal thresholds for erasure errors only, finding a <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mn>50</a:mn> <a:mi mathvariant="normal">%</a:mi> </a:math> threshold for both codes. This strengthens the notion that both codes share the same optimal thresholds. When considering both computational and erasure errors, the CI of small-size codes yields thresholds in very accurate agreement with established results that have been obtained in the thermodynamic limit. Next, we perform a similar analysis for a low-density parity-check (LDPC) code—the lift-connected surface code. We find a <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline"> <d:mn>50</d:mn> <d:mi mathvariant="normal">%</d:mi> </d:math> threshold under erasure errors alone and, for the first time, derive the exact statistical mechanics mappings in the presence of both computational and erasure errors. We thereby further establish the CI as a practical tool for studying optimal thresholds for code classes beyond topological codes under realistic noise, and as a means for uncovering new relations between QEC codes and statistical physics models.

PRX QuantumVol. 6(4)
Forschungszentrum Jülich (DE), Sejong University (KR), RWTH Aachen University (DE)
Openalex Percentile: Top 4%
Quantum Computing Algorithms and Architecture
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.