Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
Quantum error correction exploiting degeneracy to approach the hashing bound
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2representative citing papers
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.
- A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases