Achievability of CSS codes performance limits over Pauli channels under separate ML decoding with bounded graphical complexity
cs.IT, math.IT, quant-ph
Submitted: 2026-11-02
Updated: 2026-11-02
Comments: 45 pages, 9 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
- Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound
- Capacity-achieving ensembles for the binary erasure channel with bounded complexity
- Capacity-Achieving Codes with Bounded Graphical Complexity on Noisy Channels
- Recovery in quantum error correction for general noise without measurement
- Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound