Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
Finite-degree quantum LDPC codes reaching the gilbert–varshamov bound
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3representative citing papers
Spatially coupled MN/HA CSS codes achieve the quantum-erasure hashing bound under seeded BP decoding at the DE level for the X/Z equal-rate family.
citing papers explorer
-
Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes
Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
-
Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
Spatially coupled MN/HA CSS codes achieve the quantum-erasure hashing bound under seeded BP decoding at the DE level for the X/Z equal-rate family.
- A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases