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

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 \acl{MW} 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 $\rho \to 0$, the logical error rate ${\rho }_{\mathrm{L}}$ is asymptotically ${\rho }_{\mathrm{L}}\approx 16{\rho }^2$ for the $[[9,1,3]]$ Shor code, ${\rho }_{\mathrm{L}}\approx 16.3{\rho }^2$ for the $[[7,1,3]]$ Steane code, ${\rho }_{\mathrm{L}}\approx 18.7{\rho }^2$ for the $[[13,1,3]]$ surface code, and ${\rho }_{\mathrm{L}}\approx 149.3{\rho }^3$ for the $[[41,1,5]]$ surface code. For larger codes our bound provides ${\rho }_{\mathrm{L}}\approx 1215{\rho }^4$ and ${\rho }_{\mathrm{L}}\approx 663{\rho }^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.

25 pages, 10 figures, accepted in Quantum journal

References in corpus (30)

• Quantum entanglement
• Aspects of generic entanglement
• On the dimension of subspaces with bounded Schmidt rank
• The Entanglement of Superpositions
• Generic local distinguishability and completely entangled subspaces
• A completely entangled subspace of maximal dimension
• Quantum Codes of Maximal Distance and Highly Entangled Subspaces
• The Structure of Qubit Unextendible Product Bases
• Genuinely entangled subspace with all-encompassing distillable entanglement across every bipartition
• Three-by-three bound entanglement with general unextendible product bases
• From unextendible product bases to genuinely entangled subspaces
• Non-Positive Partial Transpose Subspaces Can be as Large as Any Entangled Subspace
• A note on the optimality of decomposable entanglement witnesses and completely entangled subspaces
• Entanglement of Subspaces and Error Correcting Codes
• Numerical studies of entangled PPT states in composite quantum systems
• Low rank extremal PPT states and unextendible product bases
• Self-testing maximally-dimensional genuinely entangled subspaces within the stabilizer formalism
• Universal construction of genuinely entangled subspaces of any size
• Fine-Structure Classification of Multiqubit Entanglement by Algebraic Geometry
• Genuine Multipartite Entanglement of Superpositions
• Highly entangled, non-random subspaces of tensor products from quantum groups
• An approach to constructing genuinely entangled subspaces of maximal dimension
• Entangled subspaces and generic local state discrimination with pre-shared entanglement
• Benchmarks of Nonclassicality for Qubit Arrays
• Entanglement properties of positive operators with ranges in completely entangled subspaces
• An Algebraic-Geometric Characterization of Tripartite Entanglement
• Fully non-positive-partial-transpose genuinely entangled subspaces
• Construction of genuinely entangled multipartite subspaces from bipartite ones by reducing the total number of separated parties
• Entanglement in Random Subspaces
• Classifying Entanglement by Algebraic Geometry