Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound
cs.IT, math.IT, quant-ph
Submitted: 2026-10-02
Updated: 2026-10-02
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Explicit expanders of every degree and size
- Authentication of Quantum Messages
- Good Quantum LDPC Codes with Linear Time Decoders
- Decodable quantum LDPC codes beyond the $\sqrt{n}$ distance barrier using high dimensional expanders
- Bounds for list-decoding and list-recovery of random linear codes
- Stabilizer Codes and Quantum Error Correction
- Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes
- Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound
- Fault-tolerant quantum computation by anyons
- Quantum Error Correction near the Coding Theoretical Bound
- Concatenated Quantum Codes
- New Cosystolic Expanders from Tensors Imply Explicit Quantum LDPC Codes with $\Omega(\sqrt{n}\log^kn)$ Distance
- Quantum Tanner codes
- LDPC Codes Achieve List Decoding Capacity
- Random Construction of Quantum LDPC Codes
- Concatenated quantum codes can attain the quantum Gilbert-Varshamov bound
- Geometrical constructions of purity testing protocols and their applications to quantum communication
- Finite-rate sparse quantum codes aplenty
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
Related papers
- Language Modeling is Monotone Compression
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications
- Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels