Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
A probabilistic algorithm for computing minimum weights of large error- correcting codes,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative 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.