Performance Analysis of Quantum CSS Error-Correcting Codes via MacWilliams Identities
Diego Forlivesi, Lorenzo Valentini, Marco Chiani

TL;DR
This paper derives performance bounds and asymptotic error rates for quantum CSS codes using MacWilliams identities, providing insights into their effectiveness on various quantum channels and under realistic noise conditions.
Contribution
It introduces a novel method combining weight enumerators and logical operator analysis to precisely evaluate quantum code performance and error rates.
Findings
Exact asymptotic logical error rates for several quantum codes.
Derived tight upper bounds on error rates over depolarizing channels.
Extended analysis to include noisy syndrome extraction circuits.
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 , the logical error rate is asymptotically for the Shor…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
