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:2305.01301 · Quantum

Performance Analysis of Quantum CSS Error-Correcting Codes via MacWilliams Identities

Diego Forlivesi, Lorenzo Valentini, Marco Chiani

Published Dec 16, 2025• 12 citations
arXivHTMLPDF

Abstract

We analyze the performance of quantum stabilizer codes, one of the most important classes for practical implementations, on both symmetric and asymmetric quantum channels. To this aim, we first derive the weight enumerator (WE) for the undetectable errors based on the quantum MacWilliams identities. The WE is then used to evaluate tight upper bounds on the error rate of CSS quantum codes with minimum weight decoding. For surface codes we also derive a simple closed form expression of the bounds over the depolarizing channel. We introduce a novel approach that combines the knowledge of WE with a logical operator analysis, allowing the derivation of the exact asymptotic error rate for short codes. For example, on a depolarizing channel with physical error rate ρ → 0 , the logical error rate ρ L is asymptotically ρ L ≈ 16 ρ 2 for the [ [ 9 , 1 , 3 ] ] Shor code, ρ L ≈ 16.3 ρ 2 for the [ [ 7 , 1 , 3 ] ] Steane code, ρ L ≈ 18.7 ρ 2 for the [ [ 13 , 1 , 3 ] ] surface code, and ρ L ≈ 149.3 ρ 3 for the [ [ 41 , 1 , 5 ] ] surface code. For larger codes our bound provides ρ L ≈ 1215 ρ 4 and ρ L ≈ 663 ρ 5 for the [ [ 85 , 1 , 7 ] ] and the [ [ 181 , 1 , 10 ] ] surface codes, respectively. Finally, we extend our analysis to include realistic, noisy syndrome extraction circuits by modeling error propagation throughout gadgets. This enables estimation of logical error rates under faulty measurements. The performance analysis serves as a design tool for developing fault-tolerant quantum systems by guiding the selection of quantum codes based on their error correction capability. Additionally, it offers a novel perspective on quantum degeneracy, showing it represents the fraction of non-correctable error patterns shared by multiple logical operators.

DOI
10.22331/q-2025-12-16-1950

Related papers

Complete Weight Distributions and MacWilliams Identities for Asymmetric Quantum Codes

Chuangqiang Hu, Shudi Yang, Stephen S.‐T. Yau

In 1997, Shor and Laflamme defined the weight enumerators for quantum error-correcting codes and derived a MacWilliams identity. We extend their work by introducing our double weight enumerators and complete weight enumerators for qubit codes and then investigate the MacWilliams identities for these enumerators. Based on the generalized MacWilliams identities, we solve an open problem, namely, the Singleton-type bound for asymmetric quantum codes (AQCs). Besides, the Hamming-type and the first linear-programming-type bounds for the AQCs are deduced similarly.

arXiv:1810.11969•IEEE Access•Jan 1, 2019•7 citations

Mirror codes: High-threshold quantum LDPC codes beyond the CSS regime

Andrey Boris Khesin, Jonathan Z. Lu

The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group $G$ and two subsets of $G$ whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find $[[ 60, 4, 10 ]], [[ 36, 6, 6 ]], [[ 48, 8, 6 ]]$, and $[[ 85, 8, 9 ]]$ codes, all of which are not CSS; we also find several weight-7 codes with $kd > n$. Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of $0.2\%$, approximately matching that of the $[[ 144, 12, 12 ]]$ BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.

quant-pharXiv:2603.05496•Mar 6, 2026•9 citations

Quantum Data-Syndrome Codes

Alexei Ashikhmin, Ching-Yi Lai, Todd A. Brun

Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of measured error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose syndrome measurement (SM) and quantum data-syndrome (DS) codes. SM codes protect syndrome with linearly dependent redundant stabilizer measurements. DS codes generalize this idea for simultaneous correction of both data qubits and syndrome bits errors. We study fundamental properties of quantum DS codes, including split weight enumerators, generalized MacWilliams identities, and linear programming bounds. In particular, we derive Singleton and Hamming-type upper bounds on the minimum distance of degenerate quantum DS codes. Then we study random DS codes and show that random DS codes with a relatively small additional syndrome measurements achieve the Gilbert-Varshamov bound of stabilizer codes. Finally, we propose a family of CSS-type quantum DS codes based on classical cyclic codes, which include the Steane code and the quantum Golay code.

arXiv:1907.01393•IEEE Journal on Selected Areas in Communications•Jan 30, 2020•48 citations

LDGM-Based Quantum Codes for Fault-Tolerant Quantum Computation

Yumin Li, Kejing Liu, Hanqing Lou +1 more

