Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
A recursive approach to low complexity codes
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2representative citing papers
Constructs explicit regular high-girth quantum LDPC codes from square-base hypergraph products and CPM lifts, including a [[28800,62]] (3,6)-regular code with zero observed decoding failures in 2.993e8 trials at p=0.1402.
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.
-
High-Girth Regular Quantum LDPC Codes from Square-Base Hypergraph Products via CPM Lifts
Constructs explicit regular high-girth quantum LDPC codes from square-base hypergraph products and CPM lifts, including a [[28800,62]] (3,6)-regular code with zero observed decoding failures in 2.993e8 trials at p=0.1402.