We construct a new family of Calderbank-Shor-Steane (CSS) codes using the generator and parity-check matrices of Low-Density Generator Matrix (LDGM) codes, with row operations applied to both matrices in order to achieve the desired quantum rate. Decoding is performed in an iterative manner, by applying message passing over the associated graph, and discrete Density Evolution (DDE) is used to optimize performance in the depolarizing channel. The proposed construction offers high flexibility and easiness in the design, producing quantum codes that possess excellent error correction capabilities. By properly designing the structure of the code, we are able to control and bound the weight of the stabilizer generators to a small value, which results in codes particularly well suited for fault-tolerant quantum computation. At the same time, these codes achieve very good performance in terms of error correction capability.

quant-pharXiv:2607.15159•Jul 17, 2026•0 citations

Quantum CSS codes: Decoder-aware multiobjective design and bound-certified selection

Jiapei Zhuang, Yaocheng Chen, Xingyao Wu

Quantum error-correcting codes trade decoding reliability against the resources needed to measure their checks. We formulate Calderbank-Shor-Steane (CSS) code design at fixed encoding resources as a decoder-aware multiobjective problem. The objectives are failure probability under sector-wise degenerate maximum-likelihood decoding and check weight, the minimum total weight of an independent pure-type generator basis. For independent bit- and phase-flip noise with perfect syndrome extraction, deterministic truncation bounds support selection under a failure-rate constraint. At a per-sector error probability of 0.01, the bounds certify that a code encoding two logical qubits into 40 physical qubits meets a failure-rate target of 0.001 at check weight 139. The lower bound of every cheaper candidate in the corresponding (40,2) main menu exceeds this target. In paired searches sharing one annealing kernel and equal query budgets, decoder-aware guidance gives significantly higher mean final hypervolume than distance guidance in all eight tested configurations under the reported Holm correction. Against distance-multiplicity guidance, five configurations show significant gains and three do not, including one with a negative mean difference. All arms are scored in common truncated-reliability and normalized-check-weight coordinates. The framework connects reliability-check-weight trade-offs to bound-certified selection within evaluated CSS pools.

arXiv:2611.14923•Nov 11, 2026•0 citations

Quantum error correction and fault-tolerant quantum computation

Todd A. Brun, Ching–Yi Lai

Quantum computers need to be protected by quantum error-correcting codes against decoherence. One of the most interesting and useful classes of quantum codes is the class of quantum stabilizer codes. Entanglement-assisted (EA) quantum codes are a class of stabilizer codes that make use of preshared entanglement between the sender and the receiver. We provide several code constructions for entanglement-assisted quantum codes. The MacWilliams identity for quantum codes leads to linear programming bounds on the minimum distance. We find new constraints on the simplified stabilizer group and the logical group, which help improve the linear programming bounds on entanglement-assisted quantum codes. The results also can be applied to standard stabilizer codes. In the real world, quantum gates are faulty. To implement quantum computation fault-tolerantly, quantum codes with certain properties are needed. We first analyze Knill's postselection scheme in a two-dimensional architecture. The error performance of this scheme is better than other known concatenated codes. Then we propose several methods to protect syndrome extraction against measurement errors.

•Jan 1, 2013•0 citations
We analyze the performance of quantum stabilizer codes, one of the most important classes for practical implementations, on both symmetric and asymmetric quantum channels. To this aim, we first derive the weight enumerator (WE) for the undetectable errors based on the quantum MacWilliams identities. The WE is then used to evaluate tight upper bounds on the error rate of CSS quantum codes with minimum weight decoding. For surface codes we also derive a simple closed form expression of the bounds over the depolarizing channel. We introduce a novel approach that combines the knowledge of WE with a logical operator analysis, allowing the derivation of the exact asymptotic error rate for short codes. For example, on a depolarizing channel with physical error rate ρ → 0 , the logical error rate ρ L is asymptotically ρ L ≈ 16 ρ 2 for the [ [ 9 , 1 , 3 ] ] Shor code, ρ L ≈ 16.3 ρ 2 for the [ [ 7 , 1 , 3 ] ] Steane code, ρ L ≈ 18.7 ρ 2 for the [ [ 13 , 1 , 3 ] ] surface code, and ρ L ≈ 149.3 ρ 3 for the [ [ 41 , 1 , 5 ] ] surface code. For larger codes our bound provides ρ L ≈ 1215 ρ 4 and ρ L ≈ 663 ρ 5 for the [ [ 85 , 1 , 7 ] ] and the [ [ 181 , 1 , 10 ] ] surface codes, respectively. Finally, we extend our analysis to include realistic, noisy syndrome extraction circuits by modeling error propagation throughout gadgets. This enables estimation of logical error rates under faulty measurements. The performance analysis serves as a design tool for developing fault-tolerant quantum systems by guiding the selection of quantum codes based on their error correction capability. Additionally, it offers a novel perspective on quantum degeneracy, showing it represents the fraction of non-correctable error patterns shared by multiple logical operators.
In 1997, Shor and Laflamme defined the weight enumerators for quantum error-correcting codes and derived a MacWilliams identity. We extend their work by introducing our double weight enumerators and complete weight enumerators for qubit codes and then investigate the MacWilliams identities for these enumerators. Based on the generalized MacWilliams identities, we solve an open problem, namely, the Singleton-type bound for asymmetric quantum codes (AQCs). Besides, the Hamming-type and the first linear-programming-type bounds for the AQCs are deduced similarly.
The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group GGG and two subsets of GGG whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find [[60,4,10]],[[36,6,6]],[[48,8,6]][[ 60, 4, 10 ]], [[ 36, 6, 6 ]], [[ 48, 8, 6 ]][[60,4,10]],[[36,6,6]],[[48,8,6]], and [[85,8,9]][[ 85, 8, 9 ]][[85,8,9]] codes, all of which are not CSS; we also find several weight-7 codes with kd>nkd > nkd>n. Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of 0.2%0.2\%0.2%, approximately matching that of the [[144,12,12]][[ 144, 12, 12 ]][[144,12,12]] BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.
Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of measured error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose syndrome measurement (SM) and quantum data-syndrome (DS) codes. SM codes protect syndrome with linearly dependent redundant stabilizer measurements. DS codes generalize this idea for simultaneous correction of both data qubits and syndrome bits errors. We study fundamental properties of quantum DS codes, including split weight enumerators, generalized MacWilliams identities, and linear programming bounds. In particular, we derive Singleton and Hamming-type upper bounds on the minimum distance of degenerate quantum DS codes. Then we study random DS codes and show that random DS codes with a relatively small additional syndrome measurements achieve the Gilbert-Varshamov bound of stabilizer codes. Finally, we propose a family of CSS-type quantum DS codes based on classical cyclic codes, which include the Steane code and the quantum Golay code.
We construct a new family of Calderbank-Shor-Steane (CSS) codes using the generator and parity-check matrices of Low-Density Generator Matrix (LDGM) codes, with row operations applied to both matrices in order to achieve the desired quantum rate. Decoding is performed in an iterative manner, by applying message passing over the associated graph, and discrete Density Evolution (DDE) is used to optimize performance in the depolarizing channel. The proposed construction offers high flexibility and easiness in the design, producing quantum codes that possess excellent error correction capabilities. By properly designing the structure of the code, we are able to control and bound the weight of the stabilizer generators to a small value, which results in codes particularly well suited for fault-tolerant quantum computation. At the same time, these codes achieve very good performance in terms of error correction capability.
Quantum error-correcting codes trade decoding reliability against the resources needed to measure their checks. We formulate Calderbank-Shor-Steane (CSS) code design at fixed encoding resources as a decoder-aware multiobjective problem. The objectives are failure probability under sector-wise degenerate maximum-likelihood decoding and check weight, the minimum total weight of an independent pure-type generator basis. For independent bit- and phase-flip noise with perfect syndrome extraction, deterministic truncation bounds support selection under a failure-rate constraint. At a per-sector error probability of 0.01, the bounds certify that a code encoding two logical qubits into 40 physical qubits meets a failure-rate target of 0.001 at check weight 139. The lower bound of every cheaper candidate in the corresponding (40,2) main menu exceeds this target. In paired searches sharing one annealing kernel and equal query budgets, decoder-aware guidance gives significantly higher mean final hypervolume than distance guidance in all eight tested configurations under the reported Holm correction. Against distance-multiplicity guidance, five configurations show significant gains and three do not, including one with a negative mean difference. All arms are scored in common truncated-reliability and normalized-check-weight coordinates. The framework connects reliability-check-weight trade-offs to bound-certified selection within evaluated CSS pools.
Quantum computers need to be protected by quantum error-correcting codes against decoherence. One of the most interesting and useful classes of quantum codes is the class of quantum stabilizer codes. Entanglement-assisted (EA) quantum codes are a class of stabilizer codes that make use of preshared entanglement between the sender and the receiver. We provide several code constructions for entanglement-assisted quantum codes. The MacWilliams identity for quantum codes leads to linear programming bounds on the minimum distance. We find new constraints on the simplified stabilizer group and the logical group, which help improve the linear programming bounds on entanglement-assisted quantum codes. The results also can be applied to standard stabilizer codes. In the real world, quantum gates are faulty. To implement quantum computation fault-tolerantly, quantum codes with certain properties are needed. We first analyze Knill's postselection scheme in a two-dimensional architecture. The error performance of this scheme is better than other known concatenated codes. Then we propose several methods to protect syndrome extraction against measurement errors